LeetCode

Problem solving practice by solving leetcode questions.

Backtracking problems list:

1. palindrome-partitioning: https://github.com/soumyaPrakashB/LeetCode/tree/main/LeetCode131
2. letter-combinations-of-a-phone-number: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode17/LeetCode17.java
3. combination-sum: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode39/LeetCode39.java
4. combination-sum-II: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode40/LeetCode40.java
5. combination-sum-III: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode216/CombinationSumIII.java
6. permutations: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode46/Permutations.java
7. permutations-II: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode47/PermutationsII.java
8. coin-change-II: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode518/CoinChangeII.java
9. combinations: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode77/Combinations.java
10. subsets: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode78/SubSets.java
11. subsets-II: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode90/SubSets2.java
12. restore-ip-address: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode93/RestoreIpAddress.java This solution is similar to that of palindrome partitioning. We will only consider a substring if it is eligible to be part of an IP (0 <= num <= 255 && no leading zeros). In case of palindrome partition, we only consider those substring which are palindrome themselves.