In this repository, I shared everything I have done during the 28 days of 1337 piscine.
C00/ex08
I added another simple solution ft_print_combn_simple.c using backtracking (don't get scared of the name young novice 😂❤️)
C05/ex08
The code I pushed during my piscine, although it was correct, yet I still believe that it's not a good way of solving this problem.
Because, when reaching a deadend or a solution, I kept calling the function backwards rather than letting it go to its previous call stacks (if that make sense 🙂). Thus, I needed to know the number of solutions beforehand if I want the function to quit.
Here is another simpler solution to this problem: the n queens
Me and @awbx have worked on the bsq project, all functional tests succeeded, but we got a SEGABORT in the basic test. Therefore, we failed this project with a 50% score.
You can take some ideas from what we've done. Or, you may also want to check our friends @Ceciver and @XMoulinette's BSQ with a 100% success score.
