striver_sde_sheet_problems.json

[
  {
    "number": 1,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 2,
    "category": "Unknown",
    "title": "Reverse the array (",
    "title_slug": null,
    "raw_line": "1 Reverse the array (https://www.geeksforgeeks.org/write-a-program-to-reverse-"
  },
  {
    "number": 3,
    "category": "Unknown",
    "title": "Find the maximum and minimum element in an array",
    "title_slug": null,
    "raw_line": "2 Find the maximum and minimum element in an array"
  },
  {
    "number": 4,
    "category": "Unknown",
    "title": "Find the \"Kth\" max and min element of an array",
    "title_slug": null,
    "raw_line": "3 Find the \"Kth\" max and min element of an array"
  },
  {
    "number": 5,
    "category": "Unknown",
    "title": "Given an array which consists of only 0, 1 and 2. Sort the array without using any",
    "title_slug": null,
    "raw_line": "4 Given an array which consists of only 0, 1 and 2. Sort the array without using any"
  },
  {
    "number": 6,
    "category": "Unknown",
    "title": "s-and-2s/0)",
    "title_slug": null,
    "raw_line": "1s-and-2s/0)"
  },
  {
    "number": 7,
    "category": "Unknown",
    "title": "Move all the negative elements to one side of the array",
    "title_slug": null,
    "raw_line": "5 Move all the negative elements to one side of the array"
  },
  {
    "number": 8,
    "category": "Unknown",
    "title": "Find the Union and Intersection of the two sorted arrays.",
    "title_slug": null,
    "raw_line": "6 Find the Union and Intersection of the two sorted arrays."
  },
  {
    "number": 9,
    "category": "Unknown",
    "title": "Write a program to cyclically rotate an array by one.",
    "title_slug": "count-and-say",
    "raw_line": "7 Write a program to cyclically rotate an array by one."
  },
  {
    "number": 10,
    "category": "Unknown",
    "title": "find Largest sum contiguous Subarray",
    "title_slug": "flood-fill",
    "raw_line": "8 find Largest sum contiguous Subarray [V. IMP]"
  },
  {
    "number": 11,
    "category": "Unknown",
    "title": "Minimise the maximum difference between heights",
    "title_slug": "reorganize-string",
    "raw_line": "9 Minimise the maximum difference between heights [V.IMP]"
  },
  {
    "number": 12,
    "category": "Unknown",
    "title": "Minimum no. of Jumps to reach end of an array",
    "title_slug": null,
    "raw_line": "10 Minimum no. of Jumps to reach end of an array"
  },
  {
    "number": 13,
    "category": "Unknown",
    "title": "find duplicate in an array of N+1 Integers (",
    "title_slug": "word-ladder",
    "raw_line": "11 find duplicate in an array of N+1 Integers (https://leetcode.com/problems/find-the-"
  },
  {
    "number": 14,
    "category": "Unknown",
    "title": "Merge 2 sorted arrays without using Extra space.",
    "title_slug": null,
    "raw_line": "12 Merge 2 sorted arrays without using Extra space."
  },
  {
    "number": 15,
    "category": "Unknown",
    "title": "Kadane's Algo",
    "title_slug": "merge-intervals",
    "raw_line": "13 Kadane's Algo [V.V.V.V.V IMP]"
  },
  {
    "number": 16,
    "category": "Unknown",
    "title": "Merge Intervals (",
    "title_slug": "merge-intervals",
    "raw_line": "14 Merge Intervals (https://leetcode.com/problems/merge-intervals/)"
  },
  {
    "number": 17,
    "category": "Unknown",
    "title": "Next Permutation (",
    "title_slug": "next-permutation",
    "raw_line": "15 Next Permutation (https://leetcode.com/problems/next-permutation/)"
  },
  {
    "number": 18,
    "category": "Unknown",
    "title": "Count Inversion (",
    "title_slug": null,
    "raw_line": "16 Count Inversion (https://practice.geeksforgeeks.org/problems/inversion-of-"
  },
  {
    "number": 19,
    "category": "Unknown",
    "title": "Best time to buy and Sell stock (",
    "title_slug": "best-time-to-buy-and-sell-stock",
    "raw_line": "17 Best time to buy and Sell stock (https://leetcode.com/problems/best-time-to-buy-"
  },
  {
    "number": 20,
    "category": "Unknown",
    "title": "find all pairs on integer array whose sum is equal to given number",
    "title_slug": null,
    "raw_line": "18 find all pairs on integer array whose sum is equal to given number"
  },
  {
    "number": 21,
    "category": "Unknown",
    "title": "find common elements In 3 sorted arrays",
    "title_slug": null,
    "raw_line": "19 find common elements In 3 sorted arrays"
  },
  {
    "number": 22,
    "category": "Unknown",
    "title": "Rearrange the array in alternating positive and negative items with O extra space",
    "title_slug": null,
    "raw_line": "20 Rearrange the array in alternating positive and negative items with O(1) extra space"
  },
  {
    "number": 23,
    "category": "Unknown",
    "title": "Find if there is any subarray with sum equal to 0",
    "title_slug": null,
    "raw_line": "21 Find if there is any subarray with sum equal to 0"
  },
  {
    "number": 24,
    "category": "Unknown",
    "title": "Find factorial of a large number",
    "title_slug": null,
    "raw_line": "22 Find factorial of a large number"
  },
  {
    "number": 25,
    "category": "Unknown",
    "title": "find maximum product subarray",
    "title_slug": null,
    "raw_line": "23 find maximum product subarray"
  },
  {
    "number": 26,
    "category": "Unknown",
    "title": "Find longest consecutive subsequence",
    "title_slug": null,
    "raw_line": "24 Find longest consecutive subsequence"
  },
  {
    "number": 27,
    "category": "Unknown",
    "title": "Given an array of size n and a number k, find all elements that appear more than \"",
    "title_slug": "majority-element-ii",
    "raw_line": "25 Given an array of size n and a number k, find all elements that appear more than \""
  },
  {
    "number": 28,
    "category": "Unknown",
    "title": "Maximum profit by buying and selling a share atmost twice",
    "title_slug": null,
    "raw_line": "26 Maximum profit by buying and selling a share atmost twice"
  },
  {
    "number": 29,
    "category": "Unknown",
    "title": "Find whether an array is a subset of another array ",
    "title_slug": "longest-common-prefix",
    "raw_line": "27 Find whether an array is a subset of another array "
  },
  {
    "number": 30,
    "category": "Unknown",
    "title": "Find the triplet that sum to a given value",
    "title_slug": null,
    "raw_line": "28 Find the triplet that sum to a given value"
  },
  {
    "number": 31,
    "category": "Unknown",
    "title": "Trapping Rain water problem",
    "title_slug": null,
    "raw_line": "29 Trapping Rain water problem"
  },
  {
    "number": 32,
    "category": "Unknown",
    "title": "Chocolate Distribution problem",
    "title_slug": null,
    "raw_line": "30 Chocolate Distribution problem"
  },
  {
    "number": 33,
    "category": "Unknown",
    "title": "Smallest Subarray with sum greater than a given value",
    "title_slug": null,
    "raw_line": "31 Smallest Subarray with sum greater than a given value"
  },
  {
    "number": 34,
    "category": "Unknown",
    "title": "Three way partitioning of an array around a given value",
    "title_slug": null,
    "raw_line": "32 Three way partitioning of an array around a given value"
  },
  {
    "number": 35,
    "category": "Unknown",
    "title": "Minimum swaps required bring elements less equal K together",
    "title_slug": null,
    "raw_line": "33 Minimum swaps required bring elements less equal K together"
  },
  {
    "number": 36,
    "category": "Unknown",
    "title": "Minimum no. of operations required to make an array palindrome",
    "title_slug": null,
    "raw_line": "34 Minimum no. of operations required to make an array palindrome"
  },
  {
    "number": 37,
    "category": "Unknown",
    "title": "Median of 2 sorted arrays of equal size",
    "title_slug": null,
    "raw_line": "35 Median of 2 sorted arrays of equal size"
  },
  {
    "number": 38,
    "category": "Unknown",
    "title": "Median of 2 sorted arrays of different size (",
    "title_slug": null,
    "raw_line": "36 Median of 2 sorted arrays of different size (https://www.geeksforgeeks.org/median-"
  },
  {
    "number": 39,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 40,
    "category": "Unknown",
    "title": "Rat in a maze Problem (",
    "title_slug": null,
    "raw_line": "1 Rat in a maze Problem (https://practice.geeksforgeeks.org/problems/rat-in-a-"
  },
  {
    "number": 41,
    "category": "Unknown",
    "title": "Printing all solutions in N-Queen Problem (",
    "title_slug": null,
    "raw_line": "2 Printing all solutions in N-Queen Problem (https://www.geeksforgeeks.org/printing-"
  },
  {
    "number": 42,
    "category": "Unknown",
    "title": "Word Break Problem using Backtracking",
    "title_slug": null,
    "raw_line": "3 Word Break Problem using Backtracking"
  },
  {
    "number": 43,
    "category": "Unknown",
    "title": "Remove Invalid Parentheses (",
    "title_slug": "remove-invalid-parentheses",
    "raw_line": "4 Remove Invalid Parentheses (https://leetcode.com/problems/remove-invalid-"
  },
  {
    "number": 44,
    "category": "Unknown",
    "title": "Sudoku Solver (",
    "title_slug": null,
    "raw_line": "5 Sudoku Solver (https://practice.geeksforgeeks.org/problems/solve-the-sudoku/0)"
  },
  {
    "number": 45,
    "category": "Unknown",
    "title": "m Coloring Problem (",
    "title_slug": null,
    "raw_line": "6 m Coloring Problem (https://practice.geeksforgeeks.org/problems/m-coloring-"
  },
  {
    "number": 46,
    "category": "Unknown",
    "title": "Print all palindromic partitions of a string (",
    "title_slug": "count-and-say",
    "raw_line": "7 Print all palindromic partitions of a string (https://www.geeksforgeeks.org/given-a-"
  },
  {
    "number": 47,
    "category": "Unknown",
    "title": "Subset Sum Problem (",
    "title_slug": "flood-fill",
    "raw_line": "8 Subset Sum Problem (https://practice.geeksforgeeks.org/problems/subset-sum-"
  },
  {
    "number": 48,
    "category": "Unknown",
    "title": "The Knight’s tour problem (",
    "title_slug": "reorganize-string",
    "raw_line": "9 The Knight’s tour problem (https://www.geeksforgeeks.org/the-knights-tour-"
  },
  {
    "number": 49,
    "category": "Unknown",
    "title": "Tug of War (",
    "title_slug": null,
    "raw_line": "10 Tug of War (https://www.geeksforgeeks.org/tug-of-war/)"
  },
  {
    "number": 50,
    "category": "Unknown",
    "title": "Find shortest safe route in a path with landmines",
    "title_slug": "word-ladder",
    "raw_line": "11 Find shortest safe route in a path with landmines"
  },
  {
    "number": 51,
    "category": "Unknown",
    "title": "Combinational Sum (",
    "title_slug": null,
    "raw_line": "12 Combinational Sum (https://practice.geeksforgeeks.org/problems/combination-"
  },
  {
    "number": 52,
    "category": "Unknown",
    "title": "Find Maximum number possible by doing at-most K swaps",
    "title_slug": null,
    "raw_line": "13 Find Maximum number possible by doing at-most K swaps"
  },
  {
    "number": 53,
    "category": "Unknown",
    "title": "Print all permutations of a string",
    "title_slug": "merge-intervals",
    "raw_line": "14 Print all permutations of a string"
  },
  {
    "number": 54,
    "category": "Unknown",
    "title": "Find if there is a path of more than k length from a source",
    "title_slug": null,
    "raw_line": "15 Find if there is a path of more than k length from a source"
  },
  {
    "number": 55,
    "category": "Unknown",
    "title": "Longest Possible Route in a Matrix with Hurdles",
    "title_slug": null,
    "raw_line": "16 Longest Possible Route in a Matrix with Hurdles"
  },
  {
    "number": 56,
    "category": "Unknown",
    "title": "Print all possible paths from top left to bottom right of a mXn matrix",
    "title_slug": null,
    "raw_line": "17 Print all possible paths from top left to bottom right of a mXn matrix"
  },
  {
    "number": 57,
    "category": "Unknown",
    "title": "Partition of a set intoK subsets with equal sum",
    "title_slug": null,
    "raw_line": "18 Partition of a set intoK subsets with equal sum"
  },
  {
    "number": 58,
    "category": "Unknown",
    "title": "Find the K-th Permutation Sequence of first N natural numbers",
    "title_slug": null,
    "raw_line": "19 Find the K-th Permutation Sequence of first N natural numbers"
  },
  {
    "number": 59,
    "category": "Unknown",
    "title": "Implement Stack from Scratch",
    "title_slug": null,
    "raw_line": "20 Implement Stack from Scratch"
  },
  {
    "number": 60,
    "category": "Unknown",
    "title": "Implement Queue from Scratch (",
    "title_slug": null,
    "raw_line": "21 Implement Queue from Scratch (https://www.geeksforgeeks.org/queue-set-"
  },
  {
    "number": 61,
    "category": "Unknown",
    "title": "introduction-and-array-implementation/)",
    "title_slug": null,
    "raw_line": "1introduction-and-array-implementation/)"
  },
  {
    "number": 62,
    "category": "Unknown",
    "title": "Implement 2 stack in an array",
    "title_slug": null,
    "raw_line": "22 Implement 2 stack in an array"
  },
  {
    "number": 63,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 64,
    "category": "Unknown",
    "title": "level order traversal (",
    "title_slug": null,
    "raw_line": "1 level order traversal (https://practice.geeksforgeeks.org/problems/level-order-"
  },
  {
    "number": 65,
    "category": "Unknown",
    "title": "Reverse Level Order traversal",
    "title_slug": null,
    "raw_line": "2 Reverse Level Order traversal"
  },
  {
    "number": 66,
    "category": "Unknown",
    "title": "Height of a tree (",
    "title_slug": null,
    "raw_line": "3 Height of a tree (https://practice.geeksforgeeks.org/problems/height-of-binary-"
  },
  {
    "number": 67,
    "category": "Unknown",
    "title": "Diameter of a tree (",
    "title_slug": null,
    "raw_line": "4 Diameter of a tree (https://practice.geeksforgeeks.org/problems/diameter-of-"
  },
  {
    "number": 68,
    "category": "Unknown",
    "title": "Mirror of a tree (",
    "title_slug": null,
    "raw_line": "5 Mirror of a tree (https://www.geeksforgeeks.org/create-a-mirror-tree-from-the-"
  },
  {
    "number": 69,
    "category": "Unknown",
    "title": "Inorder Traversal of a tree both using recursion and Iteration",
    "title_slug": null,
    "raw_line": "6 Inorder Traversal of a tree both using recursion and Iteration"
  },
  {
    "number": 70,
    "category": "Unknown",
    "title": "Preorder Traversal of a tree both using recursion and Iteration",
    "title_slug": "count-and-say",
    "raw_line": "7 Preorder Traversal of a tree both using recursion and Iteration"
  },
  {
    "number": 71,
    "category": "Unknown",
    "title": "Postorder Traversal of a tree both using recursion and Iteration",
    "title_slug": "flood-fill",
    "raw_line": "8 Postorder Traversal of a tree both using recursion and Iteration"
  },
  {
    "number": 72,
    "category": "Unknown",
    "title": "Left View of a tree (",
    "title_slug": "reorganize-string",
    "raw_line": "9 Left View of a tree (https://practice.geeksforgeeks.org/problems/left-view-of-"
  },
  {
    "number": 73,
    "category": "Unknown",
    "title": "Right View of Tree (",
    "title_slug": null,
    "raw_line": "10 Right View of Tree (https://practice.geeksforgeeks.org/problems/right-view-of-"
  },
  {
    "number": 74,
    "category": "Unknown",
    "title": "Top View of a tree (",
    "title_slug": "word-ladder",
    "raw_line": "11 Top View of a tree (https://practice.geeksforgeeks.org/problems/top-view-of-"
  },
  {
    "number": 75,
    "category": "Unknown",
    "title": "Bottom View of a tree (",
    "title_slug": null,
    "raw_line": "12 Bottom View of a tree (https://practice.geeksforgeeks.org/problems/bottom-view-"
  },
  {
    "number": 76,
    "category": "Unknown",
    "title": "Zig-Zag traversal of a binary tree",
    "title_slug": null,
    "raw_line": "13 Zig-Zag traversal of a binary tree"
  },
  {
    "number": 77,
    "category": "Unknown",
    "title": "Check if a tree is balanced or not",
    "title_slug": "merge-intervals",
    "raw_line": "14 Check if a tree is balanced or not"
  },
  {
    "number": 78,
    "category": "Unknown",
    "title": "Diagnol Traversal of a Binary tree (",
    "title_slug": null,
    "raw_line": "15 Diagnol Traversal of a Binary tree (https://www.geeksforgeeks.org/diagonal-"
  },
  {
    "number": 79,
    "category": "Unknown",
    "title": "Boundary traversal of a Binary tree",
    "title_slug": null,
    "raw_line": "16 Boundary traversal of a Binary tree"
  },
  {
    "number": 80,
    "category": "Unknown",
    "title": "Construct Binary Tree from String with Bracket Representation",
    "title_slug": null,
    "raw_line": "17 Construct Binary Tree from String with Bracket Representation"
  },
  {
    "number": 81,
    "category": "Unknown",
    "title": "Convert Binary tree into Doubly Linked List",
    "title_slug": null,
    "raw_line": "18 Convert Binary tree into Doubly Linked List"
  },
  {
    "number": 82,
    "category": "Unknown",
    "title": "Convert Binary tree into Sum tree",
    "title_slug": null,
    "raw_line": "19 Convert Binary tree into Sum tree"
  },
  {
    "number": 83,
    "category": "Unknown",
    "title": "Construct Binary tree from Inorder and preorder traversal",
    "title_slug": null,
    "raw_line": "20 Construct Binary tree from Inorder and preorder traversal"
  },
  {
    "number": 84,
    "category": "Unknown",
    "title": "Find minimum swaps required to convert a Binary tree into BST",
    "title_slug": null,
    "raw_line": "21 Find minimum swaps required to convert a Binary tree into BST"
  },
  {
    "number": 85,
    "category": "Unknown",
    "title": "Check if Binary tree is Sum tree or not",
    "title_slug": null,
    "raw_line": "22 Check if Binary tree is Sum tree or not"
  },
  {
    "number": 86,
    "category": "Unknown",
    "title": "Check if all leaf nodes are at same level or not",
    "title_slug": null,
    "raw_line": "23 Check if all leaf nodes are at same level or not"
  },
  {
    "number": 87,
    "category": "Unknown",
    "title": "Check if a Binary Tree contains duplicate subtrees of size 2 or more",
    "title_slug": null,
    "raw_line": "24 Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ]"
  },
  {
    "number": 88,
    "category": "Unknown",
    "title": "Check if 2 trees are mirror or not",
    "title_slug": "majority-element-ii",
    "raw_line": "25 Check if 2 trees are mirror or not"
  },
  {
    "number": 89,
    "category": "Unknown",
    "title": "Sum of Nodes on the Longest path from root to leaf node",
    "title_slug": null,
    "raw_line": "26 Sum of Nodes on the Longest path from root to leaf node"
  },
  {
    "number": 90,
    "category": "Unknown",
    "title": "Check if given graph is tree or not.  (",
    "title_slug": "longest-common-prefix",
    "raw_line": "27 Check if given graph is tree or not. [ IMP ] (https://www.geeksforgeeks.org/check-"
  },
  {
    "number": 91,
    "category": "Unknown",
    "title": "Find Largest subtree sum in a tree (",
    "title_slug": null,
    "raw_line": "28 Find Largest subtree sum in a tree (https://www.geeksforgeeks.org/find-largest-"
  },
  {
    "number": 92,
    "category": "Unknown",
    "title": "Maximum Sum of nodes in Binary tree such that no two are adjacent",
    "title_slug": null,
    "raw_line": "29 Maximum Sum of nodes in Binary tree such that no two are adjacent"
  },
  {
    "number": 93,
    "category": "Unknown",
    "title": "Print all \"K\" Sum paths in a Binary tree (",
    "title_slug": null,
    "raw_line": "30 Print all \"K\" Sum paths in a Binary tree (https://www.geeksforgeeks.org/print-k-"
  },
  {
    "number": 94,
    "category": "Unknown",
    "title": "Find LCA in a Binary tree (",
    "title_slug": null,
    "raw_line": "31 Find LCA in a Binary tree (https://practice.geeksforgeeks.org/problems/lowest-"
  },
  {
    "number": 95,
    "category": "Unknown",
    "title": "Find distance between 2 nodes in a Binary tree",
    "title_slug": null,
    "raw_line": "32 Find distance between 2 nodes in a Binary tree"
  },
  {
    "number": 96,
    "category": "Unknown",
    "title": "Kth Ancestor of node in a Binary tree (",
    "title_slug": null,
    "raw_line": "33 Kth Ancestor of node in a Binary tree (https://www.geeksforgeeks.org/kth-"
  },
  {
    "number": 97,
    "category": "Unknown",
    "title": "Find all Duplicate subtrees in a Binary tree",
    "title_slug": null,
    "raw_line": "34 Find all Duplicate subtrees in a Binary tree [ IMP ]"
  },
  {
    "number": 98,
    "category": "Unknown",
    "title": "Tree Isomorphism Problem (",
    "title_slug": null,
    "raw_line": "35 Tree Isomorphism Problem (https://practice.geeksforgeeks.org/problems/check-"
  },
  {
    "number": 99,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 100,
    "category": "Unknown",
    "title": "Count set bits in an integer (",
    "title_slug": null,
    "raw_line": "1 Count set bits in an integer (https://practice.geeksforgeeks.org/problems/set-"
  },
  {
    "number": 101,
    "category": "Unknown",
    "title": "Find the two non-repeating elements in an array of repeating elements",
    "title_slug": null,
    "raw_line": "2 Find the two non-repeating elements in an array of repeating elements"
  },
  {
    "number": 102,
    "category": "Unknown",
    "title": "Count number of bits to be flipped to convert A to B",
    "title_slug": null,
    "raw_line": "3 Count number of bits to be flipped to convert A to B"
  },
  {
    "number": 103,
    "category": "Unknown",
    "title": "Count total set bits in all numbers from 1 to n",
    "title_slug": null,
    "raw_line": "4 Count total set bits in all numbers from 1 to n"
  },
  {
    "number": 104,
    "category": "Unknown",
    "title": "Program to find whether a no. is power of two",
    "title_slug": null,
    "raw_line": "5 Program to find whether a no. is power of two"
  },
  {
    "number": 105,
    "category": "Unknown",
    "title": "Find position of the only set bit (",
    "title_slug": null,
    "raw_line": "6 Find position of the only set bit (https://practice.geeksforgeeks.org/problems/find-"
  },
  {
    "number": 106,
    "category": "Unknown",
    "title": "Copy set bits in a range (",
    "title_slug": "count-and-say",
    "raw_line": "7 Copy set bits in a range (https://www.geeksforgeeks.org/copy-set-bits-in-a-"
  },
  {
    "number": 107,
    "category": "Unknown",
    "title": "Divide two integers without using multiplication, division and mod operator",
    "title_slug": "flood-fill",
    "raw_line": "8 Divide two integers without using multiplication, division and mod operator"
  },
  {
    "number": 108,
    "category": "Unknown",
    "title": "Calculate square of a number without using *, / and pow",
    "title_slug": "reorganize-string",
    "raw_line": "9 Calculate square of a number without using *, / and pow()"
  },
  {
    "number": 109,
    "category": "Unknown",
    "title": "Power Set (",
    "title_slug": null,
    "raw_line": "10 Power Set (https://practice.geeksforgeeks.org/problems/power-set4302/1)"
  },
  {
    "number": 110,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 111,
    "category": "Unknown",
    "title": "Find a value in a BST (",
    "title_slug": null,
    "raw_line": "1 Find a value in a BST (https://www.geeksforgeeks.org/binary-search-tree-set-1-"
  },
  {
    "number": 112,
    "category": "Unknown",
    "title": "Deletion of a node in a BST (",
    "title_slug": "delete-node-in-a-bst",
    "raw_line": "2 Deletion of a node in a BST (https://leetcode.com/problems/delete-node-in-a-"
  },
  {
    "number": 113,
    "category": "Unknown",
    "title": "Find min and max value in a BST",
    "title_slug": null,
    "raw_line": "3 Find min and max value in a BST"
  },
  {
    "number": 114,
    "category": "Unknown",
    "title": "Find inorder successor and inorder predecessor in a BST",
    "title_slug": null,
    "raw_line": "4 Find inorder successor and inorder predecessor in a BST"
  },
  {
    "number": 115,
    "category": "Unknown",
    "title": "Check if a tree is a BST or not (",
    "title_slug": null,
    "raw_line": "5 Check if a tree is a BST or not (https://practice.geeksforgeeks.org/problems/check-"
  },
  {
    "number": 116,
    "category": "Unknown",
    "title": "Populate Inorder successor of all nodes",
    "title_slug": null,
    "raw_line": "6 Populate Inorder successor of all nodes"
  },
  {
    "number": 117,
    "category": "Unknown",
    "title": "Find LCA of 2 nodes in a BST (",
    "title_slug": "count-and-say",
    "raw_line": "7 Find LCA of 2 nodes in a BST (https://practice.geeksforgeeks.org/problems/lowest-"
  },
  {
    "number": 118,
    "category": "Unknown",
    "title": "Construct BST from preorder traversal (",
    "title_slug": "flood-fill",
    "raw_line": "8 Construct BST from preorder traversal (https://www.geeksforgeeks.org/construct-"
  },
  {
    "number": 119,
    "category": "Unknown",
    "title": "Convert Binary tree into BST (",
    "title_slug": "reorganize-string",
    "raw_line": "9 Convert Binary tree into BST (https://practice.geeksforgeeks.org/problems/binary-"
  },
  {
    "number": 120,
    "category": "Unknown",
    "title": "Convert a normal BST into a Balanced BST",
    "title_slug": null,
    "raw_line": "10 Convert a normal BST into a Balanced BST"
  },
  {
    "number": 121,
    "category": "Unknown",
    "title": "Merge two BST  (",
    "title_slug": "word-ladder",
    "raw_line": "11 Merge two BST [ V.V.V>IMP ] (https://www.geeksforgeeks.org/merge-two-"
  },
  {
    "number": 122,
    "category": "Unknown",
    "title": "Find Kth largest element in a BST",
    "title_slug": null,
    "raw_line": "12 Find Kth largest element in a BST"
  },
  {
    "number": 123,
    "category": "Unknown",
    "title": "Find Kth smallest element in a BST",
    "title_slug": null,
    "raw_line": "13 Find Kth smallest element in a BST"
  },
  {
    "number": 124,
    "category": "Unknown",
    "title": "Count pairs from 2 BST whose sum is equal to given value \"X\"",
    "title_slug": "merge-intervals",
    "raw_line": "14 Count pairs from 2 BST whose sum is equal to given value \"X\""
  },
  {
    "number": 125,
    "category": "Unknown",
    "title": "Find the median of BST in O time and O space",
    "title_slug": null,
    "raw_line": "15 Find the median of BST in O(n) time and O(1) space"
  },
  {
    "number": 126,
    "category": "Unknown",
    "title": "Count BST ndoes that lie in a given range",
    "title_slug": null,
    "raw_line": "16 Count BST ndoes that lie in a given range"
  },
  {
    "number": 127,
    "category": "Unknown",
    "title": "Replace every element with the least greater element on its right",
    "title_slug": null,
    "raw_line": "17 Replace every element with the least greater element on its right"
  },
  {
    "number": 128,
    "category": "Unknown",
    "title": "Given \"n\" appointments, find the conflicting appointments",
    "title_slug": null,
    "raw_line": "18 Given \"n\" appointments, find the conflicting appointments"
  },
  {
    "number": 129,
    "category": "Unknown",
    "title": "Check preorder is valid or not",
    "title_slug": null,
    "raw_line": "19 Check preorder is valid or not"
  },
  {
    "number": 130,
    "category": "Unknown",
    "title": "Check whether BST contains Dead end",
    "title_slug": null,
    "raw_line": "20 Check whether BST contains Dead end"
  },
  {
    "number": 131,
    "category": "Unknown",
    "title": "Largest BST in a Binary Tree",
    "title_slug": null,
    "raw_line": "21 Largest BST in a Binary Tree [ V.V.V.V.V IMP ]"
  },
  {
    "number": 132,
    "category": "Unknown",
    "title": "Flatten BST to sorted list (",
    "title_slug": null,
    "raw_line": "22 Flatten BST to sorted list (https://www.geeksforgeeks.org/flatten-bst-to-sorted-"
  },
  {
    "number": 133,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 134,
    "category": "Unknown",
    "title": "Coin ChangeProblem (",
    "title_slug": null,
    "raw_line": "1 Coin ChangeProblem (https://practice.geeksforgeeks.org/problems/coin-"
  },
  {
    "number": 135,
    "category": "Unknown",
    "title": "Knapsack Problem (",
    "title_slug": null,
    "raw_line": "2 Knapsack Problem (https://practice.geeksforgeeks.org/problems/0-1-knapsack-"
  },
  {
    "number": 136,
    "category": "Unknown",
    "title": "Binomial CoefficientProblem",
    "title_slug": null,
    "raw_line": "3 Binomial CoefficientProblem"
  },
  {
    "number": 137,
    "category": "Unknown",
    "title": "Permutation CoefficientProblem (",
    "title_slug": null,
    "raw_line": "4 Permutation CoefficientProblem (https://www.geeksforgeeks.org/permutation-"
  },
  {
    "number": 138,
    "category": "Unknown",
    "title": "Program for nth Catalan Number (",
    "title_slug": null,
    "raw_line": "5 Program for nth Catalan Number (https://www.geeksforgeeks.org/program-nth-"
  },
  {
    "number": 139,
    "category": "Unknown",
    "title": "Matrix Chain Multiplication (",
    "title_slug": null,
    "raw_line": "6 Matrix Chain Multiplication (https://www.geeksforgeeks.org/matrix-chain-"
  },
  {
    "number": 140,
    "category": "Unknown",
    "title": "Edit Distance (",
    "title_slug": "count-and-say",
    "raw_line": "7 Edit Distance (https://practice.geeksforgeeks.org/problems/edit-distance3702/1)"
  },
  {
    "number": 141,
    "category": "Unknown",
    "title": "Subset Sum Problem (",
    "title_slug": "flood-fill",
    "raw_line": "8 Subset Sum Problem (https://practice.geeksforgeeks.org/problems/subset-sum-"
  },
  {
    "number": 142,
    "category": "Unknown",
    "title": "Friends Pairing Problem (",
    "title_slug": "reorganize-string",
    "raw_line": "9 Friends Pairing Problem (https://practice.geeksforgeeks.org/problems/friends-"
  },
  {
    "number": 143,
    "category": "Unknown",
    "title": "Gold Mine Problem (",
    "title_slug": null,
    "raw_line": "10 Gold Mine Problem (https://www.geeksforgeeks.org/gold-mine-problem/)"
  },
  {
    "number": 144,
    "category": "Unknown",
    "title": "Assembly Line SchedulingProblem (",
    "title_slug": "word-ladder",
    "raw_line": "11 Assembly Line SchedulingProblem (https://www.geeksforgeeks.org/assembly-line-"
  },
  {
    "number": 145,
    "category": "Unknown",
    "title": "Painting the Fenceproblem",
    "title_slug": null,
    "raw_line": "12 Painting the Fenceproblem"
  },
  {
    "number": 146,
    "category": "Unknown",
    "title": "Maximize The Cut Segments (",
    "title_slug": null,
    "raw_line": "13 Maximize The Cut Segments (https://practice.geeksforgeeks.org/problems/cutted-"
  },
  {
    "number": 147,
    "category": "Unknown",
    "title": "Longest Common Subsequence",
    "title_slug": "merge-intervals",
    "raw_line": "14 Longest Common Subsequence"
  },
  {
    "number": 148,
    "category": "Unknown",
    "title": "Longest Repeated Subsequence",
    "title_slug": null,
    "raw_line": "15 Longest Repeated Subsequence"
  },
  {
    "number": 149,
    "category": "Unknown",
    "title": "Longest Increasing Subsequence",
    "title_slug": null,
    "raw_line": "16 Longest Increasing Subsequence"
  },
  {
    "number": 150,
    "category": "Unknown",
    "title": "Space Optimized Solution of LCS (",
    "title_slug": null,
    "raw_line": "17 Space Optimized Solution of LCS (https://www.geeksforgeeks.org/space-"
  },
  {
    "number": 151,
    "category": "Unknown",
    "title": "LCS  of three strings",
    "title_slug": null,
    "raw_line": "18 LCS (Longest Common Subsequence) of three strings"
  },
  {
    "number": 152,
    "category": "Unknown",
    "title": "Maximum Sum Increasing Subsequence",
    "title_slug": null,
    "raw_line": "19 Maximum Sum Increasing Subsequence"
  },
  {
    "number": 153,
    "category": "Unknown",
    "title": "Count all subsequences having product less than K",
    "title_slug": null,
    "raw_line": "20 Count all subsequences having product less than K"
  },
  {
    "number": 154,
    "category": "Unknown",
    "title": "Longest subsequence such that difference between adjacent is one",
    "title_slug": null,
    "raw_line": "21 Longest subsequence such that difference between adjacent is one"
  },
  {
    "number": 155,
    "category": "Unknown",
    "title": "Maximum subsequence sum such that no three are consecutive",
    "title_slug": null,
    "raw_line": "22 Maximum subsequence sum such that no three are consecutive"
  },
  {
    "number": 156,
    "category": "Unknown",
    "title": "Egg Dropping Problem (",
    "title_slug": null,
    "raw_line": "23 Egg Dropping Problem (https://practice.geeksforgeeks.org/problems/egg-"
  },
  {
    "number": 157,
    "category": "Unknown",
    "title": "Maximum Length Chain of Pairs",
    "title_slug": null,
    "raw_line": "24 Maximum Length Chain of Pairs"
  },
  {
    "number": 158,
    "category": "Unknown",
    "title": "Maximum size square sub-matrix with all 1s",
    "title_slug": "majority-element-ii",
    "raw_line": "25 Maximum size square sub-matrix with all 1s"
  },
  {
    "number": 159,
    "category": "Unknown",
    "title": "Maximum sum of pairs with specific difference",
    "title_slug": null,
    "raw_line": "26 Maximum sum of pairs with specific difference"
  },
  {
    "number": 160,
    "category": "Unknown",
    "title": "Min Cost PathProblem (",
    "title_slug": "longest-common-prefix",
    "raw_line": "27 Min Cost PathProblem (https://practice.geeksforgeeks.org/problems/path-in-"
  },
  {
    "number": 161,
    "category": "Unknown",
    "title": "Maximum difference of zeros and ones in binary string",
    "title_slug": null,
    "raw_line": "28 Maximum difference of zeros and ones in binary string"
  },
  {
    "number": 162,
    "category": "Unknown",
    "title": "Minimum number of jumps to reach end",
    "title_slug": null,
    "raw_line": "29 Minimum number of jumps to reach end"
  },
  {
    "number": 163,
    "category": "Unknown",
    "title": "Minimum cost to fill given weight in a bag",
    "title_slug": null,
    "raw_line": "30 Minimum cost to fill given weight in a bag"
  },
  {
    "number": 164,
    "category": "Unknown",
    "title": "Minimum removals from array to make max –min <= K",
    "title_slug": null,
    "raw_line": "31 Minimum removals from array to make max –min <= K"
  },
  {
    "number": 165,
    "category": "Unknown",
    "title": "Longest Common Substring",
    "title_slug": null,
    "raw_line": "32 Longest Common Substring"
  },
  {
    "number": 166,
    "category": "Unknown",
    "title": "Count number of ways to reacha given score in a game",
    "title_slug": null,
    "raw_line": "33 Count number of ways to reacha given score in a game"
  },
  {
    "number": 167,
    "category": "Unknown",
    "title": "Count Balanced Binary Trees of Height h",
    "title_slug": null,
    "raw_line": "34 Count Balanced Binary Trees of Height h"
  },
  {
    "number": 168,
    "category": "Unknown",
    "title": "LargestSum Contiguous Subarray",
    "title_slug": null,
    "raw_line": "35 LargestSum Contiguous Subarray [V>V>V>V IMP ]"
  },
  {
    "number": 169,
    "category": "Unknown",
    "title": "Smallest sum contiguous subarray (",
    "title_slug": null,
    "raw_line": "36 Smallest sum contiguous subarray (https://www.geeksforgeeks.org/smallest-sum-"
  },
  {
    "number": 170,
    "category": "Unknown",
    "title": "Unbounded Knapsack",
    "title_slug": null,
    "raw_line": "37 Unbounded Knapsack (Repetition of items allowed)"
  },
  {
    "number": 171,
    "category": "Unknown",
    "title": "Word Break Problem (",
    "title_slug": null,
    "raw_line": "38 Word Break Problem (https://practice.geeksforgeeks.org/problems/word-break/0)"
  },
  {
    "number": 172,
    "category": "Unknown",
    "title": "Largest Independent Set Problem (",
    "title_slug": null,
    "raw_line": "39 Largest Independent Set Problem (https://www.geeksforgeeks.org/largest-"
  },
  {
    "number": 173,
    "category": "Unknown",
    "title": "Partition problem (",
    "title_slug": null,
    "raw_line": "40 Partition problem (https://practice.geeksforgeeks.org/problems/subset-sum-"
  },
  {
    "number": 174,
    "category": "Unknown",
    "title": "Longest Palindromic Subsequence (",
    "title_slug": null,
    "raw_line": "41 Longest Palindromic Subsequence (https://www.geeksforgeeks.org/longest-"
  },
  {
    "number": 175,
    "category": "Unknown",
    "title": "Count All Palindromic Subsequence in a given String",
    "title_slug": null,
    "raw_line": "42 Count All Palindromic Subsequence in a given String"
  },
  {
    "number": 176,
    "category": "Unknown",
    "title": "Longest Palindromic Substring (",
    "title_slug": "longest-palindromic-substring",
    "raw_line": "43 Longest Palindromic Substring (https://leetcode.com/problems/longest-"
  },
  {
    "number": 177,
    "category": "Unknown",
    "title": "Longest alternating subsequence",
    "title_slug": null,
    "raw_line": "44 Longest alternating subsequence"
  },
  {
    "number": 178,
    "category": "Unknown",
    "title": "Weighted Job Scheduling (",
    "title_slug": null,
    "raw_line": "45 Weighted Job Scheduling (https://www.geeksforgeeks.org/weighted-job-"
  },
  {
    "number": 179,
    "category": "Unknown",
    "title": "Coin game winner where every player has three choices",
    "title_slug": null,
    "raw_line": "46 Coin game winner where every player has three choices"
  },
  {
    "number": 180,
    "category": "Unknown",
    "title": "Count Derangements (Permutation such that no element appears in its original",
    "title_slug": null,
    "raw_line": "47 Count Derangements (Permutation such that no element appears in its original"
  },
  {
    "number": 181,
    "category": "Unknown",
    "title": "Maximum profit by buying and selling a share at most twice",
    "title_slug": null,
    "raw_line": "48 Maximum profit by buying and selling a share at most twice [ IMP ]"
  },
  {
    "number": 182,
    "category": "Unknown",
    "title": "Optimal Strategy for a Game",
    "title_slug": null,
    "raw_line": "49 Optimal Strategy for a Game"
  },
  {
    "number": 183,
    "category": "Unknown",
    "title": "Optimal Binary Search Tree (",
    "title_slug": null,
    "raw_line": "50 Optimal Binary Search Tree (https://www.geeksforgeeks.org/optimal-binary-"
  },
  {
    "number": 184,
    "category": "Unknown",
    "title": "Palindrome PartitioningProblem",
    "title_slug": null,
    "raw_line": "51 Palindrome PartitioningProblem"
  },
  {
    "number": 185,
    "category": "Unknown",
    "title": "Word Wrap Problem (",
    "title_slug": null,
    "raw_line": "52 Word Wrap Problem (https://practice.geeksforgeeks.org/problems/word-wrap/0)"
  },
  {
    "number": 186,
    "category": "Unknown",
    "title": "Mobile Numeric Keypad Problem",
    "title_slug": null,
    "raw_line": "53 Mobile Numeric Keypad Problem [ IMP ]"
  },
  {
    "number": 187,
    "category": "Unknown",
    "title": "Boolean Parenthesization Problem",
    "title_slug": null,
    "raw_line": "54 Boolean Parenthesization Problem"
  },
  {
    "number": 188,
    "category": "Unknown",
    "title": "Largest rectangular sub-matrix whose sum is 0",
    "title_slug": null,
    "raw_line": "55 Largest rectangular sub-matrix whose sum is 0"
  },
  {
    "number": 189,
    "category": "Unknown",
    "title": "Largest area rectangular sub-matrix with equal number of 1’s and 0’s",
    "title_slug": null,
    "raw_line": "56 Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ]"
  },
  {
    "number": 190,
    "category": "Unknown",
    "title": "Maximum sum rectangle in a 2D matrix",
    "title_slug": null,
    "raw_line": "57 Maximum sum rectangle in a 2D matrix"
  },
  {
    "number": 191,
    "category": "Unknown",
    "title": "Maximum profit by buying and selling a share at most k times",
    "title_slug": null,
    "raw_line": "58 Maximum profit by buying and selling a share at most k times"
  },
  {
    "number": 192,
    "category": "Unknown",
    "title": "Find if a string is interleaved of two other strings",
    "title_slug": "maximum-len",
    "raw_line": "59 Find if a string is interleaved of two other strings"
  },
  {
    "number": 193,
    "category": "Unknown",
    "title": "Maximum Length of Pair Chain (",
    "title_slug": "maximum-len",
    "raw_line": "60 Maximum Length of Pair Chain (https://leetcode.com/problems/maximum-length-"
  },
  {
    "number": 194,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 195,
    "category": "Unknown",
    "title": "Create a Graph, print it (",
    "title_slug": null,
    "raw_line": "1 Create a Graph, print it (https://1drv.ms/t/s!AqTOHFO77CqEiRua06v1PATyiFg5)"
  },
  {
    "number": 196,
    "category": "Unknown",
    "title": "Implement BFS algorithm (",
    "title_slug": null,
    "raw_line": "2 Implement BFS algorithm (https://practice.geeksforgeeks.org/problems/bfs-"
  },
  {
    "number": 197,
    "category": "Unknown",
    "title": "Implement DFS Algo (",
    "title_slug": null,
    "raw_line": "3 Implement DFS Algo (https://www.geeksforgeeks.org/depth-first-search-or-dfs-"
  },
  {
    "number": 198,
    "category": "Unknown",
    "title": "Detect Cycle in Directed Graph using BFS/DFS Algo",
    "title_slug": null,
    "raw_line": "4 Detect Cycle in Directed Graph using BFS/DFS Algo"
  },
  {
    "number": 199,
    "category": "Unknown",
    "title": "Detect Cycle in UnDirected Graph using BFS/DFS Algo",
    "title_slug": null,
    "raw_line": "5 Detect Cycle in UnDirected Graph using BFS/DFS Algo"
  },
  {
    "number": 200,
    "category": "Unknown",
    "title": "Search in a Maze (",
    "title_slug": null,
    "raw_line": "6 Search in a Maze (https://practice.geeksforgeeks.org/problems/rat-in-a-maze-"
  },
  {
    "number": 201,
    "category": "Unknown",
    "title": "Minimum Step by Knight (",
    "title_slug": "flood-fill",
    "raw_line": "7 Minimum Step by Knight (https://practice.geeksforgeeks.org/problems/steps-by-"
  },
  {
    "number": 202,
    "category": "Unknown",
    "title": "flood fill algo (",
    "title_slug": "flood-fill",
    "raw_line": "8 flood fill algo (https://leetcode.com/problems/flood-fill/)"
  },
  {
    "number": 203,
    "category": "Unknown",
    "title": "Clone a graph (",
    "title_slug": "clone-graph",
    "raw_line": "9 Clone a graph (https://leetcode.com/problems/clone-graph/)"
  },
  {
    "number": 204,
    "category": "Unknown",
    "title": "Making wired Connections (",
    "title_slug": "number-of-operations-to-make-network-connected",
    "raw_line": "10 Making wired Connections (https://leetcode.com/problems/number-of-"
  },
  {
    "number": 205,
    "category": "Unknown",
    "title": "word Ladder (",
    "title_slug": "word-ladder",
    "raw_line": "11 word Ladder (https://leetcode.com/problems/word-ladder/)"
  },
  {
    "number": 206,
    "category": "Unknown",
    "title": "Dijkstra algo (",
    "title_slug": null,
    "raw_line": "12 Dijkstra algo (https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-"
  },
  {
    "number": 207,
    "category": "Unknown",
    "title": "Implement Topological Sort",
    "title_slug": null,
    "raw_line": "13 Implement Topological Sort"
  },
  {
    "number": 208,
    "category": "Unknown",
    "title": "Minimum time taken by each job to be completed given by a Directed Acyclic Graph",
    "title_slug": "merge-intervals",
    "raw_line": "14 Minimum time taken by each job to be completed given by a Directed Acyclic Graph"
  },
  {
    "number": 209,
    "category": "Unknown",
    "title": "Find whether it is possible to finish all tasks or not from given dependencies",
    "title_slug": null,
    "raw_line": "15 Find whether it is possible to finish all tasks or not from given dependencies"
  },
  {
    "number": 210,
    "category": "Unknown",
    "title": "Find the no. of Isalnds (",
    "title_slug": null,
    "raw_line": "16 Find the no. of Isalnds (https://practice.geeksforgeeks.org/problems/find-the-"
  },
  {
    "number": 211,
    "category": "Unknown",
    "title": "Given a sorted Dictionary of an Alien Language, find order of characters",
    "title_slug": null,
    "raw_line": "17 Given a sorted Dictionary of an Alien Language, find order of characters"
  },
  {
    "number": 212,
    "category": "Unknown",
    "title": "Implement Kruksal’sAlgorithm (",
    "title_slug": null,
    "raw_line": "18 Implement Kruksal’sAlgorithm (https://www.geeksforgeeks.org/kruskals-"
  },
  {
    "number": 213,
    "category": "Unknown",
    "title": "Implement Prim’s Algorithm (",
    "title_slug": null,
    "raw_line": "19 Implement Prim’s Algorithm (https://www.geeksforgeeks.org/prims-minimum-"
  },
  {
    "number": 214,
    "category": "Unknown",
    "title": "Total no. of Spanning tree in a graph (",
    "title_slug": null,
    "raw_line": "20 Total no. of Spanning tree in a graph (https://www.geeksforgeeks.org/total-"
  },
  {
    "number": 215,
    "category": "Unknown",
    "title": "Implement Bellman Ford Algorithm",
    "title_slug": null,
    "raw_line": "21 Implement Bellman Ford Algorithm"
  },
  {
    "number": 216,
    "category": "Unknown",
    "title": "Implement Floyd warshallAlgorithm",
    "title_slug": null,
    "raw_line": "22 Implement Floyd warshallAlgorithm"
  },
  {
    "number": 217,
    "category": "Unknown",
    "title": "Travelling Salesman Problem (",
    "title_slug": null,
    "raw_line": "23 Travelling Salesman Problem (https://www.geeksforgeeks.org/travelling-"
  },
  {
    "number": 218,
    "category": "Unknown",
    "title": "Graph ColouringProblem (",
    "title_slug": null,
    "raw_line": "24 Graph ColouringProblem (https://www.geeksforgeeks.org/graph-coloring-"
  },
  {
    "number": 219,
    "category": "Unknown",
    "title": "Snake and Ladders Problem (",
    "title_slug": "snakes-and-ladders",
    "raw_line": "25 Snake and Ladders Problem (https://leetcode.com/problems/snakes-and-"
  },
  {
    "number": 220,
    "category": "Unknown",
    "title": "Find bridge in a graph (",
    "title_slug": null,
    "raw_line": "26 Find bridge in a graph (https://www.geeksforgeeks.org/bridge-in-a-graph/)"
  },
  {
    "number": 221,
    "category": "Unknown",
    "title": "Count Strongly connected Components",
    "title_slug": "longest-common-prefix",
    "raw_line": "27 Count Strongly connected Components(Kosaraju Algo)"
  },
  {
    "number": 222,
    "category": "Unknown",
    "title": "Check whether a graph is Bipartite or Not",
    "title_slug": null,
    "raw_line": "28 Check whether a graph is Bipartite or Not"
  },
  {
    "number": 223,
    "category": "Unknown",
    "title": "Detect Negative cycle in a graph (",
    "title_slug": null,
    "raw_line": "29 Detect Negative cycle in a graph (https://www.geeksforgeeks.org/detect-negative-"
  },
  {
    "number": 224,
    "category": "Unknown",
    "title": "Longest path in a Directed Acyclic Graph (",
    "title_slug": null,
    "raw_line": "30 Longest path in a Directed Acyclic Graph (https://www.geeksforgeeks.org/find-"
  },
  {
    "number": 225,
    "category": "Unknown",
    "title": "Journey to the Moon (",
    "title_slug": null,
    "raw_line": "31 Journey to the Moon (https://www.hackerrank.com/challenges/journey-to-the-"
  },
  {
    "number": 226,
    "category": "Unknown",
    "title": "Cheapest Flights Within K Stops (",
    "title_slug": "cheapest-flights-within-k-stops",
    "raw_line": "32 Cheapest Flights Within K Stops (https://leetcode.com/problems/cheapest-flights-"
  },
  {
    "number": 227,
    "category": "Unknown",
    "title": "Oliver and the Game",
    "title_slug": null,
    "raw_line": "33 Oliver and the Game"
  },
  {
    "number": 228,
    "category": "Unknown",
    "title": "Water Jug problem using BFS (",
    "title_slug": null,
    "raw_line": "34 Water Jug problem using BFS (https://www.geeksforgeeks.org/water-jug-problem-"
  },
  {
    "number": 229,
    "category": "Unknown",
    "title": "Water Jug problem using BFS (",
    "title_slug": null,
    "raw_line": "35 Water Jug problem using BFS (https://www.geeksforgeeks.org/water-jug-problem-"
  },
  {
    "number": 230,
    "category": "Unknown",
    "title": "Find if there is a path of more thank length from a source",
    "title_slug": null,
    "raw_line": "36 Find if there is a path of more thank length from a source"
  },
  {
    "number": 231,
    "category": "Unknown",
    "title": "M-ColouringProblem (",
    "title_slug": null,
    "raw_line": "37 M-ColouringProblem (https://practice.geeksforgeeks.org/problems/m-coloring-"
  },
  {
    "number": 232,
    "category": "Unknown",
    "title": "Minimum edges to reverse o make path from source to destination",
    "title_slug": null,
    "raw_line": "38 Minimum edges to reverse o make path from source to destination"
  },
  {
    "number": 233,
    "category": "Unknown",
    "title": "Paths to travel each nodes using each edge",
    "title_slug": null,
    "raw_line": "39 Paths to travel each nodes using each edge(Seven Bridges)"
  },
  {
    "number": 234,
    "category": "Unknown",
    "title": "Vertex Cover Problem (",
    "title_slug": null,
    "raw_line": "40 Vertex Cover Problem (https://www.geeksforgeeks.org/vertex-cover-problem-set-"
  },
  {
    "number": 235,
    "category": "Unknown",
    "title": "-introduction-approximate-algorithm-2/)",
    "title_slug": null,
    "raw_line": "1-introduction-approximate-algorithm-2/)"
  },
  {
    "number": 236,
    "category": "Unknown",
    "title": "Chinese Postman or Route Inspection (",
    "title_slug": null,
    "raw_line": "41 Chinese Postman or Route Inspection (https://www.geeksforgeeks.org/chinese-"
  },
  {
    "number": 237,
    "category": "Unknown",
    "title": "Number of Triangles in a Directed and Undirected Graph",
    "title_slug": null,
    "raw_line": "42 Number of Triangles in a Directed and Undirected Graph"
  },
  {
    "number": 238,
    "category": "Unknown",
    "title": "Minimise the cashflow among a given set of friends who have borrowed money from",
    "title_slug": null,
    "raw_line": "43 Minimise the cashflow among a given set of friends who have borrowed money from"
  },
  {
    "number": 239,
    "category": "Unknown",
    "title": "Two Clique Problem (",
    "title_slug": null,
    "raw_line": "44 Two Clique Problem (https://www.geeksforgeeks.org/two-clique-problem-check-"
  },
  {
    "number": 240,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 241,
    "category": "Unknown",
    "title": "Activity Selection Problem (",
    "title_slug": null,
    "raw_line": "1 Activity Selection Problem (https://practice.geeksforgeeks.org/problems/n-"
  },
  {
    "number": 242,
    "category": "Unknown",
    "title": "Job SequencingProblem (",
    "title_slug": null,
    "raw_line": "2 Job SequencingProblem (https://practice.geeksforgeeks.org/problems/job-"
  },
  {
    "number": 243,
    "category": "Unknown",
    "title": "Huffman Coding (",
    "title_slug": null,
    "raw_line": "3 Huffman Coding (https://practice.geeksforgeeks.org/problems/huffman-"
  },
  {
    "number": 244,
    "category": "Unknown",
    "title": "Water Connection Problem (",
    "title_slug": null,
    "raw_line": "4 Water Connection Problem (https://practice.geeksforgeeks.org/problems/water-"
  },
  {
    "number": 245,
    "category": "Unknown",
    "title": "Fractional Knapsack Problem",
    "title_slug": null,
    "raw_line": "5 Fractional Knapsack Problem"
  },
  {
    "number": 246,
    "category": "Unknown",
    "title": "Greedy Algorithm to find Minimum number of Coins",
    "title_slug": null,
    "raw_line": "6 Greedy Algorithm to find Minimum number of Coins"
  },
  {
    "number": 247,
    "category": "Unknown",
    "title": "Maximum trains for which stoppage can be provided",
    "title_slug": "count-and-say",
    "raw_line": "7 Maximum trains for which stoppage can be provided"
  },
  {
    "number": 248,
    "category": "Unknown",
    "title": "Minimum Platforms Problem",
    "title_slug": "flood-fill",
    "raw_line": "8 Minimum Platforms Problem"
  },
  {
    "number": 249,
    "category": "Unknown",
    "title": "Buy Maximum Stocks if i stocks can be bought on i-th day",
    "title_slug": "reorganize-string",
    "raw_line": "9 Buy Maximum Stocks if i stocks can be bought on i-th day"
  },
  {
    "number": 250,
    "category": "Unknown",
    "title": "Find the minimum and maximum amount to buy all N candies",
    "title_slug": null,
    "raw_line": "10 Find the minimum and maximum amount to buy all N candies"
  },
  {
    "number": 251,
    "category": "Unknown",
    "title": "Minimize Cash Flow among a given set of friends who have borrowed money from",
    "title_slug": "word-ladder",
    "raw_line": "11 Minimize Cash Flow among a given set of friends who have borrowed money from"
  },
  {
    "number": 252,
    "category": "Unknown",
    "title": "Minimum Cost to cut a board into squares",
    "title_slug": null,
    "raw_line": "12 Minimum Cost to cut a board into squares"
  },
  {
    "number": 253,
    "category": "Unknown",
    "title": "Check if it is possible to survive on Island",
    "title_slug": null,
    "raw_line": "13 Check if it is possible to survive on Island"
  },
  {
    "number": 254,
    "category": "Unknown",
    "title": "Find maximum meetings in one room (",
    "title_slug": "merge-intervals",
    "raw_line": "14 Find maximum meetings in one room (https://www.geeksforgeeks.org/find-"
  },
  {
    "number": 255,
    "category": "Unknown",
    "title": "Maximum product subset of an array (",
    "title_slug": null,
    "raw_line": "15 Maximum product subset of an array (https://www.geeksforgeeks.org/maximum-"
  },
  {
    "number": 256,
    "category": "Unknown",
    "title": "Maximize array sum after K negations",
    "title_slug": null,
    "raw_line": "16 Maximize array sum after K negations"
  },
  {
    "number": 257,
    "category": "Unknown",
    "title": "Maximize the sum of arr*i",
    "title_slug": null,
    "raw_line": "17 Maximize the sum of arr[i]*i"
  },
  {
    "number": 258,
    "category": "Unknown",
    "title": "Maximum sum of absolute difference of an array",
    "title_slug": null,
    "raw_line": "18 Maximum sum of absolute difference of an array"
  },
  {
    "number": 259,
    "category": "Unknown",
    "title": "Maximize sum of consecutive differences in a circular array",
    "title_slug": null,
    "raw_line": "19 Maximize sum of consecutive differences in a circular array"
  },
  {
    "number": 260,
    "category": "Unknown",
    "title": "Minimum sum of absolute difference of pairs of two arrays",
    "title_slug": null,
    "raw_line": "20 Minimum sum of absolute difference of pairs of two arrays"
  },
  {
    "number": 261,
    "category": "Unknown",
    "title": "Program for Shortest Job First  CPU Scheduling",
    "title_slug": null,
    "raw_line": "21 Program for Shortest Job First (or SJF) CPU Scheduling"
  },
  {
    "number": 262,
    "category": "Unknown",
    "title": "Program for Least Recently Used  Page Replacement algorithm",
    "title_slug": null,
    "raw_line": "22 Program for Least Recently Used (LRU) Page Replacement algorithm"
  },
  {
    "number": 263,
    "category": "Unknown",
    "title": "Smallest subset with sum greater than all other elements",
    "title_slug": null,
    "raw_line": "23 Smallest subset with sum greater than all other elements"
  },
  {
    "number": 264,
    "category": "Unknown",
    "title": "Chocolate Distribution Problem",
    "title_slug": null,
    "raw_line": "24 Chocolate Distribution Problem"
  },
  {
    "number": 265,
    "category": "Unknown",
    "title": "DEFKIN -Defense of a Kingdom (",
    "title_slug": "majority-element-ii",
    "raw_line": "25 DEFKIN -Defense of a Kingdom (https://www.spoj.com/problems/DEFKIN/)"
  },
  {
    "number": 266,
    "category": "Unknown",
    "title": "DIEHARD -DIE HARD (",
    "title_slug": null,
    "raw_line": "26 DIEHARD -DIE HARD (https://www.spoj.com/problems/DIEHARD/)"
  },
  {
    "number": 267,
    "category": "Unknown",
    "title": "GERGOVIA -Wine trading in Gergovia (",
    "title_slug": "longest-common-prefix",
    "raw_line": "27 GERGOVIA -Wine trading in Gergovia (https://www.spoj.com/problems/GERGOVIA/)"
  },
  {
    "number": 268,
    "category": "Unknown",
    "title": "Picking Up Chicks ( ",
    "title_slug": null,
    "raw_line": "28 Picking Up Chicks (https://www.spoj.com/problems/GCJ101BB/) "
  },
  {
    "number": 269,
    "category": "Unknown",
    "title": "CHOCOLA –Chocolate (",
    "title_slug": null,
    "raw_line": "29 CHOCOLA –Chocolate (https://www.spoj.com/problems/CHOCOLA/)"
  },
  {
    "number": 270,
    "category": "Unknown",
    "title": "ARRANGE -Arranging Amplifiers (",
    "title_slug": null,
    "raw_line": "30 ARRANGE -Arranging Amplifiers (https://www.spoj.com/problems/ARRANGE/)"
  },
  {
    "number": 271,
    "category": "Unknown",
    "title": "K Centers Problem (",
    "title_slug": null,
    "raw_line": "31 K Centers Problem (https://www.geeksforgeeks.org/k-centers-problem-set-1-"
  },
  {
    "number": 272,
    "category": "Unknown",
    "title": "Minimum Cost of ropes (",
    "title_slug": null,
    "raw_line": "32 Minimum Cost of ropes (https://practice.geeksforgeeks.org/problems/minimum-"
  },
  {
    "number": 273,
    "category": "Unknown",
    "title": "Find smallest number with given number of digits and sum of digits",
    "title_slug": null,
    "raw_line": "33 Find smallest number with given number of digits and sum of digits"
  },
  {
    "number": 274,
    "category": "Unknown",
    "title": "Rearrange characters in a string such that no two adjacent are same",
    "title_slug": null,
    "raw_line": "34 Rearrange characters in a string such that no two adjacent are same"
  },
  {
    "number": 275,
    "category": "Unknown",
    "title": "Find maximum sum possible equal sum of three stacks",
    "title_slug": null,
    "raw_line": "35 Find maximum sum possible equal sum of three stacks"
  },
  {
    "number": 276,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 277,
    "category": "Unknown",
    "title": "Implement a Maxheap/MinHeap using arrays and recursion.",
    "title_slug": null,
    "raw_line": "1 Implement a Maxheap/MinHeap using arrays and recursion."
  },
  {
    "number": 278,
    "category": "Unknown",
    "title": "Sort an Array using heap.  (",
    "title_slug": null,
    "raw_line": "2 Sort an Array using heap. (HeapSort) (https://www.geeksforgeeks.org/heap-sort/)"
  },
  {
    "number": 279,
    "category": "Unknown",
    "title": "Maximum of all subarrays of size k. (",
    "title_slug": null,
    "raw_line": "3 Maximum of all subarrays of size k. (https://www.geeksforgeeks.org/sliding-"
  },
  {
    "number": 280,
    "category": "Unknown",
    "title": "“k” largest element in an array (",
    "title_slug": null,
    "raw_line": "4 “k” largest element in an array (https://practice.geeksforgeeks.org/problems/k-"
  },
  {
    "number": 281,
    "category": "Unknown",
    "title": "Kth smallest and largest element in an unsorted array",
    "title_slug": null,
    "raw_line": "5 Kth smallest and largest element in an unsorted array"
  },
  {
    "number": 282,
    "category": "Unknown",
    "title": "Merge “K” sorted arrays.",
    "title_slug": null,
    "raw_line": "6 Merge “K” sorted arrays. [ IMP ]"
  },
  {
    "number": 283,
    "category": "Unknown",
    "title": "Merge 2 Binary Max Heaps (",
    "title_slug": "count-and-say",
    "raw_line": "7 Merge 2 Binary Max Heaps (https://practice.geeksforgeeks.org/problems/merge-"
  },
  {
    "number": 284,
    "category": "Unknown",
    "title": "Kth largest sum continuous subarrays (",
    "title_slug": "reorganize-string",
    "raw_line": "8 Kth largest sum continuous subarrays (https://www.geeksforgeeks.org/k-th-"
  },
  {
    "number": 285,
    "category": "Unknown",
    "title": "Leetcode- reorganize strings (",
    "title_slug": "reorganize-string",
    "raw_line": "9 Leetcode- reorganize strings (https://leetcode.com/problems/reorganize-string/)"
  },
  {
    "number": 286,
    "category": "Unknown",
    "title": "Merge “K” Sorted Linked Lists",
    "title_slug": null,
    "raw_line": "10 Merge “K” Sorted Linked Lists [V.IMP]"
  },
  {
    "number": 287,
    "category": "Unknown",
    "title": "Smallest range in “K” Lists (",
    "title_slug": "word-ladder",
    "raw_line": "11 Smallest range in “K” Lists (https://practice.geeksforgeeks.org/problems/find-"
  },
  {
    "number": 288,
    "category": "Unknown",
    "title": "Median in a stream of Integers (",
    "title_slug": null,
    "raw_line": "12 Median in a stream of Integers (https://practice.geeksforgeeks.org/problems/find-"
  },
  {
    "number": 289,
    "category": "Unknown",
    "title": "Check if a Binary Tree is Heap (",
    "title_slug": null,
    "raw_line": "13 Check if a Binary Tree is Heap (https://practice.geeksforgeeks.org/problems/is-"
  },
  {
    "number": 290,
    "category": "Unknown",
    "title": "Connect “n” ropes with minimum cost",
    "title_slug": "merge-intervals",
    "raw_line": "14 Connect “n” ropes with minimum cost"
  },
  {
    "number": 291,
    "category": "Unknown",
    "title": "Convert BST to Min Heap (",
    "title_slug": null,
    "raw_line": "15 Convert BST to Min Heap (https://www.geeksforgeeks.org/convert-bst-min-heap/)"
  },
  {
    "number": 292,
    "category": "Unknown",
    "title": "Convert min heap to max heap (",
    "title_slug": null,
    "raw_line": "16 Convert min heap to max heap (https://www.geeksforgeeks.org/convert-min-"
  },
  {
    "number": 293,
    "category": "Unknown",
    "title": "Rearrange characters in a string such that no two adjacent are same.",
    "title_slug": null,
    "raw_line": "17 Rearrange characters in a string such that no two adjacent are same."
  },
  {
    "number": 294,
    "category": "Unknown",
    "title": "Minimum sum of two numbers formed from digits of an array",
    "title_slug": null,
    "raw_line": "18 Minimum sum of two numbers formed from digits of an array"
  },
  {
    "number": 295,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 296,
    "category": "Unknown",
    "title": "Write a Program to reverse the Linked List.",
    "title_slug": null,
    "raw_line": "1 Write a Program to reverse the Linked List. (Both Iterative and recursive)"
  },
  {
    "number": 297,
    "category": "Unknown",
    "title": "Reverse a Linked List in group of Given Size.",
    "title_slug": null,
    "raw_line": "2 Reverse a Linked List in group of Given Size. [Very Imp]"
  },
  {
    "number": 298,
    "category": "Unknown",
    "title": "Write a program to Detect loop in a linked list.",
    "title_slug": null,
    "raw_line": "3 Write a program to Detect loop in a linked list."
  },
  {
    "number": 299,
    "category": "Unknown",
    "title": "Write a program to Delete loop in a linked list.",
    "title_slug": null,
    "raw_line": "4 Write a program to Delete loop in a linked list."
  },
  {
    "number": 300,
    "category": "Unknown",
    "title": "Find the starting point of the loop. (",
    "title_slug": null,
    "raw_line": "5 Find the starting point of the loop. (https://www.geeksforgeeks.org/find-first-node-"
  },
  {
    "number": 301,
    "category": "Unknown",
    "title": "Remove Duplicates in a sorted Linked List.",
    "title_slug": null,
    "raw_line": "6 Remove Duplicates in a sorted Linked List."
  },
  {
    "number": 302,
    "category": "Unknown",
    "title": "Remove Duplicates in a Un-sorted Linked List.",
    "title_slug": "count-and-say",
    "raw_line": "7 Remove Duplicates in a Un-sorted Linked List."
  },
  {
    "number": 303,
    "category": "Unknown",
    "title": "Write a Program to Move the last element to Front in a Linked List.",
    "title_slug": "flood-fill",
    "raw_line": "8 Write a Program to Move the last element to Front in a Linked List."
  },
  {
    "number": 304,
    "category": "Unknown",
    "title": "Add “1” to a number represented as a Linked List.",
    "title_slug": "reorganize-string",
    "raw_line": "9 Add “1” to a number represented as a Linked List."
  },
  {
    "number": 305,
    "category": "Unknown",
    "title": "Add two numbers represented by linked lists.",
    "title_slug": null,
    "raw_line": "10 Add two numbers represented by linked lists."
  },
  {
    "number": 306,
    "category": "Unknown",
    "title": "Intersection of two Sorted Linked List.",
    "title_slug": "word-ladder",
    "raw_line": "11 Intersection of two Sorted Linked List."
  },
  {
    "number": 307,
    "category": "Unknown",
    "title": "Intersection Point of two Linked Lists.",
    "title_slug": null,
    "raw_line": "12 Intersection Point of two Linked Lists."
  },
  {
    "number": 308,
    "category": "Unknown",
    "title": "Merge Sort For Linked lists.",
    "title_slug": null,
    "raw_line": "13 Merge Sort For Linked lists.[Very Important]"
  },
  {
    "number": 309,
    "category": "Unknown",
    "title": "Quicksort for Linked Lists.",
    "title_slug": "merge-intervals",
    "raw_line": "14 Quicksort for Linked Lists.[Very Important]"
  },
  {
    "number": 310,
    "category": "Unknown",
    "title": "Find the middle Element of a linked list. (",
    "title_slug": "middle-of-the-linked-list",
    "raw_line": "15 Find the middle Element of a linked list. (https://leetcode.com/problems/middle-of-"
  },
  {
    "number": 311,
    "category": "Unknown",
    "title": "Check if a linked list is a circular linked list.",
    "title_slug": null,
    "raw_line": "16 Check if a linked list is a circular linked list."
  },
  {
    "number": 312,
    "category": "Unknown",
    "title": "Split a Circular linked list into two halves.",
    "title_slug": null,
    "raw_line": "17 Split a Circular linked list into two halves."
  },
  {
    "number": 313,
    "category": "Unknown",
    "title": "Write a Program to check whether the Singly Linked list is a palindrome or not.",
    "title_slug": null,
    "raw_line": "18 Write a Program to check whether the Singly Linked list is a palindrome or not."
  },
  {
    "number": 314,
    "category": "Unknown",
    "title": "Deletion from a Circular Linked List. (",
    "title_slug": null,
    "raw_line": "19 Deletion from a Circular Linked List. (https://www.geeksforgeeks.org/deletion-"
  },
  {
    "number": 315,
    "category": "Unknown",
    "title": "Reverse a Doubly Linked list.",
    "title_slug": null,
    "raw_line": "20 Reverse a Doubly Linked list."
  },
  {
    "number": 316,
    "category": "Unknown",
    "title": "Find pairs with a given sum in a DLL. (",
    "title_slug": null,
    "raw_line": "21 Find pairs with a given sum in a DLL. (https://www.geeksforgeeks.org/find-pairs-"
  },
  {
    "number": 317,
    "category": "Unknown",
    "title": "Count triplets in a sorted DLL whose sum is equal to given value “X”.",
    "title_slug": null,
    "raw_line": "22 Count triplets in a sorted DLL whose sum is equal to given value “X”."
  },
  {
    "number": 318,
    "category": "Unknown",
    "title": "Sort a “k”sorted Doubly Linked list. (",
    "title_slug": null,
    "raw_line": "23 Sort a “k”sorted Doubly Linked list.[Very IMP] (https://www.geeksforgeeks.org/sort-"
  },
  {
    "number": 319,
    "category": "Unknown",
    "title": "Rotate DoublyLinked list by N nodes. (",
    "title_slug": null,
    "raw_line": "24 Rotate DoublyLinked list by N nodes. (https://www.geeksforgeeks.org/rotate-"
  },
  {
    "number": 320,
    "category": "Unknown",
    "title": "Rotate a Doubly Linked list in group of Given Size.",
    "title_slug": "majority-element-ii",
    "raw_line": "25 Rotate a Doubly Linked list in group of Given Size.[Very IMP]"
  },
  {
    "number": 321,
    "category": "Unknown",
    "title": "Can we reverse a linked list in less than O ?",
    "title_slug": null,
    "raw_line": "26 Can we reverse a linked list in less than O(n) ? (<->)"
  },
  {
    "number": 322,
    "category": "Unknown",
    "title": "Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ?",
    "title_slug": "longest-common-prefix",
    "raw_line": "27 Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ? (<->)"
  },
  {
    "number": 323,
    "category": "Unknown",
    "title": "Flatten a Linked List (",
    "title_slug": null,
    "raw_line": "28 Flatten a Linked List (https://practice.geeksforgeeks.org/problems/flattening-a-"
  },
  {
    "number": 324,
    "category": "Unknown",
    "title": "Sort a LL of 0's, 1's and 2's (",
    "title_slug": null,
    "raw_line": "29 Sort a LL of 0's, 1's and 2's (https://practice.geeksforgeeks.org/problems/given-a-"
  },
  {
    "number": 325,
    "category": "Unknown",
    "title": "Clone a linked list with next and random pointer",
    "title_slug": null,
    "raw_line": "30 Clone a linked list with next and random pointer"
  },
  {
    "number": 326,
    "category": "Unknown",
    "title": "Merge K sorted Linked list (",
    "title_slug": null,
    "raw_line": "31 Merge K sorted Linked list (https://practice.geeksforgeeks.org/problems/merge-k-"
  },
  {
    "number": 327,
    "category": "Unknown",
    "title": "Multiply 2 no. represented by LL",
    "title_slug": null,
    "raw_line": "32 Multiply 2 no. represented by LL"
  },
  {
    "number": 328,
    "category": "Unknown",
    "title": "Delete nodes which have a greater value on right side",
    "title_slug": null,
    "raw_line": "33 Delete nodes which have a greater value on right side"
  },
  {
    "number": 329,
    "category": "Unknown",
    "title": "Segregate even and odd nodes in a Linked List",
    "title_slug": null,
    "raw_line": "34 Segregate even and odd nodes in a Linked List"
  },
  {
    "number": 330,
    "category": "Unknown",
    "title": "Program for n’th node from the end of a Linked List",
    "title_slug": null,
    "raw_line": "35 Program for n’th node from the end of a Linked List"
  },
  {
    "number": 331,
    "category": "Unknown",
    "title": "Find the first non-repeating character from a stream of characters",
    "title_slug": null,
    "raw_line": "36 Find the first non-repeating character from a stream of characters"
  },
  {
    "number": 332,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 333,
    "category": "Unknown",
    "title": "Spiral traversal on a Matrix (",
    "title_slug": null,
    "raw_line": "1 Spiral traversal on a Matrix (https://practice.geeksforgeeks.org/problems/spirally-"
  },
  {
    "number": 334,
    "category": "Unknown",
    "title": "Search an element in a matrix (",
    "title_slug": "search-a-2d-matrix",
    "raw_line": "2 Search an element in a matrix (https://leetcode.com/problems/search-a-2d-"
  },
  {
    "number": 335,
    "category": "Unknown",
    "title": "Find median in a row wise sorted matrix",
    "title_slug": null,
    "raw_line": "3 Find median in a row wise sorted matrix"
  },
  {
    "number": 336,
    "category": "Unknown",
    "title": "Find row with maximum no. of 1's",
    "title_slug": null,
    "raw_line": "4 Find row with maximum no. of 1's"
  },
  {
    "number": 337,
    "category": "Unknown",
    "title": "Print elements in sorted order using row-column wise sorted matrix",
    "title_slug": null,
    "raw_line": "5 Print elements in sorted order using row-column wise sorted matrix"
  },
  {
    "number": 338,
    "category": "Unknown",
    "title": "Maximum size rectangle (",
    "title_slug": null,
    "raw_line": "6 Maximum size rectangle (https://practice.geeksforgeeks.org/problems/max-"
  },
  {
    "number": 339,
    "category": "Unknown",
    "title": "Find a specific pair in matrix (",
    "title_slug": "count-and-say",
    "raw_line": "7 Find a specific pair in matrix (https://www.geeksforgeeks.org/find-a-specific-pair-"
  },
  {
    "number": 340,
    "category": "Unknown",
    "title": "Rotate matrix by 90 degrees (",
    "title_slug": "flood-fill",
    "raw_line": "8 Rotate matrix by 90 degrees (https://www.geeksforgeeks.org/rotate-a-matrix-by-"
  },
  {
    "number": 341,
    "category": "Unknown",
    "title": "-degree-in-clockwise-direction-without-using-any-extra-space/)",
    "title_slug": null,
    "raw_line": "90-degree-in-clockwise-direction-without-using-any-extra-space/)"
  },
  {
    "number": 342,
    "category": "Unknown",
    "title": "Kth smallest element in a row-cpumn wise sorted matrix",
    "title_slug": "reorganize-string",
    "raw_line": "9 Kth smallest element in a row-cpumn wise sorted matrix"
  },
  {
    "number": 343,
    "category": "Unknown",
    "title": "Common elements in all rows of a given matrix",
    "title_slug": null,
    "raw_line": "10 Common elements in all rows of a given matrix"
  },
  {
    "number": 344,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 345,
    "category": "Unknown",
    "title": "Find first and last positions of an element in a sorted array",
    "title_slug": null,
    "raw_line": "1 Find first and last positions of an element in a sorted array"
  },
  {
    "number": 346,
    "category": "Unknown",
    "title": "Find a Fixed Point  in a given array",
    "title_slug": null,
    "raw_line": "2 Find a Fixed Point (Value equal to index) in a given array"
  },
  {
    "number": 347,
    "category": "Unknown",
    "title": "Search in a rotated sorted array (",
    "title_slug": "search-in-rotated-sorted-array",
    "raw_line": "3 Search in a rotated sorted array (https://leetcode.com/problems/search-in-"
  },
  {
    "number": 348,
    "category": "Unknown",
    "title": "square root of an integer (",
    "title_slug": null,
    "raw_line": "4 square root of an integer (https://practice.geeksforgeeks.org/problems/count-"
  },
  {
    "number": 349,
    "category": "Unknown",
    "title": "Maximum and minimum of an array using minimum number of comparisons",
    "title_slug": null,
    "raw_line": "5 Maximum and minimum of an array using minimum number of comparisons"
  },
  {
    "number": 350,
    "category": "Unknown",
    "title": "Optimum location of point to minimize total distance",
    "title_slug": null,
    "raw_line": "6 Optimum location of point to minimize total distance"
  },
  {
    "number": 351,
    "category": "Unknown",
    "title": "Find the repeating and the missing",
    "title_slug": "count-and-say",
    "raw_line": "7 Find the repeating and the missing"
  },
  {
    "number": 352,
    "category": "Unknown",
    "title": "find majority element (",
    "title_slug": "flood-fill",
    "raw_line": "8 find majority element (https://practice.geeksforgeeks.org/problems/majority-"
  },
  {
    "number": 353,
    "category": "Unknown",
    "title": "Searching in an array where adjacent differ by at most k",
    "title_slug": "reorganize-string",
    "raw_line": "9 Searching in an array where adjacent differ by at most k"
  },
  {
    "number": 354,
    "category": "Unknown",
    "title": "find a pair with a given difference",
    "title_slug": null,
    "raw_line": "10 find a pair with a given difference"
  },
  {
    "number": 355,
    "category": "Unknown",
    "title": "find four elements that sum to a given value",
    "title_slug": "word-ladder",
    "raw_line": "11 find four elements that sum to a given value"
  },
  {
    "number": 356,
    "category": "Unknown",
    "title": "maximum sum such that no 2 elements are adjacent",
    "title_slug": null,
    "raw_line": "12 maximum sum such that no 2 elements are adjacent"
  },
  {
    "number": 357,
    "category": "Unknown",
    "title": "Count triplet with sum smaller than a given value",
    "title_slug": null,
    "raw_line": "13 Count triplet with sum smaller than a given value"
  },
  {
    "number": 358,
    "category": "Unknown",
    "title": "merge 2 sorted arrays (",
    "title_slug": "merge-intervals",
    "raw_line": "14 merge 2 sorted arrays (https://practice.geeksforgeeks.org/problems/merge-two-"
  },
  {
    "number": 359,
    "category": "Unknown",
    "title": "print all subarrays with 0 sum (",
    "title_slug": null,
    "raw_line": "15 print all subarrays with 0 sum (https://practice.geeksforgeeks.org/problems/zero-"
  },
  {
    "number": 360,
    "category": "Unknown",
    "title": "Product array Puzzle (",
    "title_slug": null,
    "raw_line": "16 Product array Puzzle (https://practice.geeksforgeeks.org/problems/product-array-"
  },
  {
    "number": 361,
    "category": "Unknown",
    "title": "Sort array according to count of set bits",
    "title_slug": null,
    "raw_line": "17 Sort array according to count of set bits"
  },
  {
    "number": 362,
    "category": "Unknown",
    "title": "minimum no. of swaps required to sort the array",
    "title_slug": null,
    "raw_line": "18 minimum no. of swaps required to sort the array"
  },
  {
    "number": 363,
    "category": "Unknown",
    "title": "Bishu and Soldiers",
    "title_slug": null,
    "raw_line": "19 Bishu and Soldiers"
  },
  {
    "number": 364,
    "category": "Unknown",
    "title": "Rasta and Kheshtak",
    "title_slug": null,
    "raw_line": "20 Rasta and Kheshtak"
  },
  {
    "number": 365,
    "category": "Unknown",
    "title": "Kth smallest number again",
    "title_slug": null,
    "raw_line": "21 Kth smallest number again"
  },
  {
    "number": 366,
    "category": "Unknown",
    "title": "Find pivot element in a sorted array",
    "title_slug": null,
    "raw_line": "22 Find pivot element in a sorted array"
  },
  {
    "number": 367,
    "category": "Unknown",
    "title": "K-th Element of Two Sorted Arrays (",
    "title_slug": null,
    "raw_line": "23 K-th Element of Two Sorted Arrays (https://practice.geeksforgeeks.org/problems/k-"
  },
  {
    "number": 368,
    "category": "Unknown",
    "title": "Aggressive cows (",
    "title_slug": null,
    "raw_line": "24 Aggressive cows (https://www.spoj.com/problems/AGGRCOW/)"
  },
  {
    "number": 369,
    "category": "Unknown",
    "title": "Book Allocation Problem (",
    "title_slug": "majority-element-ii",
    "raw_line": "25 Book Allocation Problem (https://practice.geeksforgeeks.org/problems/allocate-"
  },
  {
    "number": 370,
    "category": "Unknown",
    "title": "EKOSPOJ: (",
    "title_slug": null,
    "raw_line": "26 EKOSPOJ: (https://www.spoj.com/problems/EKO/)"
  },
  {
    "number": 371,
    "category": "Unknown",
    "title": "Job Scheduling Algo (",
    "title_slug": "longest-common-prefix",
    "raw_line": "27 Job Scheduling Algo (https://www.geeksforgeeks.org/weighted-job-scheduling-"
  },
  {
    "number": 372,
    "category": "Unknown",
    "title": "Missing Number in AP (",
    "title_slug": null,
    "raw_line": "28 Missing Number in AP (https://practice.geeksforgeeks.org/problems/arithmetic-"
  },
  {
    "number": 373,
    "category": "Unknown",
    "title": "Smallest number with atleastn trailing zeroes infactorial",
    "title_slug": null,
    "raw_line": "29 Smallest number with atleastn trailing zeroes infactorial"
  },
  {
    "number": 374,
    "category": "Unknown",
    "title": "Painters Partition Problem: (",
    "title_slug": null,
    "raw_line": "30 Painters Partition Problem: (https://practice.geeksforgeeks.org/problems/allocate-"
  },
  {
    "number": 375,
    "category": "Unknown",
    "title": "ROTI-Prata SPOJ (",
    "title_slug": null,
    "raw_line": "31 ROTI-Prata SPOJ (https://www.spoj.com/problems/PRATA/)"
  },
  {
    "number": 376,
    "category": "Unknown",
    "title": "DoubleHelix SPOJ (",
    "title_slug": null,
    "raw_line": "32 DoubleHelix SPOJ (https://www.spoj.com/problems/ANARC05B/)"
  },
  {
    "number": 377,
    "category": "Unknown",
    "title": "Subset Sums (",
    "title_slug": null,
    "raw_line": "33 Subset Sums (https://www.spoj.com/problems/SUBSUMS/)"
  },
  {
    "number": 378,
    "category": "Unknown",
    "title": "Find the inversion count (",
    "title_slug": null,
    "raw_line": "34 Find the inversion count (https://practice.geeksforgeeks.org/problems/inversion-"
  },
  {
    "number": 379,
    "category": "Unknown",
    "title": "Implement Merge-sort in-place (",
    "title_slug": null,
    "raw_line": "35 Implement Merge-sort in-place (https://www.geeksforgeeks.org/in-place-merge-"
  },
  {
    "number": 380,
    "category": "Unknown",
    "title": "Partitioning and Sorting Arrays with Many Repeated Entries",
    "title_slug": null,
    "raw_line": "36 Partitioning and Sorting Arrays with Many Repeated Entries"
  },
  {
    "number": 381,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 382,
    "category": "Unknown",
    "title": "Implement Stack from Scratch",
    "title_slug": null,
    "raw_line": "1 Implement Stack from Scratch"
  },
  {
    "number": 383,
    "category": "Unknown",
    "title": "Implement Queue from Scratch (",
    "title_slug": null,
    "raw_line": "2 Implement Queue from Scratch (https://www.geeksforgeeks.org/queue-set-"
  },
  {
    "number": 384,
    "category": "Unknown",
    "title": "introduction-and-array-implementation/)",
    "title_slug": null,
    "raw_line": "1introduction-and-array-implementation/)"
  },
  {
    "number": 385,
    "category": "Unknown",
    "title": "Implement 2 stack in an array",
    "title_slug": null,
    "raw_line": "3 Implement 2 stack in an array"
  },
  {
    "number": 386,
    "category": "Unknown",
    "title": "find the middle element of a stack (",
    "title_slug": null,
    "raw_line": "4 find the middle element of a stack (https://www.geeksforgeeks.org/design-a-"
  },
  {
    "number": 387,
    "category": "Unknown",
    "title": "Implement \"N\" stacks in an Array (",
    "title_slug": null,
    "raw_line": "5 Implement \"N\" stacks in an Array (https://www.geeksforgeeks.org/efficiently-"
  },
  {
    "number": 388,
    "category": "Unknown",
    "title": "Check the expression has valid or Balanced parenthesis or not.",
    "title_slug": null,
    "raw_line": "6 Check the expression has valid or Balanced parenthesis or not."
  },
  {
    "number": 389,
    "category": "Unknown",
    "title": "Reverse a String using Stack",
    "title_slug": "count-and-say",
    "raw_line": "7 Reverse a String using Stack"
  },
  {
    "number": 390,
    "category": "Unknown",
    "title": "Design a Stack that supports getMin in O time and O extra space.",
    "title_slug": "flood-fill",
    "raw_line": "8 Design a Stack that supports getMin() in O(1) time and O(1) extra space."
  },
  {
    "number": 391,
    "category": "Unknown",
    "title": "Find the next Greater element (",
    "title_slug": "reorganize-string",
    "raw_line": "9 Find the next Greater element (https://practice.geeksforgeeks.org/problems/next-"
  },
  {
    "number": 392,
    "category": "Unknown",
    "title": "The celebrity Problem (",
    "title_slug": null,
    "raw_line": "10 The celebrity Problem (https://practice.geeksforgeeks.org/problems/the-celebrity-"
  },
  {
    "number": 393,
    "category": "Unknown",
    "title": "Arithmetic Expression evaluation (",
    "title_slug": "word-ladder",
    "raw_line": "11 Arithmetic Expression evaluation (https://www.geeksforgeeks.org/arithmetic-"
  },
  {
    "number": 394,
    "category": "Unknown",
    "title": "Evaluation of Postfix expression",
    "title_slug": null,
    "raw_line": "12 Evaluation of Postfix expression"
  },
  {
    "number": 395,
    "category": "Unknown",
    "title": "Implement a method to insert an element at its bottom without using any other data",
    "title_slug": null,
    "raw_line": "13 Implement a method to insert an element at its bottom without using any other data"
  },
  {
    "number": 396,
    "category": "Unknown",
    "title": "Reverse a stack using recursion (",
    "title_slug": "merge-intervals",
    "raw_line": "14 Reverse a stack using recursion (https://www.geeksforgeeks.org/reverse-a-stack-"
  },
  {
    "number": 397,
    "category": "Unknown",
    "title": "Sort a Stack using recursion (",
    "title_slug": null,
    "raw_line": "15 Sort a Stack using recursion (https://practice.geeksforgeeks.org/problems/sort-a-"
  },
  {
    "number": 398,
    "category": "Unknown",
    "title": "Merge Overlapping Intervals",
    "title_slug": null,
    "raw_line": "16 Merge Overlapping Intervals"
  },
  {
    "number": 399,
    "category": "Unknown",
    "title": "Largest rectangular Area in Histogram",
    "title_slug": null,
    "raw_line": "17 Largest rectangular Area in Histogram"
  },
  {
    "number": 400,
    "category": "Unknown",
    "title": "Length of the Longest Valid Substring",
    "title_slug": null,
    "raw_line": "18 Length of the Longest Valid Substring"
  },
  {
    "number": 401,
    "category": "Unknown",
    "title": "Expression contains redundant bracket or not",
    "title_slug": null,
    "raw_line": "19 Expression contains redundant bracket or not"
  },
  {
    "number": 402,
    "category": "Unknown",
    "title": "Implement Stack using Queue",
    "title_slug": null,
    "raw_line": "20 Implement Stack using Queue"
  },
  {
    "number": 403,
    "category": "Unknown",
    "title": "Implement Stack using Deque (",
    "title_slug": null,
    "raw_line": "21 Implement Stack using Deque (https://www.geeksforgeeks.org/implement-stack-"
  },
  {
    "number": 404,
    "category": "Unknown",
    "title": "Stack Permutations",
    "title_slug": null,
    "raw_line": "22 Stack Permutations (Check if an array is stack permutation of other)"
  },
  {
    "number": 405,
    "category": "Unknown",
    "title": "Implement Queue using Stack",
    "title_slug": null,
    "raw_line": "23 Implement Queue using Stack"
  },
  {
    "number": 406,
    "category": "Unknown",
    "title": "Implement \"n\" queue in an array (",
    "title_slug": null,
    "raw_line": "24 Implement \"n\" queue in an array (https://www.geeksforgeeks.org/efficiently-"
  },
  {
    "number": 407,
    "category": "Unknown",
    "title": "Implement a Circular queue (",
    "title_slug": "majority-element-ii",
    "raw_line": "25 Implement a Circular queue (https://www.geeksforgeeks.org/circular-queue-set-"
  },
  {
    "number": 408,
    "category": "Unknown",
    "title": "-introduction-array-implementation/)",
    "title_slug": null,
    "raw_line": "1-introduction-array-implementation/)"
  },
  {
    "number": 409,
    "category": "Unknown",
    "title": "LRU Cache Implementationa (",
    "title_slug": null,
    "raw_line": "26 LRU Cache Implementationa (https://practice.geeksforgeeks.org/problems/lru-"
  },
  {
    "number": 410,
    "category": "Unknown",
    "title": "Reverse a Queue using recursion",
    "title_slug": "longest-common-prefix",
    "raw_line": "27 Reverse a Queue using recursion"
  },
  {
    "number": 411,
    "category": "Unknown",
    "title": "Reverse the first “K” elements of a queue",
    "title_slug": null,
    "raw_line": "28 Reverse the first “K” elements of a queue"
  },
  {
    "number": 412,
    "category": "Unknown",
    "title": "Interleave the first half of the queue with second half",
    "title_slug": null,
    "raw_line": "29 Interleave the first half of the queue with second half"
  },
  {
    "number": 413,
    "category": "Unknown",
    "title": "Find the first circular tour that visits all Petrol Pumps",
    "title_slug": null,
    "raw_line": "30 Find the first circular tour that visits all Petrol Pumps"
  },
  {
    "number": 414,
    "category": "Unknown",
    "title": "Minimum time required to rot all oranges",
    "title_slug": null,
    "raw_line": "31 Minimum time required to rot all oranges"
  },
  {
    "number": 415,
    "category": "Unknown",
    "title": "Distance of nearest cell having 1 in a binary matrix",
    "title_slug": null,
    "raw_line": "32 Distance of nearest cell having 1 in a binary matrix"
  },
  {
    "number": 416,
    "category": "Unknown",
    "title": "/0)",
    "title_slug": null,
    "raw_line": "1/0)"
  },
  {
    "number": 417,
    "category": "Unknown",
    "title": "First negative integer in every window of size “k”",
    "title_slug": null,
    "raw_line": "33 First negative integer in every window of size “k”"
  },
  {
    "number": 418,
    "category": "Unknown",
    "title": "Check if all levels of two trees are anagrams or not.",
    "title_slug": null,
    "raw_line": "34 Check if all levels of two trees are anagrams or not."
  },
  {
    "number": 419,
    "category": "Unknown",
    "title": "Sum of minimum and maximum elements of all subarrays of size “k”.",
    "title_slug": null,
    "raw_line": "35 Sum of minimum and maximum elements of all subarrays of size “k”."
  },
  {
    "number": 420,
    "category": "Unknown",
    "title": "Minimum sum of squares of character counts in a given string after removing “k”",
    "title_slug": null,
    "raw_line": "36 Minimum sum of squares of character counts in a given string after removing “k”"
  },
  {
    "number": 421,
    "category": "Unknown",
    "title": "Queue based approach or first non-repeating character in a stream.",
    "title_slug": null,
    "raw_line": "37 Queue based approach or first non-repeating character in a stream."
  },
  {
    "number": 422,
    "category": "Unknown",
    "title": "Next Smaller Element (",
    "title_slug": null,
    "raw_line": "38 Next Smaller Element (https://www.geeksforgeeks.org/next-smaller-element/)"
  },
  {
    "number": 423,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 424,
    "category": "Unknown",
    "title": "Reverse a String (",
    "title_slug": "reverse-string",
    "raw_line": "1 Reverse a String (https://leetcode.com/problems/reverse-string/)"
  },
  {
    "number": 425,
    "category": "Unknown",
    "title": "Check whether a String is Palindrome or not",
    "title_slug": null,
    "raw_line": "2 Check whether a String is Palindrome or not"
  },
  {
    "number": 426,
    "category": "Unknown",
    "title": "Find Duplicate characters in a string (",
    "title_slug": null,
    "raw_line": "3 Find Duplicate characters in a string (https://www.geeksforgeeks.org/print-all-the-"
  },
  {
    "number": 427,
    "category": "Unknown",
    "title": "Why strings are immutable in Java? (",
    "title_slug": null,
    "raw_line": "4 Why strings are immutable in Java? (https://www.baeldung.com/java-string-"
  },
  {
    "number": 428,
    "category": "Unknown",
    "title": "Write a Code to check whether one string is a rotation of another",
    "title_slug": null,
    "raw_line": "5 Write a Code to check whether one string is a rotation of another"
  },
  {
    "number": 429,
    "category": "Unknown",
    "title": "Write a Program to check whether a string is a valid shuffle of two strings or not",
    "title_slug": null,
    "raw_line": "6 Write a Program to check whether a string is a valid shuffle of two strings or not"
  },
  {
    "number": 430,
    "category": "Unknown",
    "title": "Count and Say problem (",
    "title_slug": "count-and-say",
    "raw_line": "7 Count and Say problem (https://leetcode.com/problems/count-and-say/)"
  },
  {
    "number": 431,
    "category": "Unknown",
    "title": "Write a program to find the longest Palindrome in a string.[ Longest palindromic",
    "title_slug": "flood-fill",
    "raw_line": "8 Write a program to find the longest Palindrome in a string.[ Longest palindromic"
  },
  {
    "number": 432,
    "category": "Unknown",
    "title": "Find Longest Recurring Subsequence in String",
    "title_slug": "reorganize-string",
    "raw_line": "9 Find Longest Recurring Subsequence in String"
  },
  {
    "number": 433,
    "category": "Unknown",
    "title": "Print all Subsequences of a string. (",
    "title_slug": null,
    "raw_line": "10 Print all Subsequences of a string. (https://www.geeksforgeeks.org/print-"
  },
  {
    "number": 434,
    "category": "Unknown",
    "title": "Print all the permutations of the given string",
    "title_slug": "word-ladder",
    "raw_line": "11 Print all the permutations of the given string"
  },
  {
    "number": 435,
    "category": "Unknown",
    "title": "Split the Binary string into two substring with equal 0’s and 1’s",
    "title_slug": null,
    "raw_line": "12 Split the Binary string into two substring with equal 0’s and 1’s"
  },
  {
    "number": 436,
    "category": "Unknown",
    "title": "Word Wrap Problem .",
    "title_slug": null,
    "raw_line": "13 Word Wrap Problem [VERY IMP]."
  },
  {
    "number": 437,
    "category": "Unknown",
    "title": "EDIT Distance  (",
    "title_slug": "merge-intervals",
    "raw_line": "14 EDIT Distance [Very Imp] (https://practice.geeksforgeeks.org/problems/edit-"
  },
  {
    "number": 438,
    "category": "Unknown",
    "title": "Find next greater number with same set of digits.",
    "title_slug": null,
    "raw_line": "15 Find next greater number with same set of digits. [Very Very IMP]"
  },
  {
    "number": 439,
    "category": "Unknown",
    "title": "Balanced Parenthesis problem.",
    "title_slug": null,
    "raw_line": "16 Balanced Parenthesis problem.[Imp]"
  },
  {
    "number": 440,
    "category": "Unknown",
    "title": "Word break Problem",
    "title_slug": null,
    "raw_line": "17 Word break Problem[ Very Imp]"
  },
  {
    "number": 441,
    "category": "Unknown",
    "title": "Rabin Karp Algo (",
    "title_slug": null,
    "raw_line": "18 Rabin Karp Algo (https://www.geeksforgeeks.org/rabin-karp-algorithm-for-"
  },
  {
    "number": 442,
    "category": "Unknown",
    "title": "KMP Algo (",
    "title_slug": null,
    "raw_line": "19 KMP Algo (https://practice.geeksforgeeks.org/problems/longest-prefix-"
  },
  {
    "number": 443,
    "category": "Unknown",
    "title": "Convert a Sentence into its equivalent mobile numeric keypad sequence.",
    "title_slug": null,
    "raw_line": "20 Convert a Sentence into its equivalent mobile numeric keypad sequence."
  },
  {
    "number": 444,
    "category": "Unknown",
    "title": "Minimum number of bracket reversals needed to make an expression balanced.",
    "title_slug": null,
    "raw_line": "21 Minimum number of bracket reversals needed to make an expression balanced."
  },
  {
    "number": 445,
    "category": "Unknown",
    "title": "Count All Palindromic Subsequence in a given String.",
    "title_slug": null,
    "raw_line": "22 Count All Palindromic Subsequence in a given String."
  },
  {
    "number": 446,
    "category": "Unknown",
    "title": "Count of number of given string in 2D character array",
    "title_slug": null,
    "raw_line": "23 Count of number of given string in 2D character array"
  },
  {
    "number": 447,
    "category": "Unknown",
    "title": "Search a Word in a 2D Grid of characters.",
    "title_slug": null,
    "raw_line": "24 Search a Word in a 2D Grid of characters."
  },
  {
    "number": 448,
    "category": "Unknown",
    "title": "Boyer Moore Algorithm for Pattern Searching.",
    "title_slug": "majority-element-ii",
    "raw_line": "25 Boyer Moore Algorithm for Pattern Searching."
  },
  {
    "number": 449,
    "category": "Unknown",
    "title": "Converting Roman Numerals to Decimal",
    "title_slug": null,
    "raw_line": "26 Converting Roman Numerals to Decimal"
  },
  {
    "number": 450,
    "category": "Unknown",
    "title": "Longest Common Prefix (",
    "title_slug": "longest-common-prefix",
    "raw_line": "27 Longest Common Prefix (https://leetcode.com/problems/longest-common-prefix/)"
  },
  {
    "number": 451,
    "category": "Unknown",
    "title": "Number of flips to make binary string alternate",
    "title_slug": null,
    "raw_line": "28 Number of flips to make binary string alternate"
  },
  {
    "number": 452,
    "category": "Unknown",
    "title": "Find the first repeated word in string.",
    "title_slug": null,
    "raw_line": "29 Find the first repeated word in string."
  },
  {
    "number": 453,
    "category": "Unknown",
    "title": "Minimum number of swaps for bracket balancing.",
    "title_slug": null,
    "raw_line": "30 Minimum number of swaps for bracket balancing."
  },
  {
    "number": 454,
    "category": "Unknown",
    "title": "Find the longest common subsequence between two strings.",
    "title_slug": null,
    "raw_line": "31 Find the longest common subsequence between two strings."
  },
  {
    "number": 455,
    "category": "Unknown",
    "title": "Program to generate all possible valid IP addresses from given string.",
    "title_slug": null,
    "raw_line": "32 Program to generate all possible valid IP addresses from given string."
  },
  {
    "number": 456,
    "category": "Unknown",
    "title": "Write a program to find the smallest window that contains all characters of string",
    "title_slug": null,
    "raw_line": "33 Write a program to find the smallest window that contains all characters of string"
  },
  {
    "number": 457,
    "category": "Unknown",
    "title": "Rearrange characters in a string such that no two adjacent are same",
    "title_slug": null,
    "raw_line": "34 Rearrange characters in a string such that no two adjacent are same"
  },
  {
    "number": 458,
    "category": "Unknown",
    "title": "Minimum characters to be added at front to make string palindrome",
    "title_slug": null,
    "raw_line": "35 Minimum characters to be added at front to make string palindrome"
  },
  {
    "number": 459,
    "category": "Unknown",
    "title": "Given a sequence of words, print all anagrams together",
    "title_slug": null,
    "raw_line": "36 Given a sequence of words, print all anagrams together"
  },
  {
    "number": 460,
    "category": "Unknown",
    "title": "Find the smallest window in a string containing all characters of another string",
    "title_slug": null,
    "raw_line": "37 Find the smallest window in a string containing all characters of another string"
  },
  {
    "number": 461,
    "category": "Unknown",
    "title": "Recursively remove all adjacent duplicates",
    "title_slug": null,
    "raw_line": "38 Recursively remove all adjacent duplicates"
  },
  {
    "number": 462,
    "category": "Unknown",
    "title": "String matching where one string contains wildcard characters",
    "title_slug": null,
    "raw_line": "39 String matching where one string contains wildcard characters"
  },
  {
    "number": 463,
    "category": "Unknown",
    "title": "Function to find Number of customers who could not get a computer",
    "title_slug": null,
    "raw_line": "40 Function to find Number of customers who could not get a computer"
  },
  {
    "number": 464,
    "category": "Unknown",
    "title": "Transform One String to Another using Minimum Number of Given Operation",
    "title_slug": null,
    "raw_line": "41 Transform One String to Another using Minimum Number of Given Operation"
  },
  {
    "number": 465,
    "category": "Unknown",
    "title": "Check if two given strings are isomorphic to each other",
    "title_slug": null,
    "raw_line": "42 Check if two given strings are isomorphic to each other"
  },
  {
    "number": 466,
    "category": "Unknown",
    "title": "Recursively print all sentences that can be formed from list of word lists",
    "title_slug": null,
    "raw_line": "43 Recursively print all sentences that can be formed from list of word lists"
  },
  {
    "number": 467,
    "category": "Unknown",
    "title": "DSA Cracker",
    "title_slug": "reverse-string",
    "raw_line": "450 DSA Cracker"
  },
  {
    "number": 468,
    "category": "Unknown",
    "title": "Construct a trie from scratch (",
    "title_slug": null,
    "raw_line": "1 Construct a trie from scratch (https://www.geeksforgeeks.org/trie-insert-and-"
  },
  {
    "number": 469,
    "category": "Unknown",
    "title": "Find shortest unique prefix for every word in a given list",
    "title_slug": null,
    "raw_line": "2 Find shortest unique prefix for every word in a given list"
  },
  {
    "number": 470,
    "category": "Unknown",
    "title": "Word Break Problem |  (",
    "title_slug": null,
    "raw_line": "3 Word Break Problem | (Trie solution) (https://www.geeksforgeeks.org/word-break-"
  },
  {
    "number": 471,
    "category": "Unknown",
    "title": "Given a sequence of words, print all anagrams together",
    "title_slug": null,
    "raw_line": "4 Given a sequence of words, print all anagrams together"
  },
  {
    "number": 472,
    "category": "Unknown",
    "title": "Implement a Phone Directory",
    "title_slug": null,
    "raw_line": "5 Implement a Phone Directory"
  },
  {
    "number": 473,
    "category": "Unknown",
    "title": "Print unique rows in a given boolean matrix",
    "title_slug": null,
    "raw_line": "6 Print unique rows in a given boolean matrix"
  }
]