Problem solving practice by solving leetcode questions.
- palindrome-partitioning: https://github.com/soumyaPrakashB/LeetCode/tree/main/LeetCode131
- letter-combinations-of-a-phone-number: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode17/LeetCode17.java
- combination-sum: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode39/LeetCode39.java
- combination-sum-II: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode40/LeetCode40.java
- combination-sum-III: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode216/CombinationSumIII.java
- permutations: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode46/Permutations.java
- permutations-II: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode47/PermutationsII.java
- coin-change-II: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode518/CoinChangeII.java
- combinations: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode77/Combinations.java
- subsets: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode78/SubSets.java
- subsets-II: https://github.com/soumyaPrakashB/LeetCode/blob/main/LeetCode90/SubSets2.java
- 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.