This repository contains the problems and their solutions in Java. I have tried to
explain all the steps by writing meaningful comments in the code. I have also tried
to provide the links of the problems so that you can practice those problems.
- Subsequence with sum equal to K
- Print only one subsequence whose sum is eqaul to K (Variation of previous problem)
- Count of subsequences with sum equal to K (Leetcode_1498_Medium : https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/)
- Combination sum (Leetcode_39_Medium : https://leetcode.com/problems/combination-sum/)
- Combination sum II (Leetcode_40_Medium : https://leetcode.com/problems/combination-sum-ii/)
- Subset sum I (GFG : https://practice.geeksforgeeks.org/problems/subset-sums2234/1)
- Subset sum II (Leetcode_90_Medium : https://leetcode.com/problems/subsets-ii/)
- Print all permutations of a string/array (Leetcode_46_Medium : https://leetcode.com/problems/permutations/)
- N Queens problem (Leetcode_51_Hard : https://leetcode.com/problems/n-queens/)
- Sudoku solver (Leetcode_37_Hard : https://leetcode.com/problems/sudoku-solver/)
- Palindrome partitioning (Leetcode_131_Medium : https://leetcode.com/problems/palindrome-partitioning/)
- Rat in a maze-I (GFG_Medium : https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1)
- Kth permutation sequence (Leetcode_60_Hard : https://leetcode.com/problems/permutation-sequence/)
- Delete middle element from stack
- Factorial of a number
- Fibonacci series
- Generate all balanced parenthesis
- Josephus problem
- Kth symbol in grammer
- Letter case permuation
- Palindromic string
- Permutations with case change
- Permutations with spaces
- Print 1 to N
- Print N to 1
- Print N to 1 using Backtracking
- Reverse array
- Print unique subsets
- Reverse stack
- Sort array using Recursion
- Sort stack using Recursion
- Tower of Hanoi
- Sum of first N numbers
- Sum of array using Recursion