Various types of problmes are solved from leetcode, geekforgeeks etc..
******************************** backTracking ****************************************
************************* Backtracking ************************************
Following problems are covered in this module
1) Find all permutation of unique characters string by Backtracking
2) Coooolest algorithm to count and print all permutation of unique characters string by iterative
3) Find all permutation of repeated characters string by BackTracking
4) Find all Subset of characters string considering repeated characters by BackTracking
5) Find all valid IP addresses from combination of number string by BackTracking
6) Find all valid IP addresses from combination of number string by iteration
******************************** graph ************************************************
**************************** leetCodeProblems ********************************
************************* Array Operations ********************************
Following problems are covered in this module
1) Find the max sum sub array by Kadane's Algorithm
2) Find any peek element in given unsorted array or list.
3) Find element that came minimum 1/4 th times total elements in sorted array
4) Find longest increasing sub sequence in given array
5) Find Max Sum longest increasing sub sequence in given array
6) Find minimum jumps to reach at the end of array
7) Find minimum jumps to reach at the end of array by Dynamic Programming
8) Find the next high / greater element of every element of array
9) Find the majority element in given array if any or return None
************************* Excel *******************************************
Following problems are covered in this module
1) Convert excel column letters to integer number
2) Convert excel column number to letters
************************* Matrix Operations *******************************
Following problems are covered in this module
1) Knapsack Algorithm by recursive naive approach
2) Knapsack Algorithm by Dynamic Programming approach
3) find count of negative elements in matrix
4) Search the element in sorted matrix
5) Find minimum cost path from left most corner (0,0) to right low corner (last,last) of matrix
************************* Histogram Area **********************************
Following problems are covered in this module
1) Find the maximum rectangle area formed by given histogram
************************* Reservoir Sampling ******************************
Following problems are covered in this module
1) Return random k samples from large data set
************************* String Operations *******************************
Following problems are covered in this module
1) Finds common characters of two strings
2) Find the longest palindrome in given string by Monarch Algorithm
3) Wild card match of text string and pattern by Dynamic programming
4) Wild card match of text string and pattern by iterative
5) Regular expression match of text string and pattern by Dynamic programming
************************* Rain water Trapping *****************************
Following problems are covered in this module
1) Solution for Trapping Rain Water problem
******************************** tree ************************************************
************************* BST Operations ***********************************
Following problems are covered in this module
1) Insert Node in BST
2) Create bst using List data set
3) Create tree using inorder traversal list and preorder traversal list
4) Create tree using inorder traversal list and postorder traversal list.
5) Find sum of minimum sum path sum
6) Find sum of maximum sum path sum
7) Find size of a tree
8) Find density of tree
9) Sink the odd node to down of tree
10) Find if one bst is sub bst of other
11) Checks the node is present in Bst or not
12) Find nearest ancestor in bst
13) Find the minimum distance between two nodes in bst
14) Find Kth smallest element in bst
************************* Binary Tree Operations ***************************
Following problems are covered in this module
1) Inorder traversal - print
2) Preorder traversal - print
3) Postorder traversal - print
4) Level order traversal - print
5) Reverse Level order traversal ( Bottom to root approach) - print
6) Spiral Level order traversal (one level from left to right and another from right to left) - print
7) Print boundary elements of tree
8) Find if two tress are mirror to each other
9) Convert tree into it's mirror tree
10) Create new mirror tree of given tree
11) Find if two tress are similar to each other
12) Find node is exist in Binary Tree or not - iterative solution
13) Find common ancestor of two nodes in Binary Tree
14) Count the number of nodes from root to desire node in BT
15) Serialize the data of binary tree
16) De-serialize the data to create binary tree
******************************** trie ************************************************