Complete Data Structures and Algorithms Questions in sequence || DS & Algo Questions for Practice of all  types
Tags: algorithms, java, programming, cpp
Published: 2021-02-07 09:41:33


<p>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</p>







<table border="0" cellpadding="0" cellspacing="0" id="sheet0" class="sheet0 gridlines">
        <col class="col0">
        <col class="col1">
        <col class="col2">
        <tbody>
          
          <tr class="row3">
            <td class="column0 style2 s">Topic</td>
            <td class="column1 style2 s">Problems </td>
          </tr>
          <tr class="row4">
          </tr>
          <tr class="row5">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/write-a-program-to-reverse-an-array-or-string/" title="">Reverse the array</a></td>
            
          </tr>
          <tr class="row6">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/maximum-and-minimum-in-an-array/" title="">Find the maximum and minimum element in an array</a></td>
            
          </tr>
          <tr class="row7">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/kth-smallest-element/0" title="">Find the &quot;Kth&quot; max and min element of an array </a></td>
            
          </tr>
          <tr class="row8">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s/0" title="">Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo</a></td>
            
          </tr>
          <tr class="row9">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/move-negative-numbers-beginning-positive-end-constant-extra-space/" title="">Move all the negative elements to one side of the array </a></td>
            
          </tr>
          <tr class="row10">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/union-of-two-arrays/0" title="">Find the Union and Intersection of the two sorted arrays.</a></td>
            
          </tr>
          <tr class="row11">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/cyclically-rotate-an-array-by-one/0" title="">Write a program to cyclically rotate an array by one.</a></td>
            
          </tr>
          <tr class="row12">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0" title="">find Largest sum contiguous Subarray [V. IMP]</a></td>
            
          </tr>
          <tr class="row13">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimize-the-heights3351/1" title="">Minimise the maximum difference between heights [V.IMP]</a></td>
            
          </tr>
          <tr class="row14">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps/0" title="">Minimum no. of Jumps to reach end of an array</a></td>
            
          </tr>
          <tr class="row15">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/find-the-duplicate-number/" title="">find duplicate in an array of N+1 Integers</a></td>
            
          </tr>
          <tr class="row16">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1" title="">Merge 2 sorted arrays without using Extra space.</a></td>
            
          </tr>
          <tr class="row17">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0" title="">Kadane's Algo [V.V.V.V.V IMP]</a></td>
            
          </tr>
          <tr class="row18">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/merge-intervals/" title="">Merge Intervals</a></td>
            
          </tr>
          <tr class="row19">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/next-permutation/" title="">Next Permutation</a></td>
            
          </tr>
          <tr class="row20">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/inversion-of-array/0" title="">Count Inversion</a></td>
            
          </tr>
          <tr class="row21">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock/" title="">Best time to buy and Sell stock</a></td>
            
          </tr>
          <tr class="row22">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/count-pairs-with-given-sum5022/1" title="">find all pairs on integer array whose sum is equal to given number</a></td>
            
          </tr>
          <tr class="row23">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/common-elements1132/1" title="">find common elements In 3 sorted arrays</a></td>
            
          </tr>
          <tr class="row24">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/rearrange-array-alternating-positive-negative-items-o1-extra-space/" title="">Rearrange the array in alternating positive and negative items with O(1) extra space</a></td>
            
          </tr>
          <tr class="row25">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/subarray-with-0-sum/0" title="">Find if there is any subarray with sum equal to 0</a></td>
            
          </tr>
          <tr class="row26">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/factorials-of-large-numbers/0" title="">Find factorial of a large number</a></td>
            
          </tr>
          <tr class="row27">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/maximum-product-subarray3604/1" title="">find maximum product subarray </a></td>
            
          </tr>
          <tr class="row28">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence/0" title="">Find longest coinsecutive subsequence</a></td>
            
          </tr>
          <tr class="row29">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times/" title="">Given an array of size n and a number k, fin all elements that appear more than &quot; n/k &quot; times.</a></td>
            
          </tr>
          <tr class="row30">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/maximum-profit-by-buying-and-selling-a-share-at-most-twice/" title="">Maximum profit by buying and selling a share atmost twice</a></td>
            
          </tr>
          <tr class="row31">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/array-subset-of-another-array/0" title="">Find whether an array is a subset of another array</a></td>
            
          </tr>
          <tr class="row32">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/triplet-sum-in-array/0" title="">Find the triplet that sum to a given value</a></td>
            
          </tr>
          <tr class="row33">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/trapping-rain-water/0" title="">Trapping Rain water problem</a></td>
            
          </tr>
          <tr class="row34">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0" title="">Chocolate Distribution problem</a></td>
            
          </tr>
          <tr class="row35">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/smallest-subarray-with-sum-greater-than-x/0" title="">Smallest Subarray with sum greater than a given value</a></td>
            
          </tr>
          <tr class="row36">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/three-way-partitioning/1" title="">Three way partitioning of an array around a given value</a></td>
            
          </tr>
          <tr class="row37">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-swaps-required-to-bring-all-elements-less-than-or-equal-to-k-together/0" title="">Minimum swaps required bring elements less equal K together</a></td>
            
          </tr>
          <tr class="row38">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/palindromic-array/0" title="">Minimum no. of operations required to make an array palindrome</a></td>
            
          </tr>
          <tr class="row39">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/find-the-median0527/1" title="">Median of 2 sorted arrays of equal size</a></td>
            
          </tr>
          <tr class="row40">
            <td class="column0 style5 s">Array</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/median-of-two-sorted-arrays-of-different-sizes/" title="">Median of 2 sorted arrays of different size</a></td>
            
          </tr>
          <tr class="row41">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            
          </tr>
          <tr class="row42">
            <td class="column0 style5 null"></td>
            <td class="column1 style7 null"></td>
            
          </tr>
          <tr class="row43">
            <td class="column0 style8 s">Matrix</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix/0" title="">Spiral traversal on a Matrix</a></td>
            
          </tr>
          <tr class="row44">
            <td class="column0 style8 s">Matrix</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/search-a-2d-matrix/" title="">Search an element in a matriix</a></td>
            
          </tr>
          <tr class="row45">
            <td class="column0 style8 s">Matrix</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/median-in-a-row-wise-sorted-matrix1527/1" title="">Find median in a row wise sorted matrix</a></td>
            
          </tr>
          <tr class="row46">
            <td class="column0 style8 s">Matrix</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/row-with-max-1s0023/1" title="">Find row with maximum no. of 1's</a></td>
            
          </tr>
          <tr class="row47">
            <td class="column0 style8 s">Matrix</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/sorted-matrix/0" title="">Print elements in sorted order using row-column wise sorted matrix</a></td>
            
          </tr>
          <tr class="row48">
            <td class="column0 style8 s">Matrix</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/max-rectangle/1" title="">Maximum size rectangle</a></td>
            
          </tr>
          <tr class="row49">
            <td class="column0 style8 s">Matrix</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-a-specific-pair-in-matrix/" title="">Find a specific pair in matrix</a></td>
            
          </tr>
          <tr class="row50">
            <td class="column0 style8 s">Matrix</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/rotate-a-matrix-by-90-degree-in-clockwise-direction-without-using-any-extra-space/" title="">Rotate matrix by 90 degrees</a></td>
            
          </tr>
          <tr class="row51">
            <td class="column0 style8 s">Matrix</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/kth-element-in-matrix/1" title="">Kth smallest element in a row-cpumn wise sorted matrix</a></td>
            
          </tr>
          <tr class="row52">
            <td class="column0 style8 s">Matrix</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/common-elements-in-all-rows-of-a-given-matrix/" title="">Common elements in all rows of a given matrix</a></td>
            
          </tr>
          <tr class="row53">
            <td class="column0">&nbsp;</td>
            <td class="column1">&nbsp;</td>
            <td class="column2">&nbsp;</td>
          </tr>
          <tr class="row54">
            <td class="column0 style5 null"></td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row55">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/reverse-string/" title="">Reverse a String</a></td>
            
          </tr>
          <tr class="row56">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/palindrome-string0817/1" title="">Check whether a String is Palindrome or not</a></td>
            
          </tr>
          <tr class="row57">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/" title="">Find Duplicate characters in a string</a></td>
            
          </tr>
          <tr class="row58">
            <td class="column0 style5 s">String</td>
            <td class="column1 style7 s">Why strings are immutable in Java?</td>
            
          </tr>
          <tr class="row59">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/" title="">Write a Code to check whether one string is a rotation of another</a></td>
            
          </tr>
          <tr class="row60">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.programiz.com/java-programming/examples/check-valid-shuffle-of-strings" title="">Write a Program to check whether a string is a valid shuffle of two strings or not</a></td>
            
          </tr>
          <tr class="row61">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/count-and-say/" title="">Count and Say problem</a></td>
            
          </tr>
          <tr class="row62">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-palindrome-in-a-string/0" title="">Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring]</a></td>
            
          </tr>
          <tr class="row63">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-repeating-subsequence/0" title="">Find Longest Recurring Subsequence in String</a></td>
            
          </tr>
          <tr class="row64">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/print-subsequences-string/" title="">Print all Subsequences of a string.</a></td>
            
          </tr>
          <tr class="row65">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string/0" title="">Print all the permutations of the given string</a></td>
            
          </tr>
          <tr class="row66">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/split-the-binary-string-into-substrings-with-equal-number-of-0s-and-1s/" title="">Split the Binary string into two substring with equal 0’s and 1’s</a></td>
            
          </tr>
          <tr class="row67">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/word-wrap/0" title="">Word Wrap Problem [VERY IMP].</a></td>
            
          </tr>
          <tr class="row68">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/edit-distance3702/1" title="">EDIT Distance [Very Imp]</a></td>
            
          </tr>
          <tr class="row69">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/next-permutation/0" title="">Find next greater number with same set of digits. [Very Very IMP]</a></td>
            
          </tr>
          <tr class="row70">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/parenthesis-checker/0" title="">Balanced Parenthesis problem.[Imp]</a></td>
            
          </tr>
          <tr class="row71">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/word-break/0" title="">Word break Problem[ Very Imp]</a></td>
            
          </tr>
          <tr class="row72">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/" title="">Rabin Karp Algo</a></td>
            
          </tr>
          <tr class="row73">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-prefix-suffix2527/1" title="">KMP Algo</a></td>
            
          </tr>
          <tr class="row74">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/convert-sentence-equivalent-mobile-numeric-keypad-sequence/" title="">Convert a Sentence into its equivalent mobile numeric keypad sequence.</a></td>
            
          </tr>
          <tr class="row75">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/count-the-reversals/0" title="">Minimum number of bracket reversals needed to make an expression balanced.</a></td>
            
          </tr>
          <tr class="row76">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/count-palindromic-subsequences/1" title="">Count All Palindromic Subsequence in a given String.</a></td>
            
          </tr>
          <tr class="row77">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-count-number-given-string-present-2d-character-array/" title="">Count of number of given string in 2D character array</a></td>
            
          </tr>
          <tr class="row78">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/find-the-string-in-grid/0" title="">Search a Word in a 2D Grid of characters.</a></td>
            
          </tr>
          <tr class="row79">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/" title="">Boyer Moore Algorithm for Pattern Searching.</a></td>
            
          </tr>
          <tr class="row80">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/roman-number-to-integer/0" title="">Converting Roman Numerals to Decimal</a></td>
            
          </tr>
          <tr class="row81">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/longest-common-prefix/" title="">Longest Common Prefix</a></td>
            
          </tr>
          <tr class="row82">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/min-number-of-flips/0" title="">Number of flips to make binary string alternate</a></td>
            
          </tr>
          <tr class="row83">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/second-most-repeated-string-in-a-sequence/0" title="">Find the first repeated word in string.</a></td>
            
          </tr>
          <tr class="row84">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-swaps-for-bracket-balancing/0" title="">Minimum number of swaps for bracket balancing.</a></td>
            
          </tr>
          <tr class="row85">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-common-subsequence/0" title="">Find the longest common subsequence between two strings.</a></td>
            
          </tr>
          <tr class="row86">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/program-generate-possible-valid-ip-addresses-given-string/" title="">Program to generate all possible valid IP addresses from given  string.</a></td>
            
          </tr>
          <tr class="row87">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/smallest-distant-window/0" title="">Write a program tofind the smallest window that contains all characters of string itself.</a></td>
            
          </tr>
          <tr class="row88">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/rearrange-characters/0" title="">Rearrange characters in a string such that no two adjacent are same</a></td>
            
          </tr>
          <tr class="row89">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/minimum-characters-added-front-make-string-palindrome/" title="">Minimum characters to be added at front to make string palindrome</a></td>
            
          </tr>
          <tr class="row90">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/k-anagrams-1/0" title="">Given a sequence of words, print all anagrams together</a></td>
            
          </tr>
          <tr class="row91">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0" title="">Find the smallest window in a string containing all characters of another string</a></td>
            
          </tr>
          <tr class="row92">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/consecutive-elements/0" title="">Recursively remove all adjacent duplicates</a></td>
            
          </tr>
          <tr class="row93">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/wildcard-string-matching/0" title="">String matching where one string contains wildcard characters</a></td>
            
          </tr>
          <tr class="row94">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/function-to-find-number-of-customers-who-could-not-get-a-computer/" title="">Function to find Number of customers who could not get a computer</a></td>
            
          </tr>
          <tr class="row95">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/transform-one-string-to-another-using-minimum-number-of-given-operation/" title="">Transform One String to Another using Minimum Number of Given Operation</a></td>
            
          </tr>
          <tr class="row96">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/isomorphic-strings/0" title="">Check if two given strings are isomorphic to each other</a></td>
            
          </tr>
          <tr class="row97">
            <td class="column0 style5 s">String</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/recursively-print-all-sentences-that-can-be-formed-from-list-of-word-lists/" title="">Recursively print all sentences that can be formed from list of word lists</a></td>
            
          </tr>
          <tr class="row98">
            <td class="column0">&nbsp;</td>
            <td class="column1">&nbsp;</td>
            <td class="column2">&nbsp;</td>
          </tr>
          <tr class="row99">
            <td class="column0 style8 null"></td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row100">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/first-and-last-occurrences-of-x/0" title="">Find first and last positions of an element in a sorted array</a></td>
            
          </tr>
          <tr class="row101">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/value-equal-to-index-value1330/1" title="">Find a Fixed Point (Value equal to index) in a given array</a></td>
            
          </tr>
          <tr class="row102">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/search-in-rotated-sorted-array/" title="">Search in a rotated sorted array</a></td>
            
          </tr>
          <tr class="row103">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/count-squares3649/1" title="">square root of an integer</a></td>
            
          </tr>
          <tr class="row104">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/middle-of-three2926/1" title="">Maximum and minimum of an array using minimum number of comparisons</a></td>
            
          </tr>
          <tr class="row105">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/optimum-location-point-minimize-total-distance/#:~:text=We%20need%20to%20find%20a,set%20of%20points%20is%20minimum.&amp;text=In%20above%20figure%20optimum%20location,is%20minimum%20obtainable%20total%20distance." title="">Optimum location of point to minimize total distance</a></td>
            
          </tr>
          <tr class="row106">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/find-missing-and-repeating2512/1" title="">Find the repeating and the missing</a></td>
            
          </tr>
          <tr class="row107">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/majority-element/0" title="">find majority element</a></td>
            
          </tr>
          <tr class="row108">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/searching-array-adjacent-differ-k/" title="">Searching in an array where adjacent differ by at most k</a></td>
            
          </tr>
          <tr class="row109">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/find-pair-given-difference/0" title="">find a pair with a given difference</a></td>
            
          </tr>
          <tr class="row110">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/find-all-four-sum-numbers/0" title="">find four elements that sum to a given value</a></td>
            
          </tr>
          <tr class="row111">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/stickler-theif/0" title="">maximum sum such that no 2 elements are adjacent</a></td>
            
          </tr>
          <tr class="row112">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/count-triplets-with-sum-smaller-than-x5549/1" title="">Count triplet with sum smaller than a given value</a></td>
            
          </tr>
          <tr class="row113">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1" title="">merge 2 sorted arrays</a></td>
            
          </tr>
          <tr class="row114">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/zero-sum-subarrays/0" title="">print all subarrays with 0 sum</a></td>
            
          </tr>
          <tr class="row115">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/product-array-puzzle/0" title="">Product array Puzzle</a></td>
            
          </tr>
          <tr class="row116">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/sort-by-set-bit-count/0" title="">Sort array according to count of set bits</a></td>
            
          </tr>
          <tr class="row117">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-swaps/1" title="">minimum no. of swaps required to sort the array</a></td>
            
          </tr>
          <tr class="row118">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/bishu-and-soldiers/" title="">Bishu and Soldiers</a></td>
            
          </tr>
          <tr class="row119">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/rasta-and-kheshtak/" title="">Rasta and Kheshtak</a></td>
            
          </tr>
          <tr class="row120">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/kth-smallest-number-again-2/" title="">Kth smallest number again</a></td>
            
          </tr>
          <tr class="row121">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="http://theoryofprogramming.com/2017/12/16/find-pivot-element-sorted-rotated-array/" title="">Find pivot element in a sorted array</a></td>
            
          </tr>
          <tr class="row122">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/k-th-element-of-two-sorted-array/0" title="">K-th Element of Two Sorted Arrays</a></td>
            
          </tr>
          <tr class="row123">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/AGGRCOW/" title="">Aggressive cows</a></td>
            
          </tr>
          <tr class="row124">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages/0" title="">Book Allocation Problem</a></td>
            
          </tr>
          <tr class="row125">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/EKO/" title="">EKOSPOJ:</a></td>
            
          </tr>
          <tr class="row126">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/weighted-job-scheduling-log-n-time/" title="">Job Scheduling Algo</a></td>
            
          </tr>
          <tr class="row127">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/arithmetic-number/0" title="">Missing Number in AP</a></td>
            
          </tr>
          <tr class="row128">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/smallest-factorial-number5929/1" title="">Smallest number with atleastn trailing zeroes infactorial</a></td>
            
          </tr>
          <tr class="row129">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages/0" title="">Painters Partition Problem:</a></td>
            
          </tr>
          <tr class="row130">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/PRATA/" title="">ROTI-Prata SPOJ</a></td>
            
          </tr>
          <tr class="row131">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/ANARC05B/" title="">DoubleHelix SPOJ</a></td>
            
          </tr>
          <tr class="row132">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/SUBSUMS/" title="">Subset Sums</a></td>
            
          </tr>
          <tr class="row133">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/inversion-of-array/0" title="">Findthe inversion count</a></td>
            
          </tr>
          <tr class="row134">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/in-place-merge-sort/" title="">Implement Merge-sort in-place</a></td>
            
          </tr>
          <tr class="row135">
            <td class="column0 style5 s">Searching &amp; Sorting</td>
            <td class="column1 style6 s"><a href="https://www.baeldung.com/java-sorting-arrays-with-repeated-entries" title="">Partitioning and Sorting Arrays with Many Repeated Entries</a></td>
            
          </tr>
          <tr class="row136">
            <td class="column0">&nbsp;</td>
            <td class="column1">&nbsp;</td>
            <td class="column2">&nbsp;</td>
          </tr>
          <tr class="row137">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row138">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/reverse-a-linked-list/" title="">Write a Program to reverse the Linked List. (Both Iterative and recursive)</a></td>
            
          </tr>
          <tr class="row139">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1" title="">Reverse a Linked List in group of Given Size. [Very Imp]</a></td>
            
          </tr>
          <tr class="row140">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/detect-loop-in-linked-list/1" title="">Write a program to Detect loop in a linked list.</a></td>
            
          </tr>
          <tr class="row141">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/remove-loop-in-linked-list/1" title="">Write a program to Delete loop in a linked list.</a></td>
            
          </tr>
          <tr class="row142">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-first-node-of-loop-in-a-linked-list/" title="">Find the starting point of the loop. </a></td>
            
          </tr>
          <tr class="row143">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/remove-duplicate-element-from-sorted-linked-list/1" title="">Remove Duplicates in a sorted Linked List.</a></td>
            
          </tr>
          <tr class="row144">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/remove-duplicates-from-an-unsorted-linked-list/1" title="">Remove Duplicates in a Un-sorted Linked List.</a></td>
            
          </tr>
          <tr class="row145">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/move-last-element-to-front-of-a-given-linked-list/" title="">Write a Program to Move the last element to Front in a Linked List.</a></td>
            
          </tr>
          <tr class="row146">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/add-1-to-a-number-represented-as-linked-list/1" title="">Add “1” to a number represented as a Linked List.</a></td>
            
          </tr>
          <tr class="row147">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1" title="">Add two numbers represented by linked lists.</a></td>
            
          </tr>
          <tr class="row148">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/1" title="">Intersection of two Sorted Linked List.</a></td>
            
          </tr>
          <tr class="row149">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1" title="">Intersection Point of two Linked Lists.</a></td>
            
          </tr>
          <tr class="row150">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/sort-a-linked-list/1" title="">Merge Sort For Linked lists.[Very Important]</a></td>
            
          </tr>
          <tr class="row151">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/quick-sort-on-linked-list/1" title="">Quicksort for Linked Lists.[Very Important]</a></td>
            
          </tr>
          <tr class="row152">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/middle-of-the-linked-list/" title="">Find the middle Element of a linked list.</a></td>
            
          </tr>
          <tr class="row153">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/circular-linked-list/1" title="">Check if a linked list is a circular linked list.</a></td>
            
          </tr>
          <tr class="row154">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/split-a-circular-linked-list-into-two-halves/1" title="">Split a Circular linked list into two halves.</a></td>
            
          </tr>
          <tr class="row155">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1" title="">Write a Program to check whether the Singly Linked list is a palindrome or not.</a></td>
            
          </tr>
          <tr class="row156">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/deletion-circular-linked-list/" title="">Deletion from a Circular Linked List.</a></td>
            
          </tr>
          <tr class="row157">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/reverse-a-doubly-linked-list/1" title="">Reverse a Doubly Linked list.</a></td>
            
          </tr>
          <tr class="row158">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-pairs-given-sum-doubly-linked-list/" title="">Find pairs with a given sum in a DLL.</a></td>
            
          </tr>
          <tr class="row159">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/count-triplets-sorted-doubly-linked-list-whose-sum-equal-given-value-x/" title="">Count triplets in a sorted DLL whose sum is equal to given value “X”.</a></td>
            
          </tr>
          <tr class="row160">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/sort-k-sorted-doubly-linked-list/" title="">Sort a “k”sorted Doubly Linked list.[Very IMP]</a></td>
            
          </tr>
          <tr class="row161">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/rotate-doubly-linked-list-n-nodes/" title="">Rotate DoublyLinked list by N nodes.</a></td>
            
          </tr>
          <tr class="row162">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/reverse-doubly-linked-list-groups-given-size/" title="">Rotate a Doubly Linked list in group of Given Size.[Very IMP]</a></td>
            
          </tr>
          <tr class="row163">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style7 s">Can we reverse a linked list in less than O(n) ?</td>
            
          </tr>
          <tr class="row164">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style7 s">Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ?</td>
            
          </tr>
          <tr class="row165">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/flattening-a-linked-list/1" title="">Flatten a Linked List</a></td>
            
          </tr>
          <tr class="row166">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/given-a-linked-list-of-0s-1s-and-2s-sort-it/1" title="">Sort a LL of 0's, 1's and 2's</a></td>
            
          </tr>
          <tr class="row167">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1" title="">Clone a linked list with next and random pointer</a></td>
            
          </tr>
          <tr class="row168">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1" title="">Merge K sorted Linked list</a></td>
            
          </tr>
          <tr class="row169">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/multiply-two-linked-lists/1" title="">Multiply 2 no. represented by LL</a></td>
            
          </tr>
          <tr class="row170">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/delete-nodes-having-greater-value-on-right/1" title="">Delete nodes which have a greater value on right side</a></td>
            
          </tr>
          <tr class="row171">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/segregate-even-and-odd-nodes-in-a-linked-list/0" title="">Segregate even and odd nodes in a Linked List</a></td>
            
          </tr>
          <tr class="row172">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1" title="">Program for n’th node from the end of a Linked List</a></td>
            
          </tr>
          <tr class="row173">
            <td class="column0 style8 s">LinkedList</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0" title="">Find the first non-repeating character from a stream of characters</a></td>
            
          </tr>
          <tr class="row174">
            <td class="column0">&nbsp;</td>
            <td class="column1">&nbsp;</td>
            <td class="column2">&nbsp;</td>
          </tr>
          <tr class="row175">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row176">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/level-order-traversal/1" title="">level order traversal</a></td>
            
          </tr>
          <tr class="row177">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/reverse-level-order-traversal/1" title="">Reverse Level Order traversal</a></td>
            
          </tr>
          <tr class="row178">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/height-of-binary-tree/1" title="">Height of a tree</a></td>
            
          </tr>
          <tr class="row179">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1" title="">Diameter of a tree</a></td>
            
          </tr>
          <tr class="row180">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/create-a-mirror-tree-from-the-given-binary-tree/" title="">Mirror of a tree</a></td>
            
          </tr>
          <tr class="row181">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/" title="">Inorder Traversal of a tree both using recursion and Iteration</a></td>
            
          </tr>
          <tr class="row182">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/" title="">Preorder Traversal of a tree both using recursion and Iteration</a></td>
            
          </tr>
          <tr class="row183">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/" title="">Postorder Traversal of a tree both using recursion and Iteration</a></td>
            
          </tr>
          <tr class="row184">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1" title="">Left View of a tree</a></td>
            
          </tr>
          <tr class="row185">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/right-view-of-binary-tree/1" title="">Right View of Tree</a></td>
            
          </tr>
          <tr class="row186">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1" title="">Top View of a tree</a></td>
            
          </tr>
          <tr class="row187">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1" title="">Bottom View of a tree</a></td>
            
          </tr>
          <tr class="row188">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/zigzag-tree-traversal/1" title="">Zig-Zag traversal of a binary tree</a></td>
            
          </tr>
          <tr class="row189">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/check-for-balanced-tree/1" title="">Check if a tree is balanced or not</a></td>
            
          </tr>
          <tr class="row190">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/diagonal-traversal-of-binary-tree/" title="">Diagnol Traversal of a Binary tree</a></td>
            
          </tr>
          <tr class="row191">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1" title="">Boundary traversal of a Binary tree</a></td>
            
          </tr>
          <tr class="row192">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/construct-binary-tree-string-bracket-representation/" title="">Construct Binary Tree from String with Bracket Representation</a></td>
            
          </tr>
          <tr class="row193">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1" title="">Convert Binary tree into Doubly Linked List</a></td>
            
          </tr>
          <tr class="row194">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/transform-to-sum-tree/1" title="">Convert Binary tree into Sum tree</a></td>
            
          </tr>
          <tr class="row195">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/construct-tree-1/1" title="">Construct Binary tree from Inorder and preorder traversal</a></td>
            
          </tr>
          <tr class="row196">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><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;text=Swap%201%3A%20Swap%20node%208,node%209%20with%20node%2010." title="">Find minimum swaps required to convert a Binary tree into BST</a></td>
            
          </tr>
          <tr class="row197">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/sum-tree/1" title="">Check if Binary tree is Sum tree or not</a></td>
            
          </tr>
          <tr class="row198">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/leaf-at-same-level/1" title="">Check if all leaf nodes are at same level or not</a></td>
            
          </tr>
          <tr class="row199">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/duplicate-subtree-in-binary-tree/1" title="">Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ]</a></td>
            
          </tr>
          <tr class="row200">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0" title="">Check if 2 trees are mirror or not</a></td>
            
          </tr>
          <tr class="row201">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/sum-of-the-longest-bloodline-of-a-tree/1" title="">Sum of Nodes on the Longest path from root to leaf node </a></td>
            
          </tr>
          <tr class="row202">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/check-given-graph-tree/#:~:text=Since%20the%20graph%20is%20undirected,graph%20is%20connected%2C%20otherwise%20not." title="">Check if given graph is tree or not.  [ IMP ]</a></td>
            
          </tr>
          <tr class="row203">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-largest-subtree-sum-tree/" title="">Find Largest subtree sum in a tree</a></td>
            
          </tr>
          <tr class="row204">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/maximum-sum-nodes-binary-tree-no-two-adjacent/" title="">Maximum Sum of nodes in Binary tree such that no two are adjacent </a></td>
            
          </tr>
          <tr class="row205">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/print-k-sum-paths-binary-tree/" title="">Print all &quot;K&quot; Sum paths in a Binary tree</a></td>
            
          </tr>
          <tr class="row206">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-binary-tree/1" title="">Find LCA in a Binary tree</a></td>
            
          </tr>
          <tr class="row207">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1" title="">Find distance between 2 nodes in a Binary tree</a></td>
            
          </tr>
          <tr class="row208">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/kth-ancestor-node-binary-tree-set-2/" title="">Kth Ancestor of node in a Binary tree</a></td>
            
          </tr>
          <tr class="row209">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/duplicate-subtrees/1" title="">Find all Duplicate subtrees in a Binary tree [ IMP ]</a></td>
            
          </tr>
          <tr class="row210">
            <td class="column0 style5 s">Binary Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/check-if-tree-is-isomorphic/1" title="">Tree Isomorphism Problem</a></td>
            
          </tr>
          <tr class="row211">
            <td class="column0 style8 null"></td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row212">
            <td class="column0 style8 null"></td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row213">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/binary-search-tree-set-1-search-and-insertion/" title="">Fina a value in a BST</a></td>
            
          </tr>
          <tr class="row214">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/delete-node-in-a-bst/" title="">Deletion of a node in a BST</a></td>
            
          </tr>
          <tr class="row215">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-element-in-bst/1" title="">Find min and max value in a BST</a></td>
            
          </tr>
          <tr class="row216">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/predecessor-and-successor/1" title="">Find inorder successor and inorder predecessor in a BST</a></td>
            
          </tr>
          <tr class="row217">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/check-for-bst/1" title="">Check if a tree is a BST or not </a></td>
            
          </tr>
          <tr class="row218">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/populate-inorder-successor-for-all-nodes/1" title="">Populate Inorder successor of all nodes</a></td>
            
          </tr>
          <tr class="row219">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style9 s"><a href="https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-bst/1" title="">Find LCA  of 2 nodes in a BST</a></td>
            
          </tr>
          <tr class="row220">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversa/" title="">Construct BST from preorder traversal</a></td>
            
          </tr>
          <tr class="row221">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/binary-tree-to-bst/1" title="">Convert Binary tree into BST</a></td>
            
          </tr>
          <tr class="row222">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/convert-normal-bst-balanced-bst/" title="">Convert a normal BST into a Balanced BST</a></td>
            
          </tr>
          <tr class="row223">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/merge-two-balanced-binary-search-trees/" title="">Merge two BST [ V.V.V&gt;IMP ]</a></td>
            
          </tr>
          <tr class="row224">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/kth-largest-element-in-bst/1" title="">Find Kth largest element in a BST</a></td>
            
          </tr>
          <tr class="row225">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/find-k-th-smallest-element-in-bst/1" title="">Find Kth smallest element in a BST</a></td>
            
          </tr>
          <tr class="row226">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/brothers-from-different-root/1" title="">Count pairs from 2 BST whose sum is equal to given value &quot;X&quot;</a></td>
            
          </tr>
          <tr class="row227">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-median-bst-time-o1-space/" title="">Find the median of BST in O(n) time and O(1) space</a></td>
            
          </tr>
          <tr class="row228">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1" title="">Count BST ndoes that lie in a given range</a></td>
            
          </tr>
          <tr class="row229">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/replace-every-element-with-the-least-greater-element-on-its-right/" title="">Replace every element with the least greater element on its right</a></td>
            
          </tr>
          <tr class="row230">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/given-n-appointments-find-conflicting-appointments/" title="">Given &quot;n&quot; appointments, find the conflicting appointments</a></td>
            
          </tr>
          <tr class="row231">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/preorder-to-postorder/0" title="">Check preorder is valid or not</a></td>
            
          </tr>
          <tr class="row232">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/check-whether-bst-contains-dead-end/1" title="">Check whether BST contains Dead end</a></td>
            
          </tr>
          <tr class="row233">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/largest-bst/1" title="">Largest BST in a Binary Tree [ V.V.V.V.V IMP ]</a></td>
            
          </tr>
          <tr class="row234">
            <td class="column0 style5 s">Binary Search Trees</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/flatten-bst-to-sorted-list-increasing-order/" title="">Flatten BST to sorted list</a></td>
            
          </tr>
          <tr class="row235">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row236">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row237">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/n-meetings-in-one-room/0" title="">Activity Selection Problem</a></td>
            
          </tr>
          <tr class="row238">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/job-sequencing-problem/0" title="">Job SequencingProblem</a></td>
            
          </tr>
          <tr class="row239">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/huffman-encoding/0" title="">Huffman Coding</a></td>
            
          </tr>
          <tr class="row240">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/water-connection-problem/0" title="">Water Connection Problem</a></td>
            
          </tr>
          <tr class="row241">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/fractional-knapsack/0" title="">Fractional Knapsack Problem</a></td>
            
          </tr>
          <tr class="row242">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/coin-piles/0" title="">Greedy Algorithm to find Minimum number of Coins</a></td>
            
          </tr>
          <tr class="row243">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/maximum-trains-stoppage-can-provided/" title="">Maximum trains for which stoppage can be provided</a></td>
            
          </tr>
          <tr class="row244">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-platforms/0" title="">Minimum Platforms Problem</a></td>
            
          </tr>
          <tr class="row245">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/buy-maximum-stocks-stocks-can-bought-th-day/" title="">Buy Maximum Stocks if i stocks can be bought on i-th day</a></td>
            
          </tr>
          <tr class="row246">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/shop-in-candy-store/0" title="">Find the minimum and maximum amount to buy all N candies</a></td>
            
          </tr>
          <tr class="row247">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/" title="">Minimize Cash Flow among a given set of friends who have borrowed money from each other</a></td>
            
          </tr>
          <tr class="row248">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/minimum-cost-cut-board-squares/" title="">Minimum Cost to cut a board into squares</a></td>
            
          </tr>
          <tr class="row249">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/survival/" title="">Check if it is possible to survive on Island</a></td>
            
          </tr>
          <tr class="row250">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-maximum-meetings-in-one-room/" title="">Find maximum meetings in one room</a></td>
            
          </tr>
          <tr class="row251">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/maximum-product-subset-array/" title="">Maximum product subset of an array</a></td>
            
          </tr>
          <tr class="row252">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/maximize-sum-after-k-negations/0" title="">Maximize array sum after K negations</a></td>
            
          </tr>
          <tr class="row253">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/maximize-arrii-of-an-array/0" title="">Maximize the sum of arr[i]*i</a></td>
            
          </tr>
          <tr class="row254">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/maximum-sum-absolute-difference-array/" title="">Maximum sum of absolute difference of an array</a></td>
            
          </tr>
          <tr class="row255">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/swap-and-maximize/0" title="">Maximize sum of consecutive differences in a circular array</a></td>
            
          </tr>
          <tr class="row256">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><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="">Minimum sum of absolute difference of pairs of two arrays</a></td>
            
          </tr>
          <tr class="row257">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/program-for-shortest-job-first-or-sjf-cpu-scheduling-set-1-non-preemptive/" title="">Program for Shortest Job First (or SJF) CPU Scheduling</a></td>
            
          </tr>
          <tr class="row258">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/page-faults-in-lru/0" title="">Program for Least Recently Used (LRU) Page Replacement algorithm</a></td>
            
          </tr>
          <tr class="row259">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/smallest-subset-sum-greater-elements/" title="">Smallest subset with sum greater than all other elements</a></td>
            
          </tr>
          <tr class="row260">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0" title="">Chocolate Distribution Problem</a></td>
            
          </tr>
          <tr class="row261">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/DEFKIN/" title="">DEFKIN -Defense of a Kingdom</a></td>
            
          </tr>
          <tr class="row262">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/DIEHARD/" title="">DIEHARD -DIE HARD</a></td>
            
          </tr>
          <tr class="row263">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/GERGOVIA/" title="">GERGOVIA -Wine trading in Gergovia</a></td>
            
          </tr>
          <tr class="row264">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/GCJ101BB/" title="">Picking Up Chicks</a></td>
            
          </tr>
          <tr class="row265">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/CHOCOLA/" title="">CHOCOLA –Chocolate</a></td>
            
          </tr>
          <tr class="row266">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.spoj.com/problems/ARRANGE/" title="">ARRANGE -Arranging Amplifiers</a></td>
            
          </tr>
          <tr class="row267">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/k-centers-problem-set-1-greedy-approximate-algorithm/" title="">K Centers Problem</a></td>
            
          </tr>
          <tr class="row268">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0" title="">Minimum Cost of ropes</a></td>
            
          </tr>
          <tr class="row269">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/smallest-number5829/1" title="">Find smallest number with given number of digits and sum of digits</a></td>
            
          </tr>
          <tr class="row270">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/rearrange-characters/0" title="">Rearrange characters in a string such that no two adjacent are same</a></td>
            
          </tr>
          <tr class="row271">
            <td class="column0 style5 s">Greedy</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-maximum-sum-possible-equal-sum-three-stacks/" title="">Find maximum sum possible equal sum of three stacks</a></td>
            
          </tr>
          <tr class="row272">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row273">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row274">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1" title="">Rat in a maze Problem</a></td>
            
          </tr>
          <tr class="row275">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/printing-solutions-n-queen-problem/" title="">Printing all solutions in N-Queen Problem</a></td>
            
          </tr>
          <tr class="row276">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/word-break-part-2/0" title="">Word Break Problem using Backtracking</a></td>
            
          </tr>
          <tr class="row277">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/remove-invalid-parentheses/" title="">Remove Invalid Parentheses</a></td>
            
          </tr>
          <tr class="row278">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/solve-the-sudoku/0" title="">Sudoku Solver</a></td>
            
          </tr>
          <tr class="row279">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/m-coloring-problem/0" title="">m Coloring Problem</a></td>
            
          </tr>
          <tr class="row280">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/given-a-string-print-all-possible-palindromic-partition/" title="">Print all palindromic partitions of a string</a></td>
            
          </tr>
          <tr class="row281">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1" title="">Subset Sum Problem</a></td>
            
          </tr>
          <tr class="row282">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/the-knights-tour-problem-backtracking-1/" title="">The Knight’s tour problem</a></td>
            
          </tr>
          <tr class="row283">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/tug-of-war/" title="">Tug of War</a></td>
            
          </tr>
          <tr class="row284">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-shortest-safe-route-in-a-path-with-landmines/" title="">Find shortest safe route in a path with landmines</a></td>
            
          </tr>
          <tr class="row285">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/combination-sum/0" title="">Combinational Sum</a></td>
            
          </tr>
          <tr class="row286">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/largest-number-in-k-swaps/0" title="">Find Maximum number possible by doing at-most K swaps</a></td>
            
          </tr>
          <tr class="row287">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string/0" title="">Print all permutations of a string </a></td>
            
          </tr>
          <tr class="row288">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-if-there-is-a-path-of-more-than-k-length-from-a-source/" title="">Find if there is a path of more than k length from a source</a></td>
            
          </tr>
          <tr class="row289">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/longest-possible-route-in-a-matrix-with-hurdles/" title="">Longest Possible Route in a Matrix with Hurdles</a></td>
            
          </tr>
          <tr class="row290">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/print-all-possible-paths-from-top-left-to-bottom-right-of-a-mxn-matrix/" title="">Print all possible paths from top left to bottom right of a mXn matrix</a></td>
            
          </tr>
          <tr class="row291">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/partition-array-to-k-subsets/1" title="">Partition of a set intoK subsets with equal sum</a></td>
            
          </tr>
          <tr class="row292">
            <td class="column0 style5 s">BackTracking</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-the-k-th-permutation-sequence-of-first-n-natural-numbers/" title="">Find the K-th Permutation Sequence of first N natural numbers</a></td>
            
          </tr>
          <tr class="row293">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row294">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row295">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.tutorialspoint.com/javaexamples/data_stack.htm" title="">&nbsp;Implement Stack from Scratch</a></td>
            
          </tr>
          <tr class="row296">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/queue-set-1introduction-and-array-implementation/" title="">&nbsp;Implement Queue from Scratch</a></td>
            
          </tr>
          <tr class="row297">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/implement-two-stacks-in-an-array/1" title="">Implement 2 stack in an array</a></td>
            
          </tr>
          <tr class="row298">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/design-a-stack-with-find-middle-operation/" title="">find the middle element of a stack</a></td>
            
          </tr>
          <tr class="row299">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/efficiently-implement-k-stacks-single-array/" title="">Implement &quot;N&quot; stacks in an Array</a></td>
            
          </tr>
          <tr class="row300">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/parenthesis-checker/0" title="">Check the expression has valid or Balanced parenthesis or not.</a></td>
            
          </tr>
          <tr class="row301">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/reverse-a-string-using-stack/1" title="">Reverse a String using Stack</a></td>
            
          </tr>
          <tr class="row302">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/special-stack/1" title="">Design a Stack that supports getMin() in O(1) time and O(1) extra space.</a></td>
            
          </tr>
          <tr class="row303">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/next-larger-element/0" title="">Find the next Greater element</a></td>
            
          </tr>
          <tr class="row304">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/the-celebrity-problem/1" title="">The celebrity Problem</a></td>
            
          </tr>
          <tr class="row305">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/arithmetic-expression-evalution/#:~:text=The%20stack%20organization%20is%20very,i.e.%2C%20A%20%2B%20B)." title="">Arithmetic Expression evaluation</a></td>
            
          </tr>
          <tr class="row306">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/evaluation-of-postfix-expression/0" title="">Evaluation of Postfix expression</a></td>
            
          </tr>
          <tr class="row307">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://stackoverflow.com/questions/45130465/inserting-at-the-end-of-stack" title="">Implement a method to insert an element at its bottom without using any other data structure.</a></td>
            
          </tr>
          <tr class="row308">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style9 s"><a href="https://www.geeksforgeeks.org/reverse-a-stack-using-recursion/" title="">Reverse a stack using recursion</a></td>
            
          </tr>
          <tr class="row309">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/sort-a-stack/1" title="">Sort a Stack using recursion</a></td>
            
          </tr>
          <tr class="row310">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/overlapping-intervals/0" title="">Merge Overlapping Intervals</a></td>
            
          </tr>
          <tr class="row311">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/maximum-rectangular-area-in-a-histogram/0" title="">Largest rectangular Area in Histogram</a></td>
            
          </tr>
          <tr class="row312">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/valid-substring0624/1" title="">Length of the Longest Valid Substring</a></td>
            
          </tr>
          <tr class="row313">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/expression-contains-redundant-bracket-not/" title="">Expression contains redundant bracket or not</a></td>
            
          </tr>
          <tr class="row314">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/stack-using-two-queues/1" title="">Implement Stack using Queue</a></td>
            
          </tr>
          <tr class="row315">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/implement-stack-queue-using-deque/" title="">Implement Stack using Deque</a></td>
            
          </tr>
          <tr class="row316">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/stack-permutations-check-if-an-array-is-stack-permutation-of-other/" title="">Stack Permutations (Check if an array is stack permutation of other)</a></td>
            
          </tr>
          <tr class="row317">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/queue-using-two-stacks/1" title="">Implement Queue using Stack  </a></td>
            
          </tr>
          <tr class="row318">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/efficiently-implement-k-queues-single-array/" title="">Implement &quot;n&quot; queue in an array</a></td>
            
          </tr>
          <tr class="row319">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/circular-queue-set-1-introduction-array-implementation/" title="">Implement a Circular queue</a></td>
            
          </tr>
          <tr class="row320">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/lru-cache/1" title="">LRU Cache Implementationa</a></td>
            
          </tr>
          <tr class="row321">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/queue-reversal/1" title="">Reverse a Queue using recursion</a></td>
            
          </tr>
          <tr class="row322">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/reverse-first-k-elements-of-queue/1" title="">Reverse the first “K” elements of a queue</a></td>
            
          </tr>
          <tr class="row323">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/interleave-first-half-queue-second-half/" title="">Interleave the first half of the queue with second half</a></td>
            
          </tr>
          <tr class="row324">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/circular-tour/1" title="">Find the first circular tour that visits all Petrol Pumps</a></td>
            
          </tr>
          <tr class="row325">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/rotten-oranges/0" title="">Minimum time required to rot all oranges</a></td>
            
          </tr>
          <tr class="row326">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/distance-of-nearest-cell-having-1/0" title="">Distance of nearest cell having 1 in a binary matrix</a></td>
            
          </tr>
          <tr class="row327">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/first-negative-integer-in-every-window-of-size-k/0" title="">First negative integer in every window of size “k”</a></td>
            
          </tr>
          <tr class="row328">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/check-if-all-levels-of-two-trees-are-anagrams-or-not/" title="">Check if all levels of two trees are anagrams or not.</a></td>
            
          </tr>
          <tr class="row329">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/sum-minimum-maximum-elements-subarrays-size-k/" title="">Sum of minimum and maximum elements of all subarrays of size “k”.</a></td>
            
          </tr>
          <tr class="row330">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/game-with-string/0" title="">Minimum sum of squares of character counts in a given string after removing “k” characters.</a></td>
            
          </tr>
          <tr class="row331">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0" title="">Queue based approach or first non-repeating character in a stream.</a></td>
            
          </tr>
          <tr class="row332">
            <td class="column0 style5 s">Stacks &amp; Queues</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/next-smaller-element/" title="">Next Smaller Element</a></td>
            
          </tr>
          <tr class="row333">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row334">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row335">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/building-heap-from-array/" title="">Implement a Maxheap/MinHeap using arrays and recursion.</a></td>
            
          </tr>
          <tr class="row336">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/heap-sort/" title="">Sort an Array using heap. (HeapSort)</a></td>
            
          </tr>
          <tr class="row337">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/" title="">Maximum of all subarrays of size k.</a></td>
            
          </tr>
          <tr class="row338">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/k-largest-elements4206/1" title="">“k” largest element in an array</a></td>
            
          </tr>
          <tr class="row339">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/kth-smallestlargest-element-unsorted-array/" title="">Kth smallest and largest element in an unsorted array</a></td>
            
          </tr>
          <tr class="row340">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/merge-k-sorted-arrays/1" title="">Merge “K” sorted arrays. [ IMP ]</a></td>
            
          </tr>
          <tr class="row341">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/merge-two-binary-max-heap/0" title="">Merge 2 Binary Max Heaps</a></td>
            
          </tr>
          <tr class="row342">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/k-th-largest-sum-contiguous-subarray/" title="">Kth largest sum continuous subarrays</a></td>
            
          </tr>
          <tr class="row343">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style9 s"><a href="https://leetcode.com/problems/reorganize-string/" title="">Leetcode- reorganize strings</a></td>
            
          </tr>
          <tr class="row344">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1" title="">Merge “K” Sorted Linked Lists [V.IMP]</a></td>
            
          </tr>
          <tr class="row345">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/find-smallest-range-containing-elements-from-k-lists/1" title="">Smallest range in “K” Lists</a></td>
            
          </tr>
          <tr class="row346">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0" title="">Median in a stream of Integers</a></td>
            
          </tr>
          <tr class="row347">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/is-binary-tree-heap/1" title="">Check if a Binary Tree is Heap</a></td>
            
          </tr>
          <tr class="row348">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0" title="">Connect “n” ropes with minimum cost</a></td>
            
          </tr>
          <tr class="row349">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/convert-bst-min-heap/" title="">Convert BST to Min Heap</a></td>
            
          </tr>
          <tr class="row350">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/convert-min-heap-to-max-heap/" title="">Convert min heap to max heap</a></td>
            
          </tr>
          <tr class="row351">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/rearrange-characters/0" title="">Rearrange characters in a string such that no two adjacent are same.</a></td>
            
          </tr>
          <tr class="row352">
            <td class="column0 style8 s">Heap</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-sum4058/1" title="">Minimum sum of two numbers formed from digits of an array</a></td>
            
          </tr>
          <tr class="row353">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row354">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row355">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://1drv.ms/t/s!AqTOHFO77CqEiRua06v1PATyiFg5" title="">Create a Graph, print it</a></td>
            
          </tr>
          <tr class="row356">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1" title="">Implement BFS algorithm </a></td>
            
          </tr>
          <tr class="row357">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/" title="">Implement DFS Algo </a></td>
            
          </tr>
          <tr class="row358">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/detect-cycle-in-a-graph/" title="">Detect Cycle in Directed Graph using BFS/DFS Algo </a></td>
            
          </tr>
          <tr class="row359">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1" title="">Detect Cycle in UnDirected Graph using BFS/DFS Algo </a></td>
            
          </tr>
          <tr class="row360">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1" title="">Search in a Maze</a></td>
            
          </tr>
          <tr class="row361">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/steps-by-knight/0" title="">Minimum Step by Knight</a></td>
            
          </tr>
          <tr class="row362">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/flood-fill/" title="">flood fill algo</a></td>
            
          </tr>
          <tr class="row363">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/clone-graph/" title="">Clone a graph</a></td>
            
          </tr>
          <tr class="row364">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/number-of-operations-to-make-network-connected/" title="">Making wired Connections</a></td>
            
          </tr>
          <tr class="row365">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/word-ladder/" title="">word Ladder </a></td>
            
          </tr>
          <tr class="row366">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/" title="">Dijkstra algo</a></td>
            
          </tr>
          <tr class="row367">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/topological-sort/1" title="">Implement Topological Sort </a></td>
            
          </tr>
          <tr class="row368">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/minimum-time-taken-by-each-job-to-be-completed-given-by-a-directed-acyclic-graph/" title="">Minimum time taken by each job to be completed given by a Directed Acyclic Graph</a></td>
            
          </tr>
          <tr class="row369">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-whether-it-is-possible-to-finish-all-tasks-or-not-from-given-dependencies/" title="">Find whether it is possible to finish all tasks or not from given dependencies</a></td>
            
          </tr>
          <tr class="row370">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/find-the-number-of-islands/1" title="">Find the no. of Isalnds</a></td>
            
          </tr>
          <tr class="row371">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/alien-dictionary/1" title="">Given a sorted Dictionary of an Alien Language, find order of characters</a></td>
            
          </tr>
          <tr class="row372">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/" title="">Implement Kruksal’sAlgorithm</a></td>
            
          </tr>
          <tr class="row373">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/" title="">Implement Prim’s Algorithm</a></td>
            
          </tr>
          <tr class="row374">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/total-number-spanning-trees-graph/" title="">Total no. of Spanning tree in a graph</a></td>
            
          </tr>
          <tr class="row375">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/negative-weight-cycle/0" title="">Implement Bellman Ford Algorithm</a></td>
            
          </tr>
          <tr class="row376">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/implementing-floyd-warshall/0" title="">Implement Floyd warshallAlgorithm</a></td>
            
          </tr>
          <tr class="row377">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/" title="">Travelling Salesman Problem</a></td>
            
          </tr>
          <tr class="row378">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/graph-coloring-applications/#:~:text=Graph%20coloring%20problem%20is%20to,are%20colored%20using%20same%20color." title="">Graph ColouringProblem</a></td>
            
          </tr>
          <tr class="row379">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/snakes-and-ladders/" title="">Snake and Ladders Problem</a></td>
            
          </tr>
          <tr class="row380">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/bridge-in-a-graph/" title="">Find bridge in a graph</a></td>
            
          </tr>
          <tr class="row381">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1" title="">Count Strongly connected Components(Kosaraju Algo)</a></td>
            
          </tr>
          <tr class="row382">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/bipartite-graph/" title="">Check whether a graph is Bipartite or Not</a></td>
            
          </tr>
          <tr class="row383">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/detect-negative-cycle-graph-bellman-ford/" title="">Detect Negative cycle in a graph</a></td>
            
          </tr>
          <tr class="row384">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-longest-path-directed-acyclic-graph/" title="">Longest path in a Directed Acyclic Graph</a></td>
            
          </tr>
          <tr class="row385">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.hackerrank.com/challenges/journey-to-the-moon/problem" title="">Journey to the Moon</a></td>
            
          </tr>
          <tr class="row386">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/cheapest-flights-within-k-stops/description/" title="">Cheapest Flights Within K Stops</a></td>
            
          </tr>
          <tr class="row387">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.hackerearth.com/practice/algorithms/graphs/topological-sort/practice-problems/algorithm/oliver-and-the-game-3/" title="">Oliver and the Game</a></td>
            
          </tr>
          <tr class="row388">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/water-jug-problem-using-bfs/" title="">Water Jug problem using BFS</a></td>
            
          </tr>
          <tr class="row389">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/water-jug-problem-using-bfs/" title="">Water Jug problem using BFS</a></td>
            
          </tr>
          <tr class="row390">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-if-there-is-a-path-of-more-than-k-length-from-a-source/" title="">Find if there is a path of more thank length from a source</a></td>
            
          </tr>
          <tr class="row391">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/m-coloring-problem/0" title="">M-ColouringProblem</a></td>
            
          </tr>
          <tr class="row392">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/minimum-edges-reverse-make-path-source-destination/" title="">Minimum edges to reverse o make path from source to destination</a></td>
            
          </tr>
          <tr class="row393">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/paths-travel-nodes-using-edgeseven-bridges-konigsberg/" title="">Paths to travel each nodes using each edge(Seven Bridges)</a></td>
            
          </tr>
          <tr class="row394">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/vertex-cover-problem-set-1-introduction-approximate-algorithm-2/" title="">Vertex Cover Problem</a></td>
            
          </tr>
          <tr class="row395">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/chinese-postman-route-inspection-set-1-introduction/" title="">Chinese Postman or Route Inspection</a></td>
            
          </tr>
          <tr class="row396">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/number-of-triangles-in-directed-and-undirected-graphs/" title="">Number of Triangles in a Directed and Undirected Graph</a></td>
            
          </tr>
          <tr class="row397">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/" title="">Minimise the cashflow among a given set of friends who have borrowed money from each other</a></td>
            
          </tr>
          <tr class="row398">
            <td class="column0 style8 s">Graph</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/two-clique-problem-check-graph-can-divided-two-cliques/" title="">Two Clique Problem</a></td>
            
          </tr>
          <tr class="row399">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row400">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row401">
            <td class="column0 style8 s">Trie</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/trie-insert-and-search/" title="">Construct a trie from scratch</a></td>
            
          </tr>
          <tr class="row402">
            <td class="column0 style8 s">Trie</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/find-all-shortest-unique-prefixes-to-represent-each-word-in-a-given-list/" title="">Find shortest unique prefix for every word in a given list</a></td>
            
          </tr>
          <tr class="row403">
            <td class="column0 style8 s">Trie</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/word-break-problem-trie-solution/" title="">Word Break Problem | (Trie solution)</a></td>
            
          </tr>
          <tr class="row404">
            <td class="column0 style8 s">Trie</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/k-anagrams-1/0" title="">Given a sequence of words, print all anagrams together</a></td>
            
          </tr>
          <tr class="row405">
            <td class="column0 style8 s">Trie</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/phone-directory/0" title="">Implement a Phone Directory</a></td>
            
          </tr>
          <tr class="row406">
            <td class="column0 style8 s">Trie</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/unique-rows-in-boolean-matrix/1" title="">Print unique rows in a given boolean matrix</a></td>
            
          </tr>
          <tr class="row407">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row408">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row409">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/coin-change2448/1" title="">Coin ChangeProblem</a></td>
            
          </tr>
          <tr class="row410">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/0-1-knapsack-problem/0" title="">Knapsack Problem</a></td>
            
          </tr>
          <tr class="row411">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/ncr1019/1" title="">Binomial CoefficientProblem</a></td>
            
          </tr>
          <tr class="row412">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/permutation-coefficient/" title="">Permutation CoefficientProblem</a></td>
            
          </tr>
          <tr class="row413">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/program-nth-catalan-number/" title="">Program for nth Catalan Number</a></td>
            
          </tr>
          <tr class="row414">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/matrix-chain-multiplication-dp-8/" title="">Matrix Chain Multiplication </a></td>
            
          </tr>
          <tr class="row415">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/edit-distance3702/1" title="">Edit Distance</a></td>
            
          </tr>
          <tr class="row416">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1" title="">Subset Sum Problem</a></td>
            
          </tr>
          <tr class="row417">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/friends-pairing-problem5425/1" title="">Friends Pairing Problem</a></td>
            
          </tr>
          <tr class="row418">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/gold-mine-problem/" title="">Gold Mine Problem</a></td>
            
          </tr>
          <tr class="row419">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/assembly-line-scheduling-dp-34/" title="">Assembly Line SchedulingProblem</a></td>
            
          </tr>
          <tr class="row420">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/painting-the-fence3727/1" title="">Painting the Fenceproblem</a></td>
            
          </tr>
          <tr class="row421">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/cutted-segments/0" title="">Maximize The Cut Segments</a></td>
            
          </tr>
          <tr class="row422">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-common-subsequence/0" title="">Longest Common Subsequence</a></td>
            
          </tr>
          <tr class="row423">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-repeating-subsequence/0" title="">Longest Repeated Subsequence</a></td>
            
          </tr>
          <tr class="row424">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-increasing-subsequence/0" title="">Longest Increasing Subsequence</a></td>
            
          </tr>
          <tr class="row425">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/space-optimized-solution-lcs/" title="">Space Optimized Solution of LCS</a></td>
            
          </tr>
          <tr class="row426">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/lcs-of-three-strings/0" title="">LCS (Longest Common Subsequence) of three strings</a></td>
            
          </tr>
          <tr class="row427">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/maximum-sum-increasing-subsequence4749/1" title="">Maximum Sum Increasing Subsequence</a></td>
            
          </tr>
          <tr class="row428">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/count-subsequences-product-less-k/" title="">Count all subsequences having product less than K</a></td>
            
          </tr>
          <tr class="row429">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-subsequence-such-that-difference-between-adjacents-is-one4724/1" title="">Longest subsequence such that difference between adjacent is one</a></td>
            
          </tr>
          <tr class="row430">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/maximum-subsequence-sum-such-that-no-three-are-consecutive/" title="">Maximum subsequence sum such that no three are consecutive</a></td>
            
          </tr>
          <tr class="row431">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/egg-dropping-puzzle/0" title="">Egg Dropping Problem</a></td>
            
          </tr>
          <tr class="row432">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/max-length-chain/1" title="">Maximum Length Chain of Pairs</a></td>
            
          </tr>
          <tr class="row433">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/largest-square-formed-in-a-matrix/0" title="">Maximum size square sub-matrix with all 1s</a></td>
            
          </tr>
          <tr class="row434">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/pairs-with-specific-difference/0" title="">Maximum sum of pairs with specific difference</a></td>
            
          </tr>
          <tr class="row435">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/path-in-matrix3805/1" title="">Min Cost PathProblem</a></td>
            
          </tr>
          <tr class="row436">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/maximum-difference-of-zeros-and-ones-in-binary-string4111/1" title="">Maximum difference of zeros and ones in binary string</a></td>
            
          </tr>
          <tr class="row437">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps/0" title="">Minimum number of jumps to reach end</a></td>
            
          </tr>
          <tr class="row438">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/minimum-cost-to-fill-given-weight-in-a-bag1956/1" title="">Minimum cost to fill given weight in a bag</a></td>
            
          </tr>
          <tr class="row439">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/minimum-removals-array-make-max-min-k/" title="">Minimum removals from array to make max –min &lt;= K</a></td>
            
          </tr>
          <tr class="row440">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-common-substring/0" title="">Longest Common Substring</a></td>
            
          </tr>
          <tr class="row441">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/reach-a-given-score/0" title="">Count number of ways to reacha given score in a game</a></td>
            
          </tr>
          <tr class="row442">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/bbt-counter/0" title="">Count Balanced Binary Trees of Height h</a></td>
            
          </tr>
          <tr class="row443">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0" title="">LargestSum Contiguous Subarray [V&gt;V&gt;V&gt;V IMP ]</a></td>
            
          </tr>
          <tr class="row444">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/smallest-sum-contiguous-subarray/" title="">Smallest sum contiguous subarray</a></td>
            
          </tr>
          <tr class="row445">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/knapsack-with-duplicate-items4201/1" title="">Unbounded Knapsack (Repetition of items allowed)</a></td>
            
          </tr>
          <tr class="row446">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/word-break/0" title="">Word Break Problem</a></td>
            
          </tr>
          <tr class="row447">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/largest-independent-set-problem-dp-26/" title="">Largest Independent Set Problem</a></td>
            
          </tr>
          <tr class="row448">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1" title="">Partition problem</a></td>
            
          </tr>
          <tr class="row449">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" title="">Longest Palindromic Subsequence</a></td>
            
          </tr>
          <tr class="row450">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/count-palindromic-subsequences/1" title="">Count All Palindromic Subsequence in a given String</a></td>
            
          </tr>
          <tr class="row451">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/longest-palindromic-substring/" title="">Longest Palindromic Substring</a></td>
            
          </tr>
          <tr class="row452">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/longest-alternating-subsequence/0" title="">Longest alternating subsequence</a></td>
            
          </tr>
          <tr class="row453">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/weighted-job-scheduling/" title="">Weighted Job Scheduling</a></td>
            
          </tr>
          <tr class="row454">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/coin-game-winner-every-player-three-choices/" title="">Coin game winner where every player has three choices</a></td>
            
          </tr>
          <tr class="row455">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/count-derangements-permutation-such-that-no-element-appears-in-its-original-position/" title="">Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ]</a></td>
            
          </tr>
          <tr class="row456">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/maximum-profit-by-buying-and-selling-a-share-at-most-twice/" title="">Maximum profit by buying and selling a share at most twice [ IMP ]</a></td>
            
          </tr>
          <tr class="row457">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/optimal-strategy-for-a-game/0" title="">Optimal Strategy for a Game</a></td>
            
          </tr>
          <tr class="row458">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/optimal-binary-search-tree-dp-24/" title="">Optimal Binary Search Tree</a></td>
            
          </tr>
          <tr class="row459">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/palindromic-patitioning4845/1" title="">Palindrome PartitioningProblem</a></td>
            
          </tr>
          <tr class="row460">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/word-wrap/0" title="">Word Wrap Problem</a></td>
            
          </tr>
          <tr class="row461">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/mobile-numeric-keypad5456/1" title="">Mobile Numeric Keypad Problem [ IMP ]</a></td>
            
          </tr>
          <tr class="row462">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/boolean-parenthesization/0" title="">Boolean Parenthesization Problem</a></td>
            
          </tr>
          <tr class="row463">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/largest-rectangular-sub-matrix-whose-sum-0/" title="">Largest rectangular sub-matrix whose sum is 0</a></td>
            
          </tr>
          <tr class="row464">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/largest-area-rectangular-sub-matrix-equal-number-1s-0s/" title="">Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ]</a></td>
            
          </tr>
          <tr class="row465">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/maximum-sum-rectangle/0" title="">Maximum sum rectangle in a 2D matrix</a></td>
            
          </tr>
          <tr class="row466">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/maximum-profit4657/1" title="">Maximum profit by buying and selling a share at most k times</a></td>
            
          </tr>
          <tr class="row467">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/interleaved-strings/1" title="">Find if a string is interleaved of two other strings</a></td>
            
          </tr>
          <tr class="row468">
            <td class="column0 style5 s">Dynamic Programming</td>
            <td class="column1 style6 s"><a href="https://leetcode.com/problems/maximum-length-of-pair-chain/" title="">Maximum Length of Pair Chain</a></td>
            
          </tr>
          <tr class="row469">
            <td class="column0">&nbsp;</td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row470">
            <td class="column0 style8 null"></td>
            <td class="column1 style7 null"></td>
            <td class="column2 style4 null"></td>
          </tr>
          <tr class="row471">
            <td class="column0 style5 s">Bit Manipulation</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/set-bits0143/1" title="">Count set bits in an integer</a></td>
            
          </tr>
          <tr class="row472">
            <td class="column0 style5 s">Bit Manipulation</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/finding-the-numbers0215/1" title="">Find the two non-repeating elements in an array of repeating elements</a></td>
            
          </tr>
          <tr class="row473">
            <td class="column0 style5 s">Bit Manipulation</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/bit-difference/0" title="">Count number of bits to be flipped to convert A to B</a></td>
            
          </tr>
          <tr class="row474">
            <td class="column0 style5 s">Bit Manipulation</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/count-total-set-bits/0" title="">Count total set bits in all numbers from 1 to n</a></td>
            
          </tr>
          <tr class="row475">
            <td class="column0 style5 s">Bit Manipulation</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/power-of-2/0" title="">Program to find whether a no is power of two</a></td>
            
          </tr>
          <tr class="row476">
            <td class="column0 style5 s">Bit Manipulation</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/find-position-of-set-bit3706/1" title="">Find position of the only set bit</a></td>
            
          </tr>
          <tr class="row477">
            <td class="column0 style5 s">Bit Manipulation</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/copy-set-bits-in-a-range/" title="">Copy set bits in a range</a></td>
            
          </tr>
          <tr class="row478">
            <td class="column0 style5 s">Bit Manipulation</td>
            <td class="column1 style6 s"><a href="https://www.geeksforgeeks.org/divide-two-integers-without-using-multiplication-division-mod-operator/" title="">Divide two integers without using multiplication, division and mod operator</a></td>
            
          </tr>
          <tr class="row479">
            <td class="column0 style5 s">Bit Manipulation</td>
            <td class="column1 style6 s"><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;text=A%20Simple%20Solution%20is%20to%20repeatedly%20add%20n%20to%20result." title="">Calculate square of a number without using *, / and pow()</a></td>
            
          </tr>
          <tr class="row480">
            <td class="column0 style5 s">Bit Manipulation</td>
            <td class="column1 style6 s"><a href="https://practice.geeksforgeeks.org/problems/power-set4302/1" title="">Power Set</a></td>
            
          </tr>
        </tbody>
    </table>