Love Babbar SDE Sheet Problem
Array-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1 | Reverse the array | Click | Coming Soon | Coming Soon | Code | Code | Code |
2 | Find the maximum and minimum element in an array | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Find the “Kth” max and min element of an array | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Move all the negative elements to one side of the array | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Find the Union and Intersection of the two sorted arrays. | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Write a program to cyclically rotate an array by one. | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | find Largest sum contiguous Subarray [V. IMP] | Click | Coming Soon | Coming Soon | Code | Code | Code |
9 | Minimise the maximum difference between heights [V.IMP] | Click | Coming Soon | Coming Soon | Code | Code | Code |
10 | Minimum no. of Jumps to reach end of an array | Click | Coming Soon | Coming Soon | Code | Code | Code |
11 | find duplicate in an array of N+1 Integers | Click | Coming Soon | Coming Soon | Code | Code | Code |
12 | Merge 2 sorted arrays without using Extra space. | Click | Coming Soon | Coming Soon | Code | Code | Code |
13 | Kadane’s Algo [V.V.V.V.V IMP] | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | Merge Intervals | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Next Permutation | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Count Inversion | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Best time to buy and Sell stock | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | find all pairs on integer array whose sum is equal to given number | Click | Coming Soon | Coming Soon | Code | Code | Code |
19 | find common elements In 3 sorted arrays | Click | Coming Soon | Coming Soon | Code | Code | Code |
20 | Rearrange the array in alternating positive and negative items with O(1) extra space | Click | Coming Soon | Coming Soon | Code | Code | Code |
21 | Find if there is any subarray with sum equal to 0 | Click | Coming Soon | Coming Soon | Code | Code | Code |
22 | Find factorial of a large number | Click | Coming Soon | Coming Soon | Code | Code | Code |
23 | find maximum product subarray | Click | Coming Soon | Coming Soon | Code | Code | Code |
24. | Find longest coinsecutive subsequence | Click | Coming Soon | Coming Soon | Code | Code | Code |
25. | Given an array of size n and a number k, fin all elements that appear more than ” n/k ” times. | Click | Coming Soon | Coming Soon | Code | Code | Code |
26. | Maximum profit by buying and selling a share atmost twice | Click | Coming Soon | Coming Soon | Code | Code | Code |
27. | Find whether an array is a subset of another array | Click | Coming Soon | Coming Soon | Code | Code | Code |
28. | Find the triplet that sum to a given value | Click | Coming Soon | Coming Soon | Code | Code | Code |
29. | Trapping Rain water problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
30. | Chocolate Distribution problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
31. | Smallest Subarray with sum greater than a given value | Click | Coming Soon | Coming Soon | Code | Code | Code |
32. | Three way partitioning of an array around a given value | Click | Coming Soon | Coming Soon | Code | Code | Code |
33. | Minimum swaps required bring elements less equal K together | Click | Coming Soon | Coming Soon | Code | Code | Code |
34. | Minimum no. of operations required to make an array palindrome | Click | Coming Soon | Coming Soon | Code | Code | Code |
35. | Median of 2 sorted arrays of equal size | Click | Coming Soon | Coming Soon | Code | Code | Code |
36. | Median of 2 sorted arrays of different size | Click | Coming Soon | Coming Soon | Code | Code | Code |
Matrix-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1. | Spiral traversal on a Matrix | Click | Coming Soon | Coming Soon | Code | Code | Code |
2. | Search an element in a matriix | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Find median in a row wise sorted matrix | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Find row with maximum no. of 1’s | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Print elements in sorted order using row-column wise sorted matrix | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Maximum size rectangle | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Find a specific pair in matrix | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | Rotate matrix by 90 degrees | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Kth smallest element in a row-cpumn wise sorted matrix | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | Common elements in all rows of a given matrix | Click | Coming Soon | Coming Soon | Code | Code | Code |
String-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1. | Reverse a String | Click | Coming Soon | Coming Soon | Code | Code | Code |
2. | Check whether a String is Palindrome or not | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Find Duplicate characters in a string | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Why strings are immutable in Java? | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Write a Code to check whether one string is a rotation of another | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Write a Program to check whether a string is a valid shuffle of two strings or not | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Count and Say problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring] | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Find Longest Recurring Subsequence in String | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | Print all Subsequences of a string. | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | Print all the permutations of the given string | Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | Split the Binary string into two substring with equal 0’s and 1’s | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Word Wrap Problem [VERY IMP]. | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | EDIT Distance [Very Imp] | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Find next greater number with same set of digits. [Very Very IMP] | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Balanced Parenthesis problem.[Imp] | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Word break Problem[ Very Imp] | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | Rabin Karp Algo | Click | Coming Soon | Coming Soon | Code | Code | Code |
19. | KMP Algo | Click | Coming Soon | Coming Soon | Code | Code | Code |
20. | Convert a Sentence into its equivalent mobile numeric keypad sequence. | Click | Coming Soon | Coming Soon | Code | Code | Code |
21. | Minimum number of bracket reversals needed to make an expression balanced. | Click | Coming Soon | Coming Soon | Code | Code | Code |
22. | Count All Palindromic Subsequence in a given String. | Click | Coming Soon | Coming Soon | Code | Code | Code |
23. | Count of number of given string in 2D character array | Click | Coming Soon | Coming Soon | Code | Code | Code |
24. | Search a Word in a 2D Grid of characters. | Click | Coming Soon | Coming Soon | Code | Code | Code |
25. | Boyer Moore Algorithm for Pattern Searching. | Click | Coming Soon | Coming Soon | Code | Code | Code |
26. | Converting Roman Numerals to Decimal | Click | Coming Soon | Coming Soon | Code | Code | Code |
27. | Longest Common Prefix | Click | Coming Soon | Coming Soon | Code | Code | Code |
28. | Number of flips to make binary string alternate | Click | Coming Soon | Coming Soon | Code | Code | Code |
29. | Find the first repeated word in string. | Click | Coming Soon | Coming Soon | Code | Code | Code |
30. | Minimum number of swaps for bracket balancing. | Click | Coming Soon | Coming Soon | Code | Code | Code |
31. | Find the longest common subsequence between two strings. | Click | Coming Soon | Coming Soon | Code | Code | Code |
32. | Program to generate all possible valid IP addresses from given | Click | Coming Soon | Coming Soon | Code | Code | Code |
33. | Write a program tofind the smallest window that contains all characters of string itself. | Click | Coming Soon | Coming Soon | Code | Code | Code |
34. | Rearrange characters in a string such that no two adjacent are same | Click | Coming Soon | Coming Soon | Code | Code | Code |
35. | Minimum characters to be added at front to make string palindrome | Click | Coming Soon | Coming Soon | Code | Code | Code |
36. | Given a sequence of words, print all anagrams together | Click | Coming Soon | Coming Soon | Code | Code | Code |
37. | Find the smallest window in a string containing all characters of another string | Click | Coming Soon | Coming Soon | Code | Code | Code |
38. | Recursively remove all adjacent duplicates | Click | Coming Soon | Coming Soon | Code | Code | Code |
39. | String matching where one string contains wildcard characters | Click | Coming Soon | Coming Soon | Code | Code | Code |
40. | Function to find Number of customers who could not get a computer | Click | Coming Soon | Coming Soon | Code | Code | Code |
41. | Transform One String to Another using Minimum Number of Given Operation | Click | Coming Soon | Coming Soon | Code | Code | Code |
42. | Check if two given strings are isomorphic to each other | Click | Coming Soon | Coming Soon | Code | Code | Code |
43. | Recursively print all sentences that can be formed from list of word lists | Click | Coming Soon | Coming Soon | Code | Code | Code |
Searching & Sorting-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1. | Find first and last positions of an element in a sorted array | Click | Coming Soon | Coming Soon | Code | Code | Code |
2. | Find a Fixed Point (Value equal to index) in a given array | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Search in a rotated sorted array | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | square root of an integer | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Maximum and minimum of an array using minimum number of comparisons | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Optimum location of point to minimize total distance | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Find the repeating and the missing | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | find majority element | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Searching in an array where adjacent differ by at most k | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | find a pair with a given difference | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | find four elements that sum to a given value | Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | maximum sum such that no 2 elements are adjacent | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Count triplet with sum smaller than a given value | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | merge 2 sorted arrays | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | print all subarrays with 0 sum | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Product array Puzzle | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Sort array according to count of set bits | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | minimum no. of swaps required to sort the array | Click | Coming Soon | Coming Soon | Code | Code | Code |
19. | Bishu and Soldiers | Click | Coming Soon | Coming Soon | Code | Code | Code |
20. | Rasta and Kheshtak | Click | Coming Soon | Coming Soon | Code | Code | Code |
21. | Kth smallest number again | Click | Coming Soon | Coming Soon | Code | Code | Code |
22. | Find pivot element in a sorted array | Click | Coming Soon | Coming Soon | Code | Code | Code |
23. | K-th Element of Two Sorted Arrays | Click | Coming Soon | Coming Soon | Code | Code | Code |
24. | Aggressive cows | Click | Coming Soon | Coming Soon | Code | Code | Code |
25. | Book Allocation Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
26. | EKOSPOJ | Click | Coming Soon | Coming Soon | Code | Code | Code |
27. | Job Scheduling Algo | Click | Coming Soon | Coming Soon | Code | Code | Code |
28. | Missing Number in AP | Click | Coming Soon | Coming Soon | Code | Code | Code |
29. | Smallest number with atleastn trailing zeroes infactorial | Click | Coming Soon | Coming Soon | Code | Code | Code |
30. | Painters Partition Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
31. | ROTI-Prata SPOJ | Click | Coming Soon | Coming Soon | Code | Code | Code |
32. | DoubleHelix SPOJ | Click | Coming Soon | Coming Soon | Code | Code | Code |
33. | Subset Sums | Click | Coming Soon | Coming Soon | Code | Code | Code |
34. | Find the inversion count | Click | Coming Soon | Coming Soon | Code | Code | Code |
35. | Implement Merge-sort in-place | Click | Coming Soon | Coming Soon | Code | Code | Code |
36. | Partitioning and Sorting Arrays with Many Repeated Entries | Click | Coming Soon | Coming Soon | Code | Code | Code |
LinkedList-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1. | Write a Program to reverse the Linked List. (Both Iterative and recursive) | Click | Coming Soon | Coming Soon | Code | Code | Code |
2. | Reverse a Linked List in group of Given Size. [Very Imp] | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Write a program to Detect loop in a linked list. | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Write a program to Delete loop in a linked list. | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Find the starting point of the loop. | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Remove Duplicates in a sorted Linked List. | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Remove Duplicates in a Un-sorted Linked List. | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | Write a Program to Move the last element to Front in a Linked List.
|
Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Add “1” to a number represented as a Linked List. | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | Add two numbers represented by linked lists. | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | Intersection of two Sorted Linked List. | Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | Intersection Point of two Linked Lists. | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Merge Sort For Linked lists.[Very Important] | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | Quicksort for Linked Lists.[Very Important] | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Find the middle Element of a linked list. | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Check if a linked list is a circular linked list. | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Split a Circular linked list into two halves. | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | Write a Program to check whether the Singly Linked list is a palindrome or not. | Click | Coming Soon | Coming Soon | Code | Code | Code |
19. | Deletion from a Circular Linked List. | Click | Coming Soon | Coming Soon | Code | Code | Code |
20. | Reverse a Doubly Linked list. | Click | Coming Soon | Coming Soon | Code | Code | Code |
21. | Find pairs with a given sum in a DLL. | Click | Coming Soon | Coming Soon | Code | Code | Code |
22. | Count triplets in a sorted DLL whose sum is equal to given value “X”. | Click | Coming Soon | Coming Soon | Code | Code | Code |
23. | Sort a “k”sorted Doubly Linked list.[Very IMP] | Click | Coming Soon | Coming Soon | Code | Code | Code |
24. | Rotate DoublyLinked list by N nodes. | Click | Coming Soon | Coming Soon | Code | Code | Code |
25. | Rotate a Doubly Linked list in group of Given Size.[Very IMP] | Click | Coming Soon | Coming Soon | Code | Code | Code |
26. | Can we reverse a linked list in less than O(n) ? | Click | Coming Soon | Coming Soon | Code | Code | Code |
27. | Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ? | Click | Coming Soon | Coming Soon | Code | Code | Code |
28. | Flatten a Linked List | Click | Coming Soon | Coming Soon | Code | Code | Code |
29. | Sort a LL of 0’s, 1’s and 2’s | Click | Coming Soon | Coming Soon | Code | Code | Code |
30. | Clone a linked list with next and random pointer | Click | Coming Soon | Coming Soon | Code | Code | Code |
31. | Merge K sorted Linked list | Click | Coming Soon | Coming Soon | Code | Code | Code |
32. | Multiply 2 no. represented by LL | Click | Coming Soon | Coming Soon | Code | Code | Code |
33. | Delete nodes which have a greater value on right side | Click | Coming Soon | Coming Soon | Code | Code | Code |
34. | Segregate even and odd nodes in a Linked List | Click | Coming Soon | Coming Soon | Code | Code | Code |
35. | Program for n’th node from the end of a Linked List | Click | Coming Soon | Coming Soon | Code | Code | Code |
36. | Find the first non-repeating character from a stream of characters | Click | Coming Soon | Coming Soon | Code | Code | Code |
Binary Trees-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1. | level order traversal | Click | Coming Soon | Coming Soon | Code | Code | Code |
2. | Reverse Level Order traversal | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Height of a tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Diameter of a tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Mirror of a tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Inorder Traversal of a tree both using recursion and Iteration | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Preorder Traversal of a tree both using recursion and Iteration | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | Postorder Traversal of a tree both using recursion and Iteration | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Left View of a tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | Right View of Tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | Top View of a tree
|
Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | Bottom View of a tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Zig-Zag traversal of a binary tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | Check if a tree is balanced or not | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Diagnol Traversal of a Binary tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Boundary traversal of a Binary tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Construct Binary Tree from String with Bracket Representation | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | Convert Binary tree into Doubly Linked List | Click | Coming Soon | Coming Soon | Code | Code | Code |
19. | Convert Binary tree into Sum tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
20. | Construct Binary tree from Inorder and preorder traversal | Click | Coming Soon | Coming Soon | Code | Code | Code |
21. | Find minimum swaps required to convert a Binary tree into BST | Click | Coming Soon | Coming Soon | Code | Code | Code |
22. | Check if Binary tree is Sum tree or not | Click | Coming Soon | Coming Soon | Code | Code | Code |
23. | Check if all leaf nodes are at same level or not | Click | Coming Soon | Coming Soon | Code | Code | Code |
24. | Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
25. | Check if 2 trees are mirror or not | Click | Coming Soon | Coming Soon | Code | Code | Code |
26. | Sum of Nodes on the Longest path from root to leaf node | Click | Coming Soon | Coming Soon | Code | Code | Code |
27. | Check if given graph is tree or not. [ IMP ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
28. | Find Largest subtree sum in a tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
29. | Maximum Sum of nodes in Binary tree such that no two are adjacent | Click | Coming Soon | Coming Soon | Code | Code | Code |
30. | Print all “K” Sum paths in a Binary tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
31. | Find LCA in a Binary tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
32. | Find distance between 2 nodes in a Binary tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
33. | Kth Ancestor of node in a Binary tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
34. | Find all Duplicate subtrees in a Binary tree [ IMP ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
35. | Tree Isomorphism Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
Binary Search Tree-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1. | Find a value in a BST
|
Click | Coming Soon | Coming Soon | Code | Code | Code |
2. | Deletion of a node in a BST | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Find min and max value in a BST | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Find inorder successor and inorder predecessor in a BST | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Check if a tree is a BST or not | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Populate Inorder successor of all nodes | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Find LCA of 2 nodes in a BST | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | Construct BST from preorder traversal | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Convert Binary tree into BST | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | Convert a normal BST into a Balanced BST | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | Merge two BST [ V.V.V>IMP ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | Find Kth largest element in a BST | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Find Kth smallest element in a BST | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | Count pairs from 2 BST whose sum is equal to given value “X” | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Find the median of BST in O(n) time and O(1) space | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Count BST ndoes that lie in a given range | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Replace every element with the least greater element on its right | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | Given “n” appointments, find the conflicting appointments | Click | Coming Soon | Coming Soon | Code | Code | Code |
19. | Check preorder is valid or not | Click | Coming Soon | Coming Soon | Code | Code | Code |
20. | Check whether BST contains Dead end | Click | Coming Soon | Coming Soon | Code | Code | Code |
21. | Largest BST in a Binary Tree [ V.V.V.V.V IMP ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
22. | Flatten BST to sorted list | Click | Coming Soon | Coming Soon | Code | Code | Code |
Greedy-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1 | Activity Selection Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
2 | Job Sequencing Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Huffman Coding | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Water Connection Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Fractional Knapsack Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Greedy Algorithm to find Minimum number of Coins | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Maximum trains for which stoppage can be provided | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | Minimum Platforms Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Buy Maximum Stocks if i stocks can be bought on i-th day | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | Find the minimum and maximum amount to buy all N candies | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | Minimize Cash Flow among a given set of friends who have borrowed money from each other | Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | Minimum Cost to cut a board into squares | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Check if it is possible to survive on Island | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | Find maximum meetings in one room | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Maximum product subset of an array | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Maximize array sum after K negations | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Maximize the sum of arr[i]*i | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | Maximum sum of absolute difference of an array | Click | Coming Soon | Coming Soon | Code | Code | Code |
19. | Maximize sum of consecutive differences in a circular array | Click | Coming Soon | Coming Soon | Code | Code | Code |
20. | Minimum sum of absolute difference of pairs of two arrays | Click | Coming Soon | Coming Soon | Code | Code | Code |
21. | Program for Shortest Job First (or SJF) CPU Scheduling | Click | Coming Soon | Coming Soon | Code | Code | Code |
22. | Program for Least Recently Used (LRU) Page Replacement algorithm | Click | Coming Soon | Coming Soon | Code | Code | Code |
23. | Smallest subset with sum greater than all other elements | Click | Coming Soon | Coming Soon | Code | Code | Code |
24. | Chocolate Distribution Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
25. | DEFKIN -Defense of a Kingdom | Click | Coming Soon | Coming Soon | Code | Code | Code |
26. | DIEHARD -DIE HARD | Click | Coming Soon | Coming Soon | Code | Code | Code |
27. | GERGOVIA -Wine trading in Gergovia | Click | Coming Soon | Coming Soon | Code | Code | Code |
28. | Picking Up Chicks | Click | Coming Soon | Coming Soon | Code | Code | Code |
29. | CHOCOLA –Chocolate | Click | Coming Soon | Coming Soon | Code | Code | Code |
30. | ARRANGE -Arranging Amplifiers | Click | Coming Soon | Coming Soon | Code | Code | Code |
31. | K Centers Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
32. | K Centers Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
33. | Minimum Cost of ropes | Click | Coming Soon | Coming Soon | Code | Code | Code |
34. | Find smallest number with given number of digits and sum of digits | Click | Coming Soon | Coming Soon | Code | Code | Code |
35. | Rearrange characters in a string such that no two adjacent are same | Click | Coming Soon | Coming Soon | Code | Code | Code |
36. | Find maximum sum possible equal sum of three stacks | Click | Coming Soon | Coming Soon | Code | Code | Code |
BackTracking-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1 |
Rat in a maze Problem |
Click | Coming Soon | Coming Soon | Code | Code | Code |
2 | Printing all solutions in N-Queen Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Word Break Problem using Backtracking | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Remove Invalid Parentheses | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Sudoku Solver | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | m Coloring Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Print all palindromic partitions of a string | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | Subset Sum Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | The Knight’s tour problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | Tug of War | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | Find shortest safe route in a path with landmines | Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | Combinational Sum | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Find Maximum number possible by doing at-most K swaps | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | Print all permutations of a string | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Find if there is a path of more than k length from a source | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Longest Possible Route in a Matrix with Hurdles | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Print all possible paths from top left to bottom right of a mXn matrix | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | Partition of a set intoK subsets with equal sum | Click | Coming Soon | Coming Soon | Code | Code | Code |
19. | Find the K-th Permutation Sequence of first N natural numbers | Click | Coming Soon | Coming Soon | Code | Code | Code |
Stacks & Queues-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1. | Implement Stack from Scratch | Click | Coming Soon | Coming Soon | Code | Code | Code |
2. | Implement Queue from Scratch | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Implement 2 stack in an array | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | find the middle element of a stack | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Implement “N” stacks in an Array | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Check the expression has valid or Balanced parenthesis or not. | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Reverse a String using Stack | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | Design a Stack that supports getMin() in O(1) time and O(1) extra space. | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Find the next Greater element | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | The celebrity Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | Arithmetic Expression evaluation | Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | Evaluation of Postfix expression | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Implement a method to insert an element at its bottom without using any other data structure. | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | Reverse a stack using recursion | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Sort a Stack using recursion | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Merge Overlapping Intervals | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Largest rectangular Area in Histogram | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | Length of the Longest Valid Substring | Click | Coming Soon | Coming Soon | Code | Code | Code |
19. | Expression contains redundant bracket or not | Click | Coming Soon | Coming Soon | Code | Code | Code |
20. | Implement Stack using Queue | Click | Coming Soon | Coming Soon | Code | Code | Code |
21. | Implement Stack using Deque | Click | Coming Soon | Coming Soon | Code | Code | Code |
22. | Stack Permutations (Check if an array is stack permutation of other) | Click | Coming Soon | Coming Soon | Code | Code | Code |
23. | Implement Queue using Stack | Click | Coming Soon | Coming Soon | Code | Code | Code |
24. | Implement “n” queue in an array | Click | Coming Soon | Coming Soon | Code | Code | Code |
25. | Implement a Circular queue | Click | Coming Soon | Coming Soon | Code | Code | Code |
26. | LRU Cache Implementationa | Click | Coming Soon | Coming Soon | Code | Code | Code |
27. | Reverse a Queue using recursion | Click | Coming Soon | Coming Soon | Code | Code | Code |
28. | Reverse the first “K” elements of a queue | Click | Coming Soon | Coming Soon | Code | Code | Code |
29. | Interleave the first half of the queue with second half | Click | Coming Soon | Coming Soon | Code | Code | Code |
30. | Find the first circular tour that visits all Petrol Pumps | Click | Coming Soon | Coming Soon | Code | Code | Code |
31. | Minimum time required to rot all oranges | Click | Coming Soon | Coming Soon | Code | Code | Code |
32. | Distance of nearest cell having 1 in a binary matrix | Click | Coming Soon | Coming Soon | Code | Code | Code |
33. | First negative integer in every window of size “k” | Click | Coming Soon | Coming Soon | Code | Code | Code |
34. | Check if all levels of two trees are anagrams or not. | Click | Coming Soon | Coming Soon | Code | Code | Code |
35. | Sum of minimum and maximum elements of all subarrays of size “k”. | Click | Coming Soon | Coming Soon | Code | Code | Code |
36. | Minimum sum of squares of character counts in a given string after removing “k” characters. | Click | Coming Soon | Coming Soon | Code | Code | Code |
37. | Queue based approach or first non-repeating character in a stream. | Click | Coming Soon | Coming Soon | Code | Code | Code |
38. | Next Smaller Element | Click | Coming Soon | Coming Soon | Code | Code | Code |
Heap-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1. | Implement a Maxheap/MinHeap using arrays and recursion. | Click | Coming Soon | Coming Soon | Code | Code | Code |
2. | Sort an Array using heap. (HeapSort) | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Maximum of all subarrays of size k. | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | “k” largest element in an array | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Kth smallest and largest element in an unsorted array | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Merge “K” sorted arrays. [ IMP ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Merge 2 Binary Max Heaps | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | Kth largest sum continuous subarrays | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Leetcode- reorganize strings | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | Merge “K” Sorted Linked Lists [V.IMP] | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | Smallest range in “K” Lists | Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | Median in a stream of Integers | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Check if a Binary Tree is Heap | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | Connect “n” ropes with minimum cost | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Convert BST to Min Heap | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Convert min heap to max heap | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Rearrange characters in a string such that no two adjacent are same. | Click | Coming Soon | Coming Soon | Code | Code | Code |
18.
|
Minimum sum of two numbers formed from digits of an array | Click | Coming Soon | Coming Soon | Code | Code | Code |
Graph-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1. | Create a Graph, print it | Click | Coming Soon | Coming Soon | Code | Code | Code |
2. | Implement BFS algorithm | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Implement DFS Algo | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Detect Cycle in Directed Graph using BFS/DFS Algo | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Detect Cycle in UnDirected Graph using BFS/DFS Algo | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Search in a Maze | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Minimum Step by Knight | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | flood fill algo | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Clone a graph | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | Making wired Connections | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | word Ladder | Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | Dijkstra algo | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Implement Topological Sort | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | Minimum time taken by each job to be completed given by a Directed Acyclic Graph | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Find whether it is possible to finish all tasks or not from given dependencies | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Find the no. of Isalnds | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Given a sorted Dictionary of an Alien Language, find order of characters | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | Implement Kruksal’sAlgorithm | Click | Coming Soon | Coming Soon | Code | Code | Code |
19. | Implement Prim’s Algorithm | Click | Coming Soon | Coming Soon | Code | Code | Code |
20. | Total no. of Spanning tree in a graph | Click | Coming Soon | Coming Soon | Code | Code | Code |
21. | Implement Bellman Ford Algorithm | Click | Coming Soon | Coming Soon | Code | Code | Code |
22. | Implement Floyd warshall Algorithm | Click | Coming Soon | Coming Soon | Code | Code | Code |
23. | Travelling Salesman Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
24. | Graph Colouring Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
25. | Snake and Ladders Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
26. | Find bridge in a graph | Click | Coming Soon | Coming Soon | Code | Code | Code |
27. | Count Strongly connected Components(Kosaraju Algo) | Click | Coming Soon | Coming Soon | Code | Code | Code |
28. | Check whether a graph is Bipartite or Not | Click | Coming Soon | Coming Soon | Code | Code | Code |
29. | Detect Negative cycle in a graph | Click | Coming Soon | Coming Soon | Code | Code | Code |
30. | Longest path in a Directed Acyclic Graph | Click | Coming Soon | Coming Soon | Code | Code | Code |
31. | Journey to the Moon | Click | Coming Soon | Coming Soon | Code | Code | Code |
32. | Cheapest Flights Within K Stops | Click | Coming Soon | Coming Soon | Code | Code | Code |
33. | Oliver and the Game | Click | Coming Soon | Coming Soon | Code | Code | Code |
34. | Water Jug problem using BFS | Click | Coming Soon | Coming Soon | Code | Code | Code |
35. | Water Jug problem using BFS | Click | Coming Soon | Coming Soon | Code | Code | Code |
36. | Find if there is a path of more thank length from a source | Click | Coming Soon | Coming Soon | Code | Code | Code |
37. | M-ColouringProblem | Click | Coming Soon | Coming Soon | Code | Code | Code |
38. | Minimum edges to reverse o make path from source to destination | Click | Coming Soon | Coming Soon | Code | Code | Code |
39. | Paths to travel each nodes using each edge(Seven Bridges) | Click | Coming Soon | Coming Soon | Code | Code | Code |
40. | Vertex Cover Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
41. | Chinese Postman or Route Inspection | Click | Coming Soon | Coming Soon | Code | Code | Code |
42. | Number of Triangles in a Directed and Undirected Graph | Click | Coming Soon | Coming Soon | Code | Code | Code |
43. | Minimise the cashflow among a given set of friends who have borrowed money from each other | Click | Coming Soon | Coming Soon | Code | Code | Code |
44. | Two Clique Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
Trie-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1 | Construct a trie from scratch | Click | Coming Soon | Coming Soon | Code | Code | Code |
2 | Find shortest unique prefix for every word in a given list | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Word Break Problem | (Trie solution) | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Given a sequence of words, print all anagrams together | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Implement a Phone Directory | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Print unique rows in a given boolean matrix | Click | Coming Soon | Coming Soon | Code | Code | Code |
Dynamic Programming-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code | Python Code |
---|---|---|---|---|---|---|---|
1. |
Coin ChangeProblem |
Click | Coming Soon | Coming Soon | Code | Code | Code |
2. | Knapsack Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
3. | Binomial CoefficientProblem | Click | Coming Soon | Coming Soon | Code | Code | Code |
4. | Permutation CoefficientProblem | Click | Coming Soon | Coming Soon | Code | Code | Code |
5. | Program for nth Catalan Number | Click | Coming Soon | Coming Soon | Code | Code | Code |
6. | Matrix Chain Multiplication | Click | Coming Soon | Coming Soon | Code | Code | Code |
7. | Edit Distance | Click | Coming Soon | Coming Soon | Code | Code | Code |
8. | Subset Sum Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
9. | Friends Pairing Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
10. | Gold Mine Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
11. | Assembly Line SchedulingProblem | Click | Coming Soon | Coming Soon | Code | Code | Code |
12. | Painting the Fenceproblem | Click | Coming Soon | Coming Soon | Code | Code | Code |
13. | Maximize The Cut Segments | Click | Coming Soon | Coming Soon | Code | Code | Code |
14. | Longest Common Subsequence | Click | Coming Soon | Coming Soon | Code | Code | Code |
15. | Longest Repeated Subsequence | Click | Coming Soon | Coming Soon | Code | Code | Code |
16. | Longest Increasing Subsequence | Click | Coming Soon | Coming Soon | Code | Code | Code |
17. | Space Optimized Solution of LCS | Click | Coming Soon | Coming Soon | Code | Code | Code |
18. | LCS (Longest Common Subsequence) of three strings | Click | Coming Soon | Coming Soon | Code | Code | Code |
19. | Maximum Sum Increasing Subsequence | Click | Coming Soon | Coming Soon | Code | Code | Code |
20. | Count all subsequences having product less than K | Click | Coming Soon | Coming Soon | Code | Code | Code |
21. | Longest subsequence such that difference between adjacent is one | Click | Coming Soon | Coming Soon | Code | Code | Code |
22. | Maximum subsequence sum such that no three are consecutive | Click | Coming Soon | Coming Soon | Code | Code | Code |
23. | Egg Dropping Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
24. | Maximum Length Chain of Pairs | Click | Coming Soon | Coming Soon | Code | Code | Code |
25. | Maximum size square sub-matrix with all 1s | Click | Coming Soon | Coming Soon | Code | Code | Code |
26. | Maximum sum of pairs with specific difference | Click | Coming Soon | Coming Soon | Code | Code | Code |
27. | Min Cost PathProblem | Click | Coming Soon | Coming Soon | Code | Code | Code |
28. | Maximum difference of zeros and ones in binary string | Click | Coming Soon | Coming Soon | Code | Code | Code |
29. | Minimum number of jumps to reach end | Click | Coming Soon | Coming Soon | Code | Code | Code |
30. | Minimum cost to fill given weight in a bag | Click | Coming Soon | Coming Soon | Code | Code | Code |
31. | Minimum removals from array to make max –min <= K | Click | Coming Soon | Coming Soon | Code | Code | Code |
32. | Longest Common Substring | Click | Coming Soon | Coming Soon | Code | Code | Code |
33. | Count number of ways to reacha given score in a game | Click | Coming Soon | Coming Soon | Code | Code | Code |
34. | Count Balanced Binary Trees of Height h | Click | Coming Soon | Coming Soon | Code | Code | Code |
35. | LargestSum Contiguous Subarray [V>V>V>V IMP ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
36. | Smallest sum contiguous subarray | Click | Coming Soon | Coming Soon | Code | Code | Code |
37. | Unbounded Knapsack (Repetition of items allowed) | Click | Coming Soon | Coming Soon | Code | Code | Code |
38. | Word Break Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
39. | Largest Independent Set Problem | Click | Coming Soon | Coming Soon | Code | Code | Code4 |
40. | Partition problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
41. | Longest Palindromic Subsequence | Click | Coming Soon | Coming Soon | Code | Code | Code |
42. | Count All Palindromic Subsequence in a given String | Click | Coming Soon | Coming Soon | Code | Code | Code |
43. | Longest Palindromic Substring | Click | Coming Soon | Coming Soon | Code | Code | Code |
44. | Longest alternating subsequence | Click | Coming Soon | Coming Soon | Code | Code | Code |
45. | Weighted Job Scheduling | Click | Coming Soon | Coming Soon | Code | Code | Code |
46. | Coin game winner where every player has three choices | Click | Coming Soon | Coming Soon | Code | Code | Code |
47. | Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
48. | Maximum profit by buying and selling a share at most twice [ IMP ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
49. | Optimal Strategy for a Game | Click | Coming Soon | Coming Soon | Code | Code | Code |
50. | Optimal Binary Search Tree | Click | Coming Soon | Coming Soon | Code | Code | Code |
51. | Palindrome PartitioningProblem | Click | Coming Soon | Coming Soon | Code | Code | Code |
52. | Word Wrap Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
53. | Mobile Numeric Keypad Problem [ IMP ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
54. | Boolean Parenthesization Problem | Click | Coming Soon | Coming Soon | Code | Code | Code |
55. | Largest rectangular sub-matrix whose sum is 0 | Click | Coming Soon | Coming Soon | Code | Code | Code |
56. | Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ] | Click | Coming Soon | Coming Soon | Code | Code | Code |
57. | Maximum sum rectangle in a 2D matrix | Click | Coming Soon | Coming Soon | Code | Code | Code |
58. | Maximum profit by buying and selling a share at most k times | Click | Coming Soon | Coming Soon | Code | Code | Code |
59. | Find if a string is interleaved of two other strings | Click | Coming Soon | Coming Soon | Code | Code | Code |
60. | Maximum Length of Pair Chain | Click | Coming Soon | Coming Soon | Code | Code | Code |
Bit Manipulation-
Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
---|---|---|---|---|---|---|
1 | Count set bits in an integer | Click | Coming Soon | Coming Soon | Code | Code |
2 | Find the two non-repeating elements in an array of repeating elements | Click | Coming Soon | Coming Soon | Code | Code |
3. | Count number of bits to be flipped to convert A to B | Click | Coming Soon | Coming Soon | Code | Code |
4. | Count total set bits in all numbers from 1 to n | Click | Coming Soon | Coming Soon | Code | Code |
5. | Program to find whether a no is power of two | Click | Coming Soon | Coming Soon | Code | Code |
6. | Find position of the only set bit | Click | Coming Soon | Coming Soon | Code | Code |
7. | Copy set bits in a range | Click | Coming Soon | Coming Soon | Code | Code |
8. | Divide two integers without using multiplication, division and mod operator | Click | Coming Soon | Coming Soon | Code | Code |
9. | Calculate square of a number without using *, / and pow() | Click | Coming Soon | Coming Soon | Code | Code |
10. | Power Set | Click | Coming Soon | Coming Soon | Code | Code |
Striver SDE Sheet Video Solution