✨ Day 30: Backtracking ✨
📌 Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail to satisfy the constraints of the problem at any point in time (by time, here, is referred to the time elapsed till reaching any level of the search tree). Backtracking can also be said as an improvement to the brute force approach. So basically, the idea behind the backtracking technique is that it searches for a solution to a problem among all the available options.
✏️ 𝗙𝗼𝗿 𝗯𝗲𝘁𝘁𝗲𝗿 𝘂𝗻𝗱𝗲𝗿𝘀𝘁𝗮𝗻𝗱𝗶𝗻𝗴 𝗿𝗲𝗳𝗲𝗿 𝗳𝗼𝗹𝗹𝗼𝘄𝗶𝗻𝗴 𝗮𝗿𝘁𝗶𝗰𝗹𝗲𝘀 ;
- https://www.geeksforgeeks.org/introduction-to-backtracking-data-structure-and-algorithm-tutorials/
- https://www.geeksforgeeks.org/backtracking-algorithms/?ref=lbp
- https://medium.com/techie-delight/backtracking-practice-problems-and-interview-questions-6a17cb6d08a7
- https://www.abhinavpandey.dev/blog/backtracking-algorithms
📽️ 𝗧𝘂𝘁𝗼𝗿𝗶𝗮𝗹 𝗟𝗶𝗻𝗸𝘀;
- https://www.youtube.com/watch?v=Peo7k2osVVs
- https://www.youtube.com/watch?v=DKCbsiDBN6c
- https://www.youtube.com/playlist?list=PL9gnSGHSqcnp39cTyB1dTZ2pJ04Xmdrod
- https://www.youtube.com/watch?v=i05Ju7AftcM
👨💻 𝗤𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝗶𝗻𝗴 𝗥𝗼𝘂𝗻𝗱: 👇
- https://www.geeksforgeeks.org/longest-possible-route-in-a-matrix-with-hurdles/
- https://leetcode.com/problems/n-queens/
- https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1
- https://www.geeksforgeeks.org/tug-of-war/