<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Mohit Jaisal</title>
    <description>The latest articles on DEV Community by Mohit Jaisal (@mohitjaisal).</description>
    <link>https://dev.to/mohitjaisal</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480617%2F8b1fe0a6-6fea-4e0d-8e84-33dbf3277020.png</url>
      <title>DEV Community: Mohit Jaisal</title>
      <link>https://dev.to/mohitjaisal</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/mohitjaisal"/>
    <language>en</language>
    <item>
      <title>Complete Data Structures and Algorithms Questions in sequence || DS &amp; Algo Questions for Practice of all  types</title>
      <dc:creator>Mohit Jaisal</dc:creator>
      <pubDate>Sun, 07 Feb 2021 09:41:33 +0000</pubDate>
      <link>https://dev.to/mohitjaisal/complete-data-structures-and-algorithms-questions-in-sequence-ds-algo-questions-for-practice-of-all-types-2k7g</link>
      <guid>https://dev.to/mohitjaisal/complete-data-structures-and-algorithms-questions-in-sequence-ds-algo-questions-for-practice-of-all-types-2k7g</guid>
      <description>&lt;p&gt;All the Questions listed here is in sequence to build your interest in DSA and after completing these Questions you will be able to solve all types of DSA Questions&lt;/p&gt;

&lt;div class="table-wrapper-paragraph"&gt;&lt;table id="sheet0"&gt;
        &lt;col&gt;
        &lt;col&gt;
        &lt;col&gt;
        &lt;tbody&gt;
          
          &lt;tr&gt;
            &lt;td&gt;Topic&lt;/td&gt;
            &lt;td&gt;Problems &lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/write-a-program-to-reverse-an-array-or-string/" title=""&gt;Reverse the array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/maximum-and-minimum-in-an-array/" title=""&gt;Find the maximum and minimum element in an array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/kth-smallest-element/0" title=""&gt;Find the "Kth" max and min element of an array &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s/0" title=""&gt;Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/move-negative-numbers-beginning-positive-end-constant-extra-space/" title=""&gt;Move all the negative elements to one side of the array &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/union-of-two-arrays/0" title=""&gt;Find the Union and Intersection of the two sorted arrays.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/cyclically-rotate-an-array-by-one/0" title=""&gt;Write a program to cyclically rotate an array by one.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0" title=""&gt;find Largest sum contiguous Subarray [V. IMP]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimize-the-heights3351/1" title=""&gt;Minimise the maximum difference between heights [V.IMP]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps/0" title=""&gt;Minimum no. of Jumps to reach end of an array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/find-the-duplicate-number/" title=""&gt;find duplicate in an array of N+1 Integers&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1" title=""&gt;Merge 2 sorted arrays without using Extra space.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0" title=""&gt;Kadane's Algo [V.V.V.V.V IMP]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/merge-intervals/" title=""&gt;Merge Intervals&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/next-permutation/" title=""&gt;Next Permutation&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/inversion-of-array/0" title=""&gt;Count Inversion&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock/" title=""&gt;Best time to buy and Sell stock&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/count-pairs-with-given-sum5022/1" title=""&gt;find all pairs on integer array whose sum is equal to given number&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/common-elements1132/1" title=""&gt;find common elements In 3 sorted arrays&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/rearrange-array-alternating-positive-negative-items-o1-extra-space/" title=""&gt;Rearrange the array in alternating positive and negative items with O(1) extra space&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/subarray-with-0-sum/0" title=""&gt;Find if there is any subarray with sum equal to 0&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/factorials-of-large-numbers/0" title=""&gt;Find factorial of a large number&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/maximum-product-subarray3604/1" title=""&gt;find maximum product subarray &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence/0" title=""&gt;Find longest coinsecutive subsequence&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times/" title=""&gt;Given an array of size n and a number k, fin all elements that appear more than " n/k " times.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/maximum-profit-by-buying-and-selling-a-share-at-most-twice/" title=""&gt;Maximum profit by buying and selling a share atmost twice&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/array-subset-of-another-array/0" title=""&gt;Find whether an array is a subset of another array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/triplet-sum-in-array/0" title=""&gt;Find the triplet that sum to a given value&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/trapping-rain-water/0" title=""&gt;Trapping Rain water problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0" title=""&gt;Chocolate Distribution problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/smallest-subarray-with-sum-greater-than-x/0" title=""&gt;Smallest Subarray with sum greater than a given value&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/three-way-partitioning/1" title=""&gt;Three way partitioning of an array around a given value&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-swaps-required-to-bring-all-elements-less-than-or-equal-to-k-together/0" title=""&gt;Minimum swaps required bring elements less equal K together&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/palindromic-array/0" title=""&gt;Minimum no. of operations required to make an array palindrome&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/find-the-median0527/1" title=""&gt;Median of 2 sorted arrays of equal size&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Array&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/median-of-two-sorted-arrays-of-different-sizes/" title=""&gt;Median of 2 sorted arrays of different size&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Matrix&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix/0" title=""&gt;Spiral traversal on a Matrix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Matrix&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/search-a-2d-matrix/" title=""&gt;Search an element in a matriix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Matrix&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/median-in-a-row-wise-sorted-matrix1527/1" title=""&gt;Find median in a row wise sorted matrix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Matrix&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/row-with-max-1s0023/1" title=""&gt;Find row with maximum no. of 1's&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Matrix&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/sorted-matrix/0" title=""&gt;Print elements in sorted order using row-column wise sorted matrix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Matrix&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/max-rectangle/1" title=""&gt;Maximum size rectangle&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Matrix&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-a-specific-pair-in-matrix/" title=""&gt;Find a specific pair in matrix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Matrix&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/rotate-a-matrix-by-90-degree-in-clockwise-direction-without-using-any-extra-space/" title=""&gt;Rotate matrix by 90 degrees&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Matrix&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/kth-element-in-matrix/1" title=""&gt;Kth smallest element in a row-cpumn wise sorted matrix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Matrix&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/common-elements-in-all-rows-of-a-given-matrix/" title=""&gt;Common elements in all rows of a given matrix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt; &lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/reverse-string/" title=""&gt;Reverse a String&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/palindrome-string0817/1" title=""&gt;Check whether a String is Palindrome or not&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/" title=""&gt;Find Duplicate characters in a string&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;Why strings are immutable in Java?&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/" title=""&gt;Write a Code to check whether one string is a rotation of another&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.programiz.com/java-programming/examples/check-valid-shuffle-of-strings" title=""&gt;Write a Program to check whether a string is a valid shuffle of two strings or not&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/count-and-say/" title=""&gt;Count and Say problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-palindrome-in-a-string/0" title=""&gt;Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-repeating-subsequence/0" title=""&gt;Find Longest Recurring Subsequence in String&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/print-subsequences-string/" title=""&gt;Print all Subsequences of a string.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string/0" title=""&gt;Print all the permutations of the given string&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/split-the-binary-string-into-substrings-with-equal-number-of-0s-and-1s/" title=""&gt;Split the Binary string into two substring with equal 0’s and 1’s&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/word-wrap/0" title=""&gt;Word Wrap Problem [VERY IMP].&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/edit-distance3702/1" title=""&gt;EDIT Distance [Very Imp]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/next-permutation/0" title=""&gt;Find next greater number with same set of digits. [Very Very IMP]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/parenthesis-checker/0" title=""&gt;Balanced Parenthesis problem.[Imp]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/word-break/0" title=""&gt;Word break Problem[ Very Imp]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/" title=""&gt;Rabin Karp Algo&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-prefix-suffix2527/1" title=""&gt;KMP Algo&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/convert-sentence-equivalent-mobile-numeric-keypad-sequence/" title=""&gt;Convert a Sentence into its equivalent mobile numeric keypad sequence.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/count-the-reversals/0" title=""&gt;Minimum number of bracket reversals needed to make an expression balanced.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/count-palindromic-subsequences/1" title=""&gt;Count All Palindromic Subsequence in a given String.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-count-number-given-string-present-2d-character-array/" title=""&gt;Count of number of given string in 2D character array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/find-the-string-in-grid/0" title=""&gt;Search a Word in a 2D Grid of characters.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/" title=""&gt;Boyer Moore Algorithm for Pattern Searching.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/roman-number-to-integer/0" title=""&gt;Converting Roman Numerals to Decimal&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/longest-common-prefix/" title=""&gt;Longest Common Prefix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/min-number-of-flips/0" title=""&gt;Number of flips to make binary string alternate&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/second-most-repeated-string-in-a-sequence/0" title=""&gt;Find the first repeated word in string.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-swaps-for-bracket-balancing/0" title=""&gt;Minimum number of swaps for bracket balancing.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-common-subsequence/0" title=""&gt;Find the longest common subsequence between two strings.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/program-generate-possible-valid-ip-addresses-given-string/" title=""&gt;Program to generate all possible valid IP addresses from given  string.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/smallest-distant-window/0" title=""&gt;Write a program tofind the smallest window that contains all characters of string itself.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/rearrange-characters/0" title=""&gt;Rearrange characters in a string such that no two adjacent are same&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/minimum-characters-added-front-make-string-palindrome/" title=""&gt;Minimum characters to be added at front to make string palindrome&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/k-anagrams-1/0" title=""&gt;Given a sequence of words, print all anagrams together&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0" title=""&gt;Find the smallest window in a string containing all characters of another string&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/consecutive-elements/0" title=""&gt;Recursively remove all adjacent duplicates&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/wildcard-string-matching/0" title=""&gt;String matching where one string contains wildcard characters&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/function-to-find-number-of-customers-who-could-not-get-a-computer/" title=""&gt;Function to find Number of customers who could not get a computer&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/transform-one-string-to-another-using-minimum-number-of-given-operation/" title=""&gt;Transform One String to Another using Minimum Number of Given Operation&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/isomorphic-strings/0" title=""&gt;Check if two given strings are isomorphic to each other&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;String&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/recursively-print-all-sentences-that-can-be-formed-from-list-of-word-lists/" title=""&gt;Recursively print all sentences that can be formed from list of word lists&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt; &lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/first-and-last-occurrences-of-x/0" title=""&gt;Find first and last positions of an element in a sorted array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/value-equal-to-index-value1330/1" title=""&gt;Find a Fixed Point (Value equal to index) in a given array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/search-in-rotated-sorted-array/" title=""&gt;Search in a rotated sorted array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/count-squares3649/1" title=""&gt;square root of an integer&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/middle-of-three2926/1" title=""&gt;Maximum and minimum of an array using minimum number of comparisons&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/optimum-location-point-minimize-total-distance/#:~:text=We%20need%20to%20find%20a,set%20of%20points%20is%20minimum.&amp;amp;text=In%20above%20figure%20optimum%20location,is%20minimum%20obtainable%20total%20distance." title=""&gt;Optimum location of point to minimize total distance&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/find-missing-and-repeating2512/1" title=""&gt;Find the repeating and the missing&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/majority-element/0" title=""&gt;find majority element&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/searching-array-adjacent-differ-k/" title=""&gt;Searching in an array where adjacent differ by at most k&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/find-pair-given-difference/0" title=""&gt;find a pair with a given difference&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/find-all-four-sum-numbers/0" title=""&gt;find four elements that sum to a given value&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/stickler-theif/0" title=""&gt;maximum sum such that no 2 elements are adjacent&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/count-triplets-with-sum-smaller-than-x5549/1" title=""&gt;Count triplet with sum smaller than a given value&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1" title=""&gt;merge 2 sorted arrays&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/zero-sum-subarrays/0" title=""&gt;print all subarrays with 0 sum&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/product-array-puzzle/0" title=""&gt;Product array Puzzle&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/sort-by-set-bit-count/0" title=""&gt;Sort array according to count of set bits&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-swaps/1" title=""&gt;minimum no. of swaps required to sort the array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/bishu-and-soldiers/" title=""&gt;Bishu and Soldiers&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/rasta-and-kheshtak/" title=""&gt;Rasta and Kheshtak&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/kth-smallest-number-again-2/" title=""&gt;Kth smallest number again&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="http://theoryofprogramming.com/2017/12/16/find-pivot-element-sorted-rotated-array/" title=""&gt;Find pivot element in a sorted array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/k-th-element-of-two-sorted-array/0" title=""&gt;K-th Element of Two Sorted Arrays&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/AGGRCOW/" title=""&gt;Aggressive cows&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages/0" title=""&gt;Book Allocation Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/EKO/" title=""&gt;EKOSPOJ:&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/weighted-job-scheduling-log-n-time/" title=""&gt;Job Scheduling Algo&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/arithmetic-number/0" title=""&gt;Missing Number in AP&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/smallest-factorial-number5929/1" title=""&gt;Smallest number with atleastn trailing zeroes infactorial&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages/0" title=""&gt;Painters Partition Problem:&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/PRATA/" title=""&gt;ROTI-Prata SPOJ&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/ANARC05B/" title=""&gt;DoubleHelix SPOJ&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/SUBSUMS/" title=""&gt;Subset Sums&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/inversion-of-array/0" title=""&gt;Findthe inversion count&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/in-place-merge-sort/" title=""&gt;Implement Merge-sort in-place&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Searching &amp;amp; Sorting&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.baeldung.com/java-sorting-arrays-with-repeated-entries" title=""&gt;Partitioning and Sorting Arrays with Many Repeated Entries&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt; &lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/reverse-a-linked-list/" title=""&gt;Write a Program to reverse the Linked List. (Both Iterative and recursive)&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1" title=""&gt;Reverse a Linked List in group of Given Size. [Very Imp]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/detect-loop-in-linked-list/1" title=""&gt;Write a program to Detect loop in a linked list.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/remove-loop-in-linked-list/1" title=""&gt;Write a program to Delete loop in a linked list.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-first-node-of-loop-in-a-linked-list/" title=""&gt;Find the starting point of the loop. &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/remove-duplicate-element-from-sorted-linked-list/1" title=""&gt;Remove Duplicates in a sorted Linked List.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/remove-duplicates-from-an-unsorted-linked-list/1" title=""&gt;Remove Duplicates in a Un-sorted Linked List.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/move-last-element-to-front-of-a-given-linked-list/" title=""&gt;Write a Program to Move the last element to Front in a Linked List.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/add-1-to-a-number-represented-as-linked-list/1" title=""&gt;Add “1” to a number represented as a Linked List.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1" title=""&gt;Add two numbers represented by linked lists.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/1" title=""&gt;Intersection of two Sorted Linked List.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1" title=""&gt;Intersection Point of two Linked Lists.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/sort-a-linked-list/1" title=""&gt;Merge Sort For Linked lists.[Very Important]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/quick-sort-on-linked-list/1" title=""&gt;Quicksort for Linked Lists.[Very Important]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/middle-of-the-linked-list/" title=""&gt;Find the middle Element of a linked list.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/circular-linked-list/1" title=""&gt;Check if a linked list is a circular linked list.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/split-a-circular-linked-list-into-two-halves/1" title=""&gt;Split a Circular linked list into two halves.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1" title=""&gt;Write a Program to check whether the Singly Linked list is a palindrome or not.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/deletion-circular-linked-list/" title=""&gt;Deletion from a Circular Linked List.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/reverse-a-doubly-linked-list/1" title=""&gt;Reverse a Doubly Linked list.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-pairs-given-sum-doubly-linked-list/" title=""&gt;Find pairs with a given sum in a DLL.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/count-triplets-sorted-doubly-linked-list-whose-sum-equal-given-value-x/" title=""&gt;Count triplets in a sorted DLL whose sum is equal to given value “X”.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/sort-k-sorted-doubly-linked-list/" title=""&gt;Sort a “k”sorted Doubly Linked list.[Very IMP]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/rotate-doubly-linked-list-n-nodes/" title=""&gt;Rotate DoublyLinked list by N nodes.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/reverse-doubly-linked-list-groups-given-size/" title=""&gt;Rotate a Doubly Linked list in group of Given Size.[Very IMP]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;Can we reverse a linked list in less than O(n) ?&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ?&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/flattening-a-linked-list/1" title=""&gt;Flatten a Linked List&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/given-a-linked-list-of-0s-1s-and-2s-sort-it/1" title=""&gt;Sort a LL of 0's, 1's and 2's&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1" title=""&gt;Clone a linked list with next and random pointer&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1" title=""&gt;Merge K sorted Linked list&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/multiply-two-linked-lists/1" title=""&gt;Multiply 2 no. represented by LL&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/delete-nodes-having-greater-value-on-right/1" title=""&gt;Delete nodes which have a greater value on right side&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/segregate-even-and-odd-nodes-in-a-linked-list/0" title=""&gt;Segregate even and odd nodes in a Linked List&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1" title=""&gt;Program for n’th node from the end of a Linked List&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;LinkedList&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0" title=""&gt;Find the first non-repeating character from a stream of characters&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt; &lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/level-order-traversal/1" title=""&gt;level order traversal&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/reverse-level-order-traversal/1" title=""&gt;Reverse Level Order traversal&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/height-of-binary-tree/1" title=""&gt;Height of a tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1" title=""&gt;Diameter of a tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/create-a-mirror-tree-from-the-given-binary-tree/" title=""&gt;Mirror of a tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/" title=""&gt;Inorder Traversal of a tree both using recursion and Iteration&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/" title=""&gt;Preorder Traversal of a tree both using recursion and Iteration&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/" title=""&gt;Postorder Traversal of a tree both using recursion and Iteration&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1" title=""&gt;Left View of a tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/right-view-of-binary-tree/1" title=""&gt;Right View of Tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1" title=""&gt;Top View of a tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1" title=""&gt;Bottom View of a tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/zigzag-tree-traversal/1" title=""&gt;Zig-Zag traversal of a binary tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/check-for-balanced-tree/1" title=""&gt;Check if a tree is balanced or not&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/diagonal-traversal-of-binary-tree/" title=""&gt;Diagnol Traversal of a Binary tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1" title=""&gt;Boundary traversal of a Binary tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/construct-binary-tree-string-bracket-representation/" title=""&gt;Construct Binary Tree from String with Bracket Representation&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1" title=""&gt;Convert Binary tree into Doubly Linked List&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/transform-to-sum-tree/1" title=""&gt;Convert Binary tree into Sum tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/construct-tree-1/1" title=""&gt;Construct Binary tree from Inorder and preorder traversal&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/minimum-swap-required-convert-binary-tree-binary-search-tree/#:~:text=Given%20the%20array%20representation%20of,it%20into%20Binary%20Search%20Tree.&amp;amp;text=Swap%201%3A%20Swap%20node%208,node%209%20with%20node%2010." title=""&gt;Find minimum swaps required to convert a Binary tree into BST&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/sum-tree/1" title=""&gt;Check if Binary tree is Sum tree or not&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/leaf-at-same-level/1" title=""&gt;Check if all leaf nodes are at same level or not&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/duplicate-subtree-in-binary-tree/1" title=""&gt;Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0" title=""&gt;Check if 2 trees are mirror or not&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/sum-of-the-longest-bloodline-of-a-tree/1" title=""&gt;Sum of Nodes on the Longest path from root to leaf node &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/check-given-graph-tree/#:~:text=Since%20the%20graph%20is%20undirected,graph%20is%20connected%2C%20otherwise%20not." title=""&gt;Check if given graph is tree or not.  [ IMP ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-largest-subtree-sum-tree/" title=""&gt;Find Largest subtree sum in a tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/maximum-sum-nodes-binary-tree-no-two-adjacent/" title=""&gt;Maximum Sum of nodes in Binary tree such that no two are adjacent &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/print-k-sum-paths-binary-tree/" title=""&gt;Print all "K" Sum paths in a Binary tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-binary-tree/1" title=""&gt;Find LCA in a Binary tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1" title=""&gt;Find distance between 2 nodes in a Binary tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/kth-ancestor-node-binary-tree-set-2/" title=""&gt;Kth Ancestor of node in a Binary tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/duplicate-subtrees/1" title=""&gt;Find all Duplicate subtrees in a Binary tree [ IMP ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/check-if-tree-is-isomorphic/1" title=""&gt;Tree Isomorphism Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/binary-search-tree-set-1-search-and-insertion/" title=""&gt;Fina a value in a BST&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/delete-node-in-a-bst/" title=""&gt;Deletion of a node in a BST&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-element-in-bst/1" title=""&gt;Find min and max value in a BST&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/predecessor-and-successor/1" title=""&gt;Find inorder successor and inorder predecessor in a BST&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/check-for-bst/1" title=""&gt;Check if a tree is a BST or not &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/populate-inorder-successor-for-all-nodes/1" title=""&gt;Populate Inorder successor of all nodes&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-bst/1" title=""&gt;Find LCA  of 2 nodes in a BST&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversa/" title=""&gt;Construct BST from preorder traversal&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/binary-tree-to-bst/1" title=""&gt;Convert Binary tree into BST&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/convert-normal-bst-balanced-bst/" title=""&gt;Convert a normal BST into a Balanced BST&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/merge-two-balanced-binary-search-trees/" title=""&gt;Merge two BST [ V.V.V&amp;gt;IMP ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/kth-largest-element-in-bst/1" title=""&gt;Find Kth largest element in a BST&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/find-k-th-smallest-element-in-bst/1" title=""&gt;Find Kth smallest element in a BST&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/brothers-from-different-root/1" title=""&gt;Count pairs from 2 BST whose sum is equal to given value "X"&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-median-bst-time-o1-space/" title=""&gt;Find the median of BST in O(n) time and O(1) space&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1" title=""&gt;Count BST ndoes that lie in a given range&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/replace-every-element-with-the-least-greater-element-on-its-right/" title=""&gt;Replace every element with the least greater element on its right&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/given-n-appointments-find-conflicting-appointments/" title=""&gt;Given "n" appointments, find the conflicting appointments&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/preorder-to-postorder/0" title=""&gt;Check preorder is valid or not&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/check-whether-bst-contains-dead-end/1" title=""&gt;Check whether BST contains Dead end&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/largest-bst/1" title=""&gt;Largest BST in a Binary Tree [ V.V.V.V.V IMP ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Binary Search Trees&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/flatten-bst-to-sorted-list-increasing-order/" title=""&gt;Flatten BST to sorted list&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/n-meetings-in-one-room/0" title=""&gt;Activity Selection Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/job-sequencing-problem/0" title=""&gt;Job SequencingProblem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/huffman-encoding/0" title=""&gt;Huffman Coding&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/water-connection-problem/0" title=""&gt;Water Connection Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/fractional-knapsack/0" title=""&gt;Fractional Knapsack Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/coin-piles/0" title=""&gt;Greedy Algorithm to find Minimum number of Coins&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/maximum-trains-stoppage-can-provided/" title=""&gt;Maximum trains for which stoppage can be provided&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-platforms/0" title=""&gt;Minimum Platforms Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/buy-maximum-stocks-stocks-can-bought-th-day/" title=""&gt;Buy Maximum Stocks if i stocks can be bought on i-th day&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/shop-in-candy-store/0" title=""&gt;Find the minimum and maximum amount to buy all N candies&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/" title=""&gt;Minimize Cash Flow among a given set of friends who have borrowed money from each other&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/minimum-cost-cut-board-squares/" title=""&gt;Minimum Cost to cut a board into squares&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/survival/" title=""&gt;Check if it is possible to survive on Island&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-maximum-meetings-in-one-room/" title=""&gt;Find maximum meetings in one room&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/maximum-product-subset-array/" title=""&gt;Maximum product subset of an array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/maximize-sum-after-k-negations/0" title=""&gt;Maximize array sum after K negations&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/maximize-arrii-of-an-array/0" title=""&gt;Maximize the sum of arr[i]*i&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/maximum-sum-absolute-difference-array/" title=""&gt;Maximum sum of absolute difference of an array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/swap-and-maximize/0" title=""&gt;Maximize sum of consecutive differences in a circular array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/minimum-sum-absolute-difference-pairs-two-arrays/#:~:text=It%20consists%20of%20two%20steps,result%20to%20the%20sum%20S." title=""&gt;Minimum sum of absolute difference of pairs of two arrays&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/program-for-shortest-job-first-or-sjf-cpu-scheduling-set-1-non-preemptive/" title=""&gt;Program for Shortest Job First (or SJF) CPU Scheduling&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/page-faults-in-lru/0" title=""&gt;Program for Least Recently Used (LRU) Page Replacement algorithm&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/smallest-subset-sum-greater-elements/" title=""&gt;Smallest subset with sum greater than all other elements&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0" title=""&gt;Chocolate Distribution Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/DEFKIN/" title=""&gt;DEFKIN -Defense of a Kingdom&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/DIEHARD/" title=""&gt;DIEHARD -DIE HARD&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/GERGOVIA/" title=""&gt;GERGOVIA -Wine trading in Gergovia&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/GCJ101BB/" title=""&gt;Picking Up Chicks&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/CHOCOLA/" title=""&gt;CHOCOLA –Chocolate&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.spoj.com/problems/ARRANGE/" title=""&gt;ARRANGE -Arranging Amplifiers&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/k-centers-problem-set-1-greedy-approximate-algorithm/" title=""&gt;K Centers Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0" title=""&gt;Minimum Cost of ropes&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/smallest-number5829/1" title=""&gt;Find smallest number with given number of digits and sum of digits&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/rearrange-characters/0" title=""&gt;Rearrange characters in a string such that no two adjacent are same&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Greedy&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-maximum-sum-possible-equal-sum-three-stacks/" title=""&gt;Find maximum sum possible equal sum of three stacks&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1" title=""&gt;Rat in a maze Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/printing-solutions-n-queen-problem/" title=""&gt;Printing all solutions in N-Queen Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/word-break-part-2/0" title=""&gt;Word Break Problem using Backtracking&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/remove-invalid-parentheses/" title=""&gt;Remove Invalid Parentheses&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/solve-the-sudoku/0" title=""&gt;Sudoku Solver&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/m-coloring-problem/0" title=""&gt;m Coloring Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/given-a-string-print-all-possible-palindromic-partition/" title=""&gt;Print all palindromic partitions of a string&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1" title=""&gt;Subset Sum Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/the-knights-tour-problem-backtracking-1/" title=""&gt;The Knight’s tour problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/tug-of-war/" title=""&gt;Tug of War&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-shortest-safe-route-in-a-path-with-landmines/" title=""&gt;Find shortest safe route in a path with landmines&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/combination-sum/0" title=""&gt;Combinational Sum&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/largest-number-in-k-swaps/0" title=""&gt;Find Maximum number possible by doing at-most K swaps&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string/0" title=""&gt;Print all permutations of a string &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-if-there-is-a-path-of-more-than-k-length-from-a-source/" title=""&gt;Find if there is a path of more than k length from a source&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/longest-possible-route-in-a-matrix-with-hurdles/" title=""&gt;Longest Possible Route in a Matrix with Hurdles&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/print-all-possible-paths-from-top-left-to-bottom-right-of-a-mxn-matrix/" title=""&gt;Print all possible paths from top left to bottom right of a mXn matrix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/partition-array-to-k-subsets/1" title=""&gt;Partition of a set intoK subsets with equal sum&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;BackTracking&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-the-k-th-permutation-sequence-of-first-n-natural-numbers/" title=""&gt;Find the K-th Permutation Sequence of first N natural numbers&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.tutorialspoint.com/javaexamples/data_stack.htm" title=""&gt; Implement Stack from Scratch&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/queue-set-1introduction-and-array-implementation/" title=""&gt; Implement Queue from Scratch&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/implement-two-stacks-in-an-array/1" title=""&gt;Implement 2 stack in an array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/design-a-stack-with-find-middle-operation/" title=""&gt;find the middle element of a stack&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/efficiently-implement-k-stacks-single-array/" title=""&gt;Implement "N" stacks in an Array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/parenthesis-checker/0" title=""&gt;Check the expression has valid or Balanced parenthesis or not.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/reverse-a-string-using-stack/1" title=""&gt;Reverse a String using Stack&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/special-stack/1" title=""&gt;Design a Stack that supports getMin() in O(1) time and O(1) extra space.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/next-larger-element/0" title=""&gt;Find the next Greater element&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/the-celebrity-problem/1" title=""&gt;The celebrity Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/arithmetic-expression-evalution/#:~:text=The%20stack%20organization%20is%20very,i.e.%2C%20A%20%2B%20B)." title=""&gt;Arithmetic Expression evaluation&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/evaluation-of-postfix-expression/0" title=""&gt;Evaluation of Postfix expression&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://stackoverflow.com/questions/45130465/inserting-at-the-end-of-stack" title=""&gt;Implement a method to insert an element at its bottom without using any other data structure.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/reverse-a-stack-using-recursion/" title=""&gt;Reverse a stack using recursion&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/sort-a-stack/1" title=""&gt;Sort a Stack using recursion&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/overlapping-intervals/0" title=""&gt;Merge Overlapping Intervals&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/maximum-rectangular-area-in-a-histogram/0" title=""&gt;Largest rectangular Area in Histogram&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/valid-substring0624/1" title=""&gt;Length of the Longest Valid Substring&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/expression-contains-redundant-bracket-not/" title=""&gt;Expression contains redundant bracket or not&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/stack-using-two-queues/1" title=""&gt;Implement Stack using Queue&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/implement-stack-queue-using-deque/" title=""&gt;Implement Stack using Deque&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/stack-permutations-check-if-an-array-is-stack-permutation-of-other/" title=""&gt;Stack Permutations (Check if an array is stack permutation of other)&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/queue-using-two-stacks/1" title=""&gt;Implement Queue using Stack  &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/efficiently-implement-k-queues-single-array/" title=""&gt;Implement "n" queue in an array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/circular-queue-set-1-introduction-array-implementation/" title=""&gt;Implement a Circular queue&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/lru-cache/1" title=""&gt;LRU Cache Implementationa&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/queue-reversal/1" title=""&gt;Reverse a Queue using recursion&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/reverse-first-k-elements-of-queue/1" title=""&gt;Reverse the first “K” elements of a queue&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/interleave-first-half-queue-second-half/" title=""&gt;Interleave the first half of the queue with second half&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/circular-tour/1" title=""&gt;Find the first circular tour that visits all Petrol Pumps&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/rotten-oranges/0" title=""&gt;Minimum time required to rot all oranges&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/distance-of-nearest-cell-having-1/0" title=""&gt;Distance of nearest cell having 1 in a binary matrix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/first-negative-integer-in-every-window-of-size-k/0" title=""&gt;First negative integer in every window of size “k”&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/check-if-all-levels-of-two-trees-are-anagrams-or-not/" title=""&gt;Check if all levels of two trees are anagrams or not.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/sum-minimum-maximum-elements-subarrays-size-k/" title=""&gt;Sum of minimum and maximum elements of all subarrays of size “k”.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/game-with-string/0" title=""&gt;Minimum sum of squares of character counts in a given string after removing “k” characters.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0" title=""&gt;Queue based approach or first non-repeating character in a stream.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Stacks &amp;amp; Queues&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/next-smaller-element/" title=""&gt;Next Smaller Element&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/building-heap-from-array/" title=""&gt;Implement a Maxheap/MinHeap using arrays and recursion.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/heap-sort/" title=""&gt;Sort an Array using heap. (HeapSort)&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/" title=""&gt;Maximum of all subarrays of size k.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/k-largest-elements4206/1" title=""&gt;“k” largest element in an array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/kth-smallestlargest-element-unsorted-array/" title=""&gt;Kth smallest and largest element in an unsorted array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/merge-k-sorted-arrays/1" title=""&gt;Merge “K” sorted arrays. [ IMP ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/merge-two-binary-max-heap/0" title=""&gt;Merge 2 Binary Max Heaps&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/k-th-largest-sum-contiguous-subarray/" title=""&gt;Kth largest sum continuous subarrays&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/reorganize-string/" title=""&gt;Leetcode- reorganize strings&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1" title=""&gt;Merge “K” Sorted Linked Lists [V.IMP]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/find-smallest-range-containing-elements-from-k-lists/1" title=""&gt;Smallest range in “K” Lists&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0" title=""&gt;Median in a stream of Integers&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/is-binary-tree-heap/1" title=""&gt;Check if a Binary Tree is Heap&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0" title=""&gt;Connect “n” ropes with minimum cost&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/convert-bst-min-heap/" title=""&gt;Convert BST to Min Heap&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/convert-min-heap-to-max-heap/" title=""&gt;Convert min heap to max heap&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/rearrange-characters/0" title=""&gt;Rearrange characters in a string such that no two adjacent are same.&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Heap&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-sum4058/1" title=""&gt;Minimum sum of two numbers formed from digits of an array&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://1drv.ms/t/s!AqTOHFO77CqEiRua06v1PATyiFg5" title=""&gt;Create a Graph, print it&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1" title=""&gt;Implement BFS algorithm &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/" title=""&gt;Implement DFS Algo &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/detect-cycle-in-a-graph/" title=""&gt;Detect Cycle in Directed Graph using BFS/DFS Algo &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1" title=""&gt;Detect Cycle in UnDirected Graph using BFS/DFS Algo &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1" title=""&gt;Search in a Maze&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/steps-by-knight/0" title=""&gt;Minimum Step by Knight&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/flood-fill/" title=""&gt;flood fill algo&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/clone-graph/" title=""&gt;Clone a graph&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/number-of-operations-to-make-network-connected/" title=""&gt;Making wired Connections&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/word-ladder/" title=""&gt;word Ladder &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/" title=""&gt;Dijkstra algo&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/topological-sort/1" title=""&gt;Implement Topological Sort &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/minimum-time-taken-by-each-job-to-be-completed-given-by-a-directed-acyclic-graph/" title=""&gt;Minimum time taken by each job to be completed given by a Directed Acyclic Graph&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-whether-it-is-possible-to-finish-all-tasks-or-not-from-given-dependencies/" title=""&gt;Find whether it is possible to finish all tasks or not from given dependencies&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/find-the-number-of-islands/1" title=""&gt;Find the no. of Isalnds&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/alien-dictionary/1" title=""&gt;Given a sorted Dictionary of an Alien Language, find order of characters&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/" title=""&gt;Implement Kruksal’sAlgorithm&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/" title=""&gt;Implement Prim’s Algorithm&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/total-number-spanning-trees-graph/" title=""&gt;Total no. of Spanning tree in a graph&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/negative-weight-cycle/0" title=""&gt;Implement Bellman Ford Algorithm&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/implementing-floyd-warshall/0" title=""&gt;Implement Floyd warshallAlgorithm&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/" title=""&gt;Travelling Salesman Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/graph-coloring-applications/#:~:text=Graph%20coloring%20problem%20is%20to,are%20colored%20using%20same%20color." title=""&gt;Graph ColouringProblem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/snakes-and-ladders/" title=""&gt;Snake and Ladders Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/bridge-in-a-graph/" title=""&gt;Find bridge in a graph&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1" title=""&gt;Count Strongly connected Components(Kosaraju Algo)&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/bipartite-graph/" title=""&gt;Check whether a graph is Bipartite or Not&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/detect-negative-cycle-graph-bellman-ford/" title=""&gt;Detect Negative cycle in a graph&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-longest-path-directed-acyclic-graph/" title=""&gt;Longest path in a Directed Acyclic Graph&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.hackerrank.com/challenges/journey-to-the-moon/problem" title=""&gt;Journey to the Moon&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/cheapest-flights-within-k-stops/description/" title=""&gt;Cheapest Flights Within K Stops&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.hackerearth.com/practice/algorithms/graphs/topological-sort/practice-problems/algorithm/oliver-and-the-game-3/" title=""&gt;Oliver and the Game&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/water-jug-problem-using-bfs/" title=""&gt;Water Jug problem using BFS&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/water-jug-problem-using-bfs/" title=""&gt;Water Jug problem using BFS&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-if-there-is-a-path-of-more-than-k-length-from-a-source/" title=""&gt;Find if there is a path of more thank length from a source&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/m-coloring-problem/0" title=""&gt;M-ColouringProblem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/minimum-edges-reverse-make-path-source-destination/" title=""&gt;Minimum edges to reverse o make path from source to destination&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/paths-travel-nodes-using-edgeseven-bridges-konigsberg/" title=""&gt;Paths to travel each nodes using each edge(Seven Bridges)&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/vertex-cover-problem-set-1-introduction-approximate-algorithm-2/" title=""&gt;Vertex Cover Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/chinese-postman-route-inspection-set-1-introduction/" title=""&gt;Chinese Postman or Route Inspection&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/number-of-triangles-in-directed-and-undirected-graphs/" title=""&gt;Number of Triangles in a Directed and Undirected Graph&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/" title=""&gt;Minimise the cashflow among a given set of friends who have borrowed money from each other&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Graph&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/two-clique-problem-check-graph-can-divided-two-cliques/" title=""&gt;Two Clique Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Trie&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/trie-insert-and-search/" title=""&gt;Construct a trie from scratch&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Trie&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/find-all-shortest-unique-prefixes-to-represent-each-word-in-a-given-list/" title=""&gt;Find shortest unique prefix for every word in a given list&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Trie&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/word-break-problem-trie-solution/" title=""&gt;Word Break Problem | (Trie solution)&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Trie&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/k-anagrams-1/0" title=""&gt;Given a sequence of words, print all anagrams together&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Trie&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/phone-directory/0" title=""&gt;Implement a Phone Directory&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Trie&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/unique-rows-in-boolean-matrix/1" title=""&gt;Print unique rows in a given boolean matrix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/coin-change2448/1" title=""&gt;Coin ChangeProblem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/0-1-knapsack-problem/0" title=""&gt;Knapsack Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/ncr1019/1" title=""&gt;Binomial CoefficientProblem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/permutation-coefficient/" title=""&gt;Permutation CoefficientProblem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/program-nth-catalan-number/" title=""&gt;Program for nth Catalan Number&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/matrix-chain-multiplication-dp-8/" title=""&gt;Matrix Chain Multiplication &lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/edit-distance3702/1" title=""&gt;Edit Distance&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1" title=""&gt;Subset Sum Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/friends-pairing-problem5425/1" title=""&gt;Friends Pairing Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/gold-mine-problem/" title=""&gt;Gold Mine Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/assembly-line-scheduling-dp-34/" title=""&gt;Assembly Line SchedulingProblem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/painting-the-fence3727/1" title=""&gt;Painting the Fenceproblem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/cutted-segments/0" title=""&gt;Maximize The Cut Segments&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-common-subsequence/0" title=""&gt;Longest Common Subsequence&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-repeating-subsequence/0" title=""&gt;Longest Repeated Subsequence&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-increasing-subsequence/0" title=""&gt;Longest Increasing Subsequence&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/space-optimized-solution-lcs/" title=""&gt;Space Optimized Solution of LCS&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/lcs-of-three-strings/0" title=""&gt;LCS (Longest Common Subsequence) of three strings&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/maximum-sum-increasing-subsequence4749/1" title=""&gt;Maximum Sum Increasing Subsequence&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/count-subsequences-product-less-k/" title=""&gt;Count all subsequences having product less than K&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-subsequence-such-that-difference-between-adjacents-is-one4724/1" title=""&gt;Longest subsequence such that difference between adjacent is one&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/maximum-subsequence-sum-such-that-no-three-are-consecutive/" title=""&gt;Maximum subsequence sum such that no three are consecutive&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/egg-dropping-puzzle/0" title=""&gt;Egg Dropping Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/max-length-chain/1" title=""&gt;Maximum Length Chain of Pairs&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/largest-square-formed-in-a-matrix/0" title=""&gt;Maximum size square sub-matrix with all 1s&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/pairs-with-specific-difference/0" title=""&gt;Maximum sum of pairs with specific difference&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/path-in-matrix3805/1" title=""&gt;Min Cost PathProblem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/maximum-difference-of-zeros-and-ones-in-binary-string4111/1" title=""&gt;Maximum difference of zeros and ones in binary string&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps/0" title=""&gt;Minimum number of jumps to reach end&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/minimum-cost-to-fill-given-weight-in-a-bag1956/1" title=""&gt;Minimum cost to fill given weight in a bag&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/minimum-removals-array-make-max-min-k/" title=""&gt;Minimum removals from array to make max –min &amp;lt;= K&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-common-substring/0" title=""&gt;Longest Common Substring&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/reach-a-given-score/0" title=""&gt;Count number of ways to reacha given score in a game&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/bbt-counter/0" title=""&gt;Count Balanced Binary Trees of Height h&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0" title=""&gt;LargestSum Contiguous Subarray [V&amp;gt;V&amp;gt;V&amp;gt;V IMP ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/smallest-sum-contiguous-subarray/" title=""&gt;Smallest sum contiguous subarray&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/knapsack-with-duplicate-items4201/1" title=""&gt;Unbounded Knapsack (Repetition of items allowed)&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/word-break/0" title=""&gt;Word Break Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/largest-independent-set-problem-dp-26/" title=""&gt;Largest Independent Set Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1" title=""&gt;Partition problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" title=""&gt;Longest Palindromic Subsequence&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/count-palindromic-subsequences/1" title=""&gt;Count All Palindromic Subsequence in a given String&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/longest-palindromic-substring/" title=""&gt;Longest Palindromic Substring&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/longest-alternating-subsequence/0" title=""&gt;Longest alternating subsequence&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/weighted-job-scheduling/" title=""&gt;Weighted Job Scheduling&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/coin-game-winner-every-player-three-choices/" title=""&gt;Coin game winner where every player has three choices&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/count-derangements-permutation-such-that-no-element-appears-in-its-original-position/" title=""&gt;Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/maximum-profit-by-buying-and-selling-a-share-at-most-twice/" title=""&gt;Maximum profit by buying and selling a share at most twice [ IMP ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/optimal-strategy-for-a-game/0" title=""&gt;Optimal Strategy for a Game&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/optimal-binary-search-tree-dp-24/" title=""&gt;Optimal Binary Search Tree&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/palindromic-patitioning4845/1" title=""&gt;Palindrome PartitioningProblem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/word-wrap/0" title=""&gt;Word Wrap Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/mobile-numeric-keypad5456/1" title=""&gt;Mobile Numeric Keypad Problem [ IMP ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/boolean-parenthesization/0" title=""&gt;Boolean Parenthesization Problem&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/largest-rectangular-sub-matrix-whose-sum-0/" title=""&gt;Largest rectangular sub-matrix whose sum is 0&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/largest-area-rectangular-sub-matrix-equal-number-1s-0s/" title=""&gt;Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ]&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/maximum-sum-rectangle/0" title=""&gt;Maximum sum rectangle in a 2D matrix&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/maximum-profit4657/1" title=""&gt;Maximum profit by buying and selling a share at most k times&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/interleaved-strings/1" title=""&gt;Find if a string is interleaved of two other strings&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Dynamic Programming&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://leetcode.com/problems/maximum-length-of-pair-chain/" title=""&gt;Maximum Length of Pair Chain&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt; &lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
            &lt;td&gt;&lt;/td&gt;
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Bit Manipulation&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/set-bits0143/1" title=""&gt;Count set bits in an integer&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Bit Manipulation&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/finding-the-numbers0215/1" title=""&gt;Find the two non-repeating elements in an array of repeating elements&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Bit Manipulation&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/bit-difference/0" title=""&gt;Count number of bits to be flipped to convert A to B&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Bit Manipulation&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/count-total-set-bits/0" title=""&gt;Count total set bits in all numbers from 1 to n&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Bit Manipulation&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/power-of-2/0" title=""&gt;Program to find whether a no is power of two&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Bit Manipulation&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/find-position-of-set-bit3706/1" title=""&gt;Find position of the only set bit&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Bit Manipulation&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/copy-set-bits-in-a-range/" title=""&gt;Copy set bits in a range&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Bit Manipulation&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/divide-two-integers-without-using-multiplication-division-mod-operator/" title=""&gt;Divide two integers without using multiplication, division and mod operator&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Bit Manipulation&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://www.geeksforgeeks.org/calculate-square-of-a-number-without-using-and-pow/#:~:text=Given%20an%20integer%20n%2C%20calculate,*%2C%20%2F%20and%20pow().&amp;amp;text=A%20Simple%20Solution%20is%20to%20repeatedly%20add%20n%20to%20result." title=""&gt;Calculate square of a number without using *, / and pow()&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
          &lt;tr&gt;
            &lt;td&gt;Bit Manipulation&lt;/td&gt;
            &lt;td&gt;&lt;a href="https://practice.geeksforgeeks.org/problems/power-set4302/1" title=""&gt;Power Set&lt;/a&gt;&lt;/td&gt;
            
          &lt;/tr&gt;
        &lt;/tbody&gt;
    &lt;/table&gt;&lt;/div&gt;

</description>
      <category>algorithms</category>
      <category>java</category>
      <category>programming</category>
      <category>cpp</category>
    </item>
  </channel>
</rss>
