Get a Strong Hold
1
Recursive Implementation of atoi()
2
Pow(x, n)
3
Count Good numbers
4
Sort a stack using recursion
5
Reverse a stack using recursion
Subsequences Pattern
Generate all binary strings
Generate Paranthesis
Print all subsequences/Power Set
Learn All Patterns of Subsequences (Theory)
Count all subsequences with sum K
6
Check if there exists a subsequence with sum K
7
Combination Sum
8
Combination Sum-II
9
Subset Sum-I
10
Subset Sum-II
11
Combination Sum - III
12
Letter Combinations of a Phone number
Trying out all Combos / Hard
Palindrome Partitioning
Word Search
N Queen
Rat in a Maze
Word Break
M Coloring Problem
Sudoko Solver
Expression Add Operators