450 Data Structure and Algorithms Questions
This Repository contains solutions of DS Algo practice problems given in the SDE sheet by Love Babbar in this Video
Language Used - C++
Progress -
| Category/Tags | Problem | Solution |
|---|---|---|
| Arrays | Minimum and Maximum of Array | Code |
| Arrays | Reverse the Array | Code |
| Arrays | Find the "Kth" max and min element of an array | Code |
| Arrays | Rotate the Array | Code |
| Arrays | Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo | Code |
| Arrays | Union And Intersection of 2 Arrays | Code |
| Arrays | Find Largest sum contiguous Subarray | Code |
| Arrays | Find duplicate in an array of N+1 Integers | Code |
| Arrays | Merge two sorted Arrays without using extra Space | Code |
| Arrays | Count pairs with given sum | Code |
| Arrays | Arrange the positive and negative elements of array Alternately. | Code |
| Arrays | Merge Intervals | Code |
| Arrays | Best time to buy and sell stocks. | Code |
| Arrays | Next Permutation | Code |
| Arrays | Inversion Count | Code |
| Arrays | Maximum Product Array | Code |
| Arrays | Subarray with zero sum | Code |
| Arrays | Factorial of Large Numbers | Code |
| Arrays | Longest Consecutive Subsequence | Code |
| Arrays | Triplet Sum in an Array | Code |
| Arrays | Array Subset of another array | Code |
| Arrays | Trapping Rain Water | Code |
| Arrays | Chocolate Distribution Problem | Code |
| Arrays | Smallest subarray with sum greater than x | Code |
| Arrays | Find minimum number of merge operations to make an array palindrome | Code |
| Arrays | Three Way Partitioning | Code |
| Arrays | Minimum swaps required to bring all elements less than or equal to k together ! | Code |
| Arrays | Code | |
| Arrays | Code | |
| Arrays | Code | |
| Arrays | Code | |
| Matrix | Spiral Traversal of Matrix | Code |
| Matrix | Search in a Matrix | Code |
| Matrix | Median in row wise sorted Matrix | Code |
| Matrix | Row With Maximum Ones | Code |
| String | Reversing a String | Code |
| String | Check if String is Palindrome | Code |
| String | Print Duplicates in a string | Code |
| String | Split the binary string into substrings with equal number of 0s and 1s | Code |
| String | Program to check if strings are rotations of each other | Code |
| String / DP | Longest Common Subsequence (Memoization) | Code |
| String / DP | Longest Common Subsequence (Tabulation) | Code |
| String | Convert a sentence into its equivalent mobile numeric keypad sequence | Code |
| String | Minimum number of bracket reversals needed to make an expression balanced | Code |
| String | Roman to Decimal | Code |
| String | KMP Search | Code |
| String | Rabin Karp Algorithm | Code |
| String | Code | |
| String | Code | |
| String | Code | |
| String | Code | |
| String | Code | |
| Stack | Stack from Scratch | Code |
| Stack | Reverse a String using Stack | Code |
| Stack | Implement two stacks in an array | Code |
| Stack | Implement k Stacks in an array | Code |
| Stack | Remove All Adjacent Duplicates In String | Code |
| Stack | Remove Outermost Parentheses | Code |
| Stack | Code | |
| Stack | Code | |
| Binary Tree | Level Order Traversal of Binary Tree | Code |
| Binary Tree | Level Order Traversal of Binary Tree | Code |
| Binary Tree | Height of the Tree | Code |
| Binary Tree | Maximum Element in the Tree | Code |
| Binary Tree | Print all the Nodes at K distance | Code |
| Binary Tree | Number of Nodes in Tree | Code |
| Binary Tree | Left View Of Tree | Code |
| Binary Tree | Code | |
| Binary Tree | Code | |
| Binary Tree | Code | |
| Binary Tree | Code | |
| Graph | Adjecency List | Code |
| Graph | BFS of undirected Graph | Code |
| Graph | DFS of undirected Graph | Code |
| Graph | Check if cycle exists | Code |
| Graph | Check if Bipartite Graph (BFS) | Code |
| Graph | Check if there is a cycle in Directed Graph (DFS) | Code |
| Graph | Topological Sort (BFS)(Kanh's Algorithm) | Code |
| Graph | Topological Sort (DFS) | Code |
| Graph | Check if there is a cycle in Directed Graph (BFS) | Code |