<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Techie Delight - Medium]]></title>
        <description><![CDATA[Leading platform for technical interview preparation. - Medium]]></description>
        <link>https://medium.com/techie-delight?source=rss----d2ee351b3e1d---4</link>
        <image>
            <url>https://cdn-images-1.medium.com/proxy/1*TGH72Nnw24QL3iV9IOm4VA.png</url>
            <title>Techie Delight - Medium</title>
            <link>https://medium.com/techie-delight?source=rss----d2ee351b3e1d---4</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Wed, 18 Nov 2026 04:53:19 GMT</lastBuildDate>
        <atom:link href="https://medium.com/feed/techie-delight" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Online Compiler — C, C++, Java, Python]]></title>
            <link>https://medium.com/techie-delight/online-compiler-c-c-java-python-aa8a192694d3?source=rss----d2ee351b3e1d---4</link>
            <guid isPermaLink="false">https://medium.com/p/aa8a192694d3</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[compilers]]></category>
            <category><![CDATA[techie-delight]]></category>
            <category><![CDATA[coding]]></category>
            <dc:creator><![CDATA[Vivek Srivastava]]></dc:creator>
            <pubDate>Thu, 07 Dec 2023 21:11:08 GMT</pubDate>
            <atom:updated>2023-12-16T17:19:13.296Z</atom:updated>
            <content:encoded><![CDATA[<h3>Online Compiler for C, C++, Java, and Python</h3><p><a href="https://www.techiedelight.com/">Techie Delight</a> provides a quick and easy way to compile and execute code online in several popular programming languages such as C, C++, Java, JavaScript, Python, PHP, etc.</p><p>Major highlights of <a href="https://techiedelight.com/compiler/">Techie Delight’s Compiler</a>:</p><ul><li>Choose from over 35 programming languages.</li><li>Multi-editors: Compile and run several codes in the same browser window.</li><li>Share your code online using a random or custom URL.</li><li>Indent/Beautify your source code.</li><li>Show/hide line numbers, increase/decrease font size, show whitespace.</li><li>Use soft tabs, and many more options to customize the IDE.</li><li>Choose over 35 dark/light themes.</li><li>Supports over 100 keyboard shortcuts.</li><li>Upload/Download/Copy your source code.</li><li>Embed your source code on any website.</li><li>Auto-complete code.</li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=aa8a192694d3" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techie-delight/online-compiler-c-c-java-python-aa8a192694d3">Online Compiler — C, C++, Java, Python</a> was originally published in <a href="https://medium.com/techie-delight">Techie Delight</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Data Structures and Algorithms — Practice Problems]]></title>
            <link>https://medium.com/techie-delight/data-structures-and-algorithms-practice-problems-2810bf3249a4?source=rss----d2ee351b3e1d---4</link>
            <guid isPermaLink="false">https://medium.com/p/2810bf3249a4</guid>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[java]]></category>
            <category><![CDATA[python]]></category>
            <dc:creator><![CDATA[Vivek Srivastava]]></dc:creator>
            <pubDate>Tue, 23 Nov 2021 17:43:43 GMT</pubDate>
            <atom:updated>2021-11-26T15:52:11.015Z</atom:updated>
            <content:encoded><![CDATA[<h3>Data Structures and Algorithms Practice Problems</h3><ol><li><a href="https://techiedelight.com/practice/?problem=TwoSum">Two Sum</a></li><li><a href="https://techiedelight.com/practice/?problem=ZeroSum">Zero Sum</a></li><li><a href="https://techiedelight.com/practice/?problem=ZeroSumII">Zero Sum II</a></li><li><a href="https://techiedelight.com/practice/?problem=SortBinaryArray">Sort Binary Array</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumLengthSubarray">Maximum Length Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=LargestSubarray">Largest Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumProductPair">Maximum Product Pair</a></li><li><a href="https://techiedelight.com/practice/?problem=DutchNationalFlagProblem">Dutch National Flag Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=MergeArrays">Merge Arrays</a></li><li><a href="https://techiedelight.com/practice/?problem=MergeArraysII">Merge Arrays II</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumContinuousSequence">Maximum Continuous Sequence</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumContinuousSequenceII">Maximum Continuous Sequence II</a></li><li><a href="https://techiedelight.com/practice/?problem=EquilibriumIndex">Equilibrium Index</a></li><li><a href="https://techiedelight.com/practice/?problem=LargestConsecutiveSubarray">Largest Consecutive Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=MajorityElement">Majority Element</a></li><li><a href="https://techiedelight.com/practice/?problem=MoveZeroesToEnd">Move Zeroes to End</a></li><li><a href="https://techiedelight.com/practice/?problem=ReplaceArrayElements">Replace Array Elements</a></li><li><a href="https://techiedelight.com/practice/?problem=ReplaceArrayElementsII">Replace Array Elements II</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestBitonicSubarray">Longest Bitonic Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumDifferencePair">Maximum Difference Pair</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumSumSubarray">Maximum Sum Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumSumSubarrayII">Maximum Sum Subarray II</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumSumCircularSubarray">Maximum Sum Circular Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=RearrangeArray">Rearrange Array</a></li><li><a href="https://techiedelight.com/practice/?problem=RearrangeArrayII">Rearrange Array II</a></li><li><a href="https://techiedelight.com/practice/?problem=RearrangeArrayIII">Rearrange Array III</a></li><li><a href="https://techiedelight.com/practice/?problem=RearrangeArrayIV">Rearrange Array IV</a></li><li><a href="https://techiedelight.com/practice/?problem=RearrangeArrayV">Rearrange Array V</a></li><li><a href="https://techiedelight.com/practice/?problem=SortedMergeArrays">Sorted Merge Arrays</a></li><li><a href="https://techiedelight.com/practice/?problem=SortedMergeArraysII">Sorted Merge Arrays II</a></li><li><a href="https://techiedelight.com/practice/?problem=Combinations">Combinations</a></li><li><a href="https://techiedelight.com/practice/?problem=CombinationsII">Combinations II</a></li><li><a href="https://techiedelight.com/practice/?problem=CombinationsIII">Combinations III</a></li><li><a href="https://techiedelight.com/practice/?problem=CombinationsIV">Combinations IV</a></li><li><a href="https://techiedelight.com/practice/?problem=CombinationsV">Combinations V</a></li><li><a href="https://techiedelight.com/practice/?problem=CombinationsVI">Combinations VI</a></li><li><a href="https://techiedelight.com/practice/?problem=CombinationsVII">Combinations VII</a></li><li><a href="https://techiedelight.com/practice/?problem=CombinationsVIII">Combinations VIII</a></li><li><a href="https://techiedelight.com/practice/?problem=CombinationsIX">Combinations IX</a></li><li><a href="https://techiedelight.com/practice/?problem=CombinationsX">Combinations X</a></li><li><a href="https://techiedelight.com/practice/?problem=CombinationsXI">Combinations XI</a></li><li><a href="https://techiedelight.com/practice/?problem=SubsetSum">Subset Sum</a></li><li><a href="https://techiedelight.com/practice/?problem=BallArrangements">Ball Arrangements</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumSumSubarray">Minimum Sum Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumProductSubarray">Maximum Product Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=KSumSubarray">K Sum Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=KSumSubarrayII">K Sum Subarray II</a></li><li><a href="https://techiedelight.com/practice/?problem=SmallestSubarray">Smallest Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=SmallestWindowToSortArray">Smallest Window to Sort Array</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumPathSum">Maximum Path Sum</a></li><li><a href="https://techiedelight.com/practice/?problem=BuyNSellShares">Buy N Sell Shares</a></li><li><a href="https://techiedelight.com/practice/?problem=TrappingRainWater">Trapping Rain Water</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumPlatforms">Minimum Platforms</a></li><li><a href="https://techiedelight.com/practice/?problem=DecodeArray">Decode Array</a></li><li><a href="https://techiedelight.com/practice/?problem=SortArraySingleSwap">Sort Array Single Swap</a></li><li><a href="https://techiedelight.com/practice/?problem=3Sum">3 Sum</a></li><li><a href="https://techiedelight.com/practice/?problem=3SumII">3 Sum II</a></li><li><a href="https://techiedelight.com/practice/?problem=3SumIII">3 Sum III</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestContinuousSequence">Longest Continuous Sequence</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseConsecutiveElements">Reverse Consecutive Elements</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumProductSubset">Maximum Product Subset</a></li><li><a href="https://techiedelight.com/practice/?problem=2Diff">2 Diff</a></li><li><a href="https://techiedelight.com/practice/?problem=4Sum">4 Sum</a></li><li><a href="https://techiedelight.com/practice/?problem=ArithmeticTriplets">Arithmetic Triplets</a></li><li><a href="https://techiedelight.com/practice/?problem=GeometricTriplets">Geometric Triplets</a></li><li><a href="https://techiedelight.com/practice/?problem=BuyAndSellStock">Buy and Sell Stock</a></li><li><a href="https://techiedelight.com/practice/?problem=BuyAndSellStockII">Buy and Sell Stock II</a></li><li><a href="https://techiedelight.com/practice/?problem=BuyAndSellStockIII">Buy and Sell Stock III</a></li><li><a href="https://techiedelight.com/practice/?problem=GroupElements">Group Elements</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumAbsoluteDifference">Minimum Absolute Difference</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumAbsoluteDifferenceII">Minimum Absolute Difference II</a></li><li><a href="https://techiedelight.com/practice/?problem=SymmetricPairs">Symmetric Pairs</a></li><li><a href="https://techiedelight.com/practice/?problem=ClosestPair">Closest Pair</a></li><li><a href="https://techiedelight.com/practice/?problem=PartitionArrayEqualSum">Partition Array Equal Sum</a></li><li><a href="https://techiedelight.com/practice/?problem=DistinctElementsCount">Distinct Elements Count</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumSumNumber">Maximum Sum Number</a></li><li><a href="https://techiedelight.com/practice/?problem=LargestDistinctSubarrays">Largest Distinct Subarrays</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumProductTriplet">Maximum Product Triplet</a></li><li><a href="https://techiedelight.com/practice/?problem=RepeatingElementIndex">Repeating Element Index</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumAbsoluteSumPair">Minimum Absolute Sum Pair</a></li><li><a href="https://techiedelight.com/practice/?problem=ConsecutiveNumbers">Consecutive Numbers</a></li><li><a href="https://techiedelight.com/practice/?problem=NonOverlappingPairs">Non Overlapping Pairs</a></li><li><a href="https://techiedelight.com/practice/?problem=AddArrays">Add Arrays</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumProductTriplet">Minimum Product Triplet</a></li><li><a href="https://techiedelight.com/practice/?problem=DistinctAbsoluteCount">Distinct Absolute Count</a></li><li><a href="https://techiedelight.com/practice/?problem=BreakPointIndex">Break Point Index</a></li><li><a href="https://techiedelight.com/practice/?problem=FrequencyMap">Frequency Map</a></li><li><a href="https://techiedelight.com/practice/?problem=FrequencyMapII">Frequency Map II</a></li><li><a href="https://techiedelight.com/practice/?problem=SortedTriplet">Sorted Triplet</a></li><li><a href="https://techiedelight.com/practice/?problem=ShuffleArray">Shuffle Array</a></li><li><a href="https://techiedelight.com/practice/?problem=ShuffleArrayII">Shuffle Array II</a></li><li><a href="https://techiedelight.com/practice/?problem=ShuffleArrayIII">Shuffle Array III</a></li><li><a href="https://techiedelight.com/practice/?problem=StrictlyIncreasingSubarrays">Strictly Increasing Subarrays</a></li><li><a href="https://techiedelight.com/practice/?problem=DuplicatesInRangeK">Duplicates in Range K</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumRange">Minimum Range</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumRangeII">Minimum Range II</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestConsecutiveSubsequence">Longest Consecutive Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=DetermineIndex">Determine Index</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumMovesToConvertArray">Minimum Moves to Convert Array</a></li><li><a href="https://techiedelight.com/practice/?problem=LeftRotateArray">Left Rotate Array</a></li><li><a href="https://techiedelight.com/practice/?problem=RightRotateArray">Right Rotate Array</a></li><li><a href="https://techiedelight.com/practice/?problem=ActivitySelectionProblem">Activity Selection Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=KDivisiblePairs">K Divisible Pairs</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumRemovals">Minimum Removals</a></li><li><a href="https://techiedelight.com/practice/?problem=TwoSumII">Two Sum II</a></li><li><a href="https://techiedelight.com/practice/?problem=GreaterElements">Greater Elements</a></li><li><a href="https://techiedelight.com/practice/?problem=SortArray">Sort Array</a></li><li><a href="https://techiedelight.com/practice/?problem=CountingSort">Counting Sort</a></li><li><a href="https://techiedelight.com/practice/?problem=InversionCount">Inversion Count</a></li><li><a href="https://techiedelight.com/practice/?problem=InversionCountII">Inversion Count II</a></li><li><a href="https://techiedelight.com/practice/?problem=SortByFrequencyAndIndex">Sort by Frequency and Index</a></li><li><a href="https://techiedelight.com/practice/?problem=SortWithDuplicates">Sort with Duplicates</a></li><li><a href="https://techiedelight.com/practice/?problem=LargestNumber">Largest Number</a></li><li><a href="https://techiedelight.com/practice/?problem=SurpasserCount">Surpasser Count</a></li><li><a href="https://techiedelight.com/practice/?problem=3PartitionProblem">3 Partition Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=3PartitionProblemII">3 Partition Problem II</a></li><li><a href="https://techiedelight.com/practice/?problem=KPartitionProblem">K Partition Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumMergeOperations">Minimum Merge Operations</a></li><li><a href="https://techiedelight.com/practice/?problem=CoinChangeProblem">Coin Change Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=CoinChangeProblemII">Coin Change Problem II</a></li><li><a href="https://techiedelight.com/practice/?problem=PowerSet">Power Set</a></li><li><a href="https://techiedelight.com/practice/?problem=PowerSetII">Power Set II</a></li><li><a href="https://techiedelight.com/practice/?problem=MissingNumber">Missing Number</a></li><li><a href="https://techiedelight.com/practice/?problem=MissingNumberII">Missing Number II</a></li><li><a href="https://techiedelight.com/practice/?problem=MissingNumberIII">Missing Number III</a></li><li><a href="https://techiedelight.com/practice/?problem=OddOccurringElement">Odd Occurring Element</a></li><li><a href="https://techiedelight.com/practice/?problem=OddOccurringElementII">Odd Occurring Element II</a></li><li><a href="https://techiedelight.com/practice/?problem=OddOccurringElementIII">Odd Occurring Element III</a></li><li><a href="https://techiedelight.com/practice/?problem=OddOccurringElementIV">Odd Occurring Element IV</a></li><li><a href="https://techiedelight.com/practice/?problem=DuplicateElement">Duplicate Element</a></li><li><a href="https://techiedelight.com/practice/?problem=DuplicateElementII">Duplicate Element II</a></li><li><a href="https://techiedelight.com/practice/?problem=MissingAndDuplicateElement">Missing and Duplicate Element</a></li><li><a href="https://techiedelight.com/practice/?problem=NextGreaterElement">Next Greater Element</a></li><li><a href="https://techiedelight.com/practice/?problem=NextGreaterElementII">Next Greater Element II</a></li><li><a href="https://techiedelight.com/practice/?problem=PreviousSmallerElement">Previous Smaller Element</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestIncreasingSubsequence">Longest Increasing Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestIncreasingSubsequenceII">Longest Increasing Subsequence II</a></li><li><a href="https://techiedelight.com/practice/?problem=MergingOverlappingIntervals">Merging Overlapping Intervals</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumOverlappingIntervals">Maximum Overlapping Intervals</a></li><li><a href="https://techiedelight.com/practice/?problem=UnattendedCustomersCount">Unattended Customers Count</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumNumberKSwaps">Minimum Number K Swaps</a></li><li><a href="https://techiedelight.com/practice/?problem=RodCutting">Rod Cutting</a></li><li><a href="https://techiedelight.com/practice/?problem=RodCuttingII">Rod Cutting II</a></li><li><a href="https://techiedelight.com/practice/?problem=ShrinkArray">Shrink Array</a></li><li><a href="https://techiedelight.com/practice/?problem=TicketItinerary">Ticket Itinerary</a></li><li><a href="https://techiedelight.com/practice/?problem=SortKSortedArray">Sort K Sorted Array</a></li><li><a href="https://techiedelight.com/practice/?problem=JobSequencingProblem">Job Sequencing Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=EmployeesManagerMapping">Employees Manager Mapping</a></li><li><a href="https://techiedelight.com/practice/?problem=SnakeAndLadderProblem">Snake and Ladder Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=SpiralMatrix">Spiral Matrix</a></li><li><a href="https://techiedelight.com/practice/?problem=SpiralMatrixII">Spiral Matrix II</a></li><li><a href="https://techiedelight.com/practice/?problem=SpiralMatrixIII">Spiral Matrix III</a></li><li><a href="https://techiedelight.com/practice/?problem=ShiftMatrix">Shift Matrix</a></li><li><a href="https://techiedelight.com/practice/?problem=ConvertMatrix">Convert Matrix</a></li><li><a href="https://techiedelight.com/practice/?problem=ConvertMatrixII">Convert Matrix II</a></li><li><a href="https://techiedelight.com/practice/?problem=DiagonalMatrixTraversal">Diagonal Matrix Traversal</a></li><li><a href="https://techiedelight.com/practice/?problem=ReplaceMatrix">Replace Matrix</a></li><li><a href="https://techiedelight.com/practice/?problem=ReplaceMatrixII">Replace Matrix II</a></li><li><a href="https://techiedelight.com/practice/?problem=RotateMatrix">Rotate Matrix</a></li><li><a href="https://techiedelight.com/practice/?problem=RotateMatrixII">Rotate Matrix II</a></li><li><a href="https://techiedelight.com/practice/?problem=NegativeNumbersCount">Negative Numbers Count</a></li><li><a href="https://techiedelight.com/practice/?problem=SearchMatrix">Search Matrix</a></li><li><a href="https://techiedelight.com/practice/?problem=SearchMatrixII">Search Matrix II</a></li><li><a href="https://techiedelight.com/practice/?problem=ToeplitzMatrix">Toeplitz Matrix</a></li><li><a href="https://techiedelight.com/practice/?problem=FillMatrix">Fill Matrix</a></li><li><a href="https://techiedelight.com/practice/?problem=CommonElements">Common Elements</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumOnesRow">Maximum Ones Row</a></li><li><a href="https://techiedelight.com/practice/?problem=LargestSquareSubmatrix">Largest Square Submatrix</a></li><li><a href="https://techiedelight.com/practice/?problem=LargestSquareSubmatrixII">Largest Square Submatrix II</a></li><li><a href="https://techiedelight.com/practice/?problem=LargestRectangleArea">Largest Rectangle Area</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumDifferencePairII">Maximum Difference Pair II</a></li><li><a href="https://techiedelight.com/practice/?problem=NQueenProblem">N Queen Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=KnightTourProblem">Knight Tour Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=ChessKnightProblem">Chess Knight Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=ShortestPath">Shortest Path</a></li><li><a href="https://techiedelight.com/practice/?problem=ShortestPathII">Shortest Path II</a></li><li><a href="https://techiedelight.com/practice/?problem=ShortestPathIII">Shortest Path III</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestPath">Longest Path</a></li><li><a href="https://techiedelight.com/practice/?problem=MatrixPath">Matrix Path</a></li><li><a href="https://techiedelight.com/practice/?problem=MatrixPathII">Matrix Path II</a></li><li><a href="https://techiedelight.com/practice/?problem=MatrixPathIII">Matrix Path III</a></li><li><a href="https://techiedelight.com/practice/?problem=MatrixPathIV">Matrix Path IV</a></li><li><a href="https://techiedelight.com/practice/?problem=MatrixPathV">Matrix Path V</a></li><li><a href="https://techiedelight.com/practice/?problem=MatrixPathVI">Matrix Path VI</a></li><li><a href="https://techiedelight.com/practice/?problem=MatrixPathVII">Matrix Path VII</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumCostPath">Minimum Cost Path</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumCostPathII">Minimum Cost Path II</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestContinuousSequenceII">Longest Continuous Sequence II</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestContinuousSequenceIII">Longest Continuous Sequence III</a></li><li><a href="https://techiedelight.com/practice/?problem=CollectMaximumPoints">Collect Maximum Points</a></li><li><a href="https://techiedelight.com/practice/?problem=TilesProblem">Tiles Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=LargestPlus">Largest Plus</a></li><li><a href="https://techiedelight.com/practice/?problem=CollectCoins">Collect Coins</a></li><li><a href="https://techiedelight.com/practice/?problem=DuplicateRows">Duplicate Rows</a></li><li><a href="https://techiedelight.com/practice/?problem=BoggleSearch">Boggle Search</a></li><li><a href="https://techiedelight.com/practice/?problem=SubmatrixSum">Submatrix Sum</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumSumSubmatrix">Maximum Sum Submatrix</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumSumSubmatrixII">Maximum Sum Submatrix II</a></li><li><a href="https://techiedelight.com/practice/?problem=AliveProbability">Alive Probability</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumLengthSnakeSequence">Maximum Length Snake Sequence</a></li><li><a href="https://techiedelight.com/practice/?problem=FloodFillAlgorithm">Flood Fill Algorithm</a></li><li><a href="https://techiedelight.com/practice/?problem=CountIslands">Count Islands</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructYoungTableau">Construct Young Tableau</a></li><li><a href="https://techiedelight.com/practice/?problem=ExtractMinInYoungTableau">Extract Min in Young Tableau</a></li><li><a href="https://techiedelight.com/practice/?problem=ReplaceElementInYoungTableau">Replace Element in Young Tableau</a></li><li><a href="https://techiedelight.com/practice/?problem=SortWithYoungTableau">Sort with Young Tableau</a></li><li><a href="https://techiedelight.com/practice/?problem=MagnetPuzzle">Magnet Puzzle</a></li><li><a href="https://techiedelight.com/practice/?problem=RotatedPalindrome">Rotated Palindrome</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestPalindromicSubstring">Longest Palindromic Substring</a></li><li><a href="https://techiedelight.com/practice/?problem=RepeatedSubsequence">Repeated Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=DeriveStrings">Derive Strings</a></li><li><a href="https://techiedelight.com/practice/?problem=CheckCircularMoves">Check Circular Moves</a></li><li><a href="https://techiedelight.com/practice/?problem=ExcelSheetColumnName">Excel Sheet Column Name</a></li><li><a href="https://techiedelight.com/practice/?problem=CheckAnagram">Check Anagram</a></li><li><a href="https://techiedelight.com/practice/?problem=InterleavingString">Interleaving String</a></li><li><a href="https://techiedelight.com/practice/?problem=InterleavingStringII">Interleaving String II</a></li><li><a href="https://techiedelight.com/practice/?problem=IsomorphicStrings">Isomorphic Strings</a></li><li><a href="https://techiedelight.com/practice/?problem=PalindromicSubstrings">Palindromic Substrings</a></li><li><a href="https://techiedelight.com/practice/?problem=GroupAnagrams">Group Anagrams</a></li><li><a href="https://techiedelight.com/practice/?problem=TransformString">Transform String</a></li><li><a href="https://techiedelight.com/practice/?problem=TransformStringII">Transform String II</a></li><li><a href="https://techiedelight.com/practice/?problem=TransformStringIII">Transform String III</a></li><li><a href="https://techiedelight.com/practice/?problem=BalancedExpression">Balanced Expression</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestPalidromicSumSubstring">Longest Palidromic Sum Substring</a></li><li><a href="https://techiedelight.com/practice/?problem=PrintStringZigZag">Print String Zig Zag</a></li><li><a href="https://techiedelight.com/practice/?problem=RunLengthEncoding">Run Length Encoding</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestDistinctSubstring">Longest Distinct Substring</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestDistinctSubstringII">Longest Distinct Substring II</a></li><li><a href="https://techiedelight.com/practice/?problem=PalindromicPermutations">Palindromic Permutations</a></li><li><a href="https://techiedelight.com/practice/?problem=AnagramSubstring">Anagram Substring</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumOccurringWord">Maximum Occurring Word</a></li><li><a href="https://techiedelight.com/practice/?problem=Permutations">Permutations</a></li><li><a href="https://techiedelight.com/practice/?problem=PermutationsII">Permutations II</a></li><li><a href="https://techiedelight.com/practice/?problem=NextPermutations">Next Permutations</a></li><li><a href="https://techiedelight.com/practice/?problem=LexicalMinimalStringRotation">Lexical Minimal String Rotation</a></li><li><a href="https://techiedelight.com/practice/?problem=BalancedParentheses">Balanced Parentheses</a></li><li><a href="https://techiedelight.com/practice/?problem=DuplicateParenthesis">Duplicate Parenthesis</a></li><li><a href="https://techiedelight.com/practice/?problem=EvaluatePostfixExpression">Evaluate Postfix Expression</a></li><li><a href="https://techiedelight.com/practice/?problem=InfixToPostfix">Infix to Postfix</a></li><li><a href="https://techiedelight.com/practice/?problem=PalindromeString">Palindrome String</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumInversions">Minimum Inversions</a></li><li><a href="https://techiedelight.com/practice/?problem=RemoveAdjacentDuplicates">Remove Adjacent Duplicates</a></li><li><a href="https://techiedelight.com/practice/?problem=RemoveAdjacentDuplicatesII">Remove Adjacent Duplicates II</a></li><li><a href="https://techiedelight.com/practice/?problem=FirstNonRepeatingCharacter">First Non Repeating Character</a></li><li><a href="https://techiedelight.com/practice/?problem=LexicographicPermutations">Lexicographic Permutations</a></li><li><a href="https://techiedelight.com/practice/?problem=LexicographicRank">Lexicographic Rank</a></li><li><a href="https://techiedelight.com/practice/?problem=DecodeSequence">Decode Sequence</a></li><li><a href="https://techiedelight.com/practice/?problem=KDistinctSubstrings">K Distinct Substrings</a></li><li><a href="https://techiedelight.com/practice/?problem=PatternMatch">Pattern Match</a></li><li><a href="https://techiedelight.com/practice/?problem=PatternMatchII">Pattern Match II</a></li><li><a href="https://techiedelight.com/practice/?problem=PatternMatchIII">Pattern Match III</a></li><li><a href="https://techiedelight.com/practice/?problem=PatternMatchIV">Pattern Match IV</a></li><li><a href="https://techiedelight.com/practice/?problem=PatternMatchV">Pattern Match V</a></li><li><a href="https://techiedelight.com/practice/?problem=WildcardPatternMatching">Wildcard Pattern Matching</a></li><li><a href="https://techiedelight.com/practice/?problem=WildcardPatternMatchingII">Wildcard Pattern Matching II</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestBalancedParenthesis">Longest Balanced Parenthesis</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestPalindrome">Longest Palindrome</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseText">Reverse Text</a></li><li><a href="https://techiedelight.com/practice/?problem=NDigitNumbers">N Digit Numbers</a></li><li><a href="https://techiedelight.com/practice/?problem=NDigitNumbersII">N Digit Numbers II</a></li><li><a href="https://techiedelight.com/practice/?problem=NDigitNumbersIII">N Digit Numbers III</a></li><li><a href="https://techiedelight.com/practice/?problem=NDigitNumbersIV">N Digit Numbers IV</a></li><li><a href="https://techiedelight.com/practice/?problem=NDigitNumbersV">N Digit Numbers V</a></li><li><a href="https://techiedelight.com/practice/?problem=NDigitNumbersVI">N Digit Numbers VI</a></li><li><a href="https://techiedelight.com/practice/?problem=NDigitNumbersVII">N Digit Numbers VII</a></li><li><a href="https://techiedelight.com/practice/?problem=FirstKNonRepeating">First K Non Repeating</a></li><li><a href="https://techiedelight.com/practice/?problem=KPalindromeString">K Palindrome String</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumDeleteOperations">Minimum Delete Operations</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumCutPalindromicPartition">Minimum Cut Palindromic Partition</a></li><li><a href="https://techiedelight.com/practice/?problem=LexicographicSorting">Lexicographic Sorting</a></li><li><a href="https://techiedelight.com/practice/?problem=ShortestUniquePrefix">Shortest Unique Prefix</a></li><li><a href="https://techiedelight.com/practice/?problem=RearrangeWords">Rearrange Words</a></li><li><a href="https://techiedelight.com/practice/?problem=TurnOffKthBit">Turn off Kth Bit</a></li><li><a href="https://techiedelight.com/practice/?problem=TurnOnKthBit">Turn on Kth Bit</a></li><li><a href="https://techiedelight.com/practice/?problem=IsKthBitSet">Is Kth Bit Set</a></li><li><a href="https://techiedelight.com/practice/?problem=ToggleKthBit">Toggle Kth Bit</a></li><li><a href="https://techiedelight.com/practice/?problem=UnsetRightmostSetBit">Unset Rightmost Set Bit</a></li><li><a href="https://techiedelight.com/practice/?problem=PositionOfRightmostSetBit">Position of Rightmost Set Bit</a></li><li><a href="https://techiedelight.com/practice/?problem=CountSetBits">Count Set Bits</a></li><li><a href="https://techiedelight.com/practice/?problem=CountFlippedBits">Count Flipped Bits</a></li><li><a href="https://techiedelight.com/practice/?problem=NextPowerOf2">Next Power of 2</a></li><li><a href="https://techiedelight.com/practice/?problem=PreviousPowerOf2">Previous Power of 2</a></li><li><a href="https://techiedelight.com/practice/?problem=ParityOfNumber">Parity of Number</a></li><li><a href="https://techiedelight.com/practice/?problem=SwapBits">Swap Bits</a></li><li><a href="https://techiedelight.com/practice/?problem=SwapBitsII">Swap Bits II</a></li><li><a href="https://techiedelight.com/practice/?problem=PowerOf4">Power of 4</a></li><li><a href="https://techiedelight.com/practice/?problem=PowerOf8">Power of 8</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseBits">Reverse Bits</a></li><li><a href="https://techiedelight.com/practice/?problem=SwapAdjacentBits">Swap Adjacent Bits</a></li><li><a href="https://techiedelight.com/practice/?problem=AdjacentSetBits">Adjacent Set Bits</a></li><li><a href="https://techiedelight.com/practice/?problem=DecimalToBinary">Decimal to Binary</a></li><li><a href="https://techiedelight.com/practice/?problem=AddBinary">Add Binary</a></li><li><a href="https://techiedelight.com/practice/?problem=CircularShift">Circular Shift</a></li><li><a href="https://techiedelight.com/practice/?problem=XORWithoutXORing">XOR Without XORing</a></li><li><a href="https://techiedelight.com/practice/?problem=SearchSortedArray">Search Sorted Array</a></li><li><a href="https://techiedelight.com/practice/?problem=UnboundedSearchSortedArray">Unbounded Search Sorted Array</a></li><li><a href="https://techiedelight.com/practice/?problem=RotationCount">Rotation Count</a></li><li><a href="https://techiedelight.com/practice/?problem=SearchCircularArray">Search Circular Array</a></li><li><a href="https://techiedelight.com/practice/?problem=FirstAndLastOccurrence">First and Last Occurrence</a></li><li><a href="https://techiedelight.com/practice/?problem=CountOccurrences">Count Occurrences</a></li><li><a href="https://techiedelight.com/practice/?problem=SmallestMissingNumber">Smallest Missing Number</a></li><li><a href="https://techiedelight.com/practice/?problem=SmallestMissingNumberII">Smallest Missing Number II</a></li><li><a href="https://techiedelight.com/practice/?problem=FloorAndCeil">Floor and Ceil</a></li><li><a href="https://techiedelight.com/practice/?problem=SearchNearlySortedArray">Search Nearly Sorted Array</a></li><li><a href="https://techiedelight.com/practice/?problem=CountOnes">Count Ones</a></li><li><a href="https://techiedelight.com/practice/?problem=PeakElement">Peak Element</a></li><li><a href="https://techiedelight.com/practice/?problem=KClosestElements">K Closest Elements</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestCommonPrefix">Longest Common Prefix</a></li><li><a href="https://techiedelight.com/practice/?problem=ImplementPowerFunction">Implement Power Function</a></li><li><a href="https://techiedelight.com/practice/?problem=ImplementSquareRoot">Implement Square Root</a></li><li><a href="https://techiedelight.com/practice/?problem=CheckMinHeap">Check Min Heap</a></li><li><a href="https://techiedelight.com/practice/?problem=MaxHeapToMinHeap">Max Heap to Min Heap</a></li><li><a href="https://techiedelight.com/practice/?problem=KthSmallestElement">Kth Smallest Element</a></li><li><a href="https://techiedelight.com/practice/?problem=KthLargestElement">Kth Largest Element</a></li><li><a href="https://techiedelight.com/practice/?problem=KthLargestElementII">Kth Largest Element II</a></li><li><a href="https://techiedelight.com/practice/?problem=MergeSortedLists">Merge Sorted Lists</a></li><li><a href="https://techiedelight.com/practice/?problem=ConnectNRopes">Connect N Ropes</a></li><li><a href="https://techiedelight.com/practice/?problem=ReplaceElementsWithRank">Replace Elements with Rank</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestCommonSubsequence">Longest Common Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestCommonSubsequenceII">Longest Common Subsequence II</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestCommonSubsequenceIII">Longest Common Subsequence III</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestCommonSubstring">Longest Common Substring</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestPalindromicSubsequence">Longest Palindromic Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestRepeatedSubsequence">Longest Repeated Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=ShortestCommonSupersequence">Shortest Common Supersequence</a></li><li><a href="https://techiedelight.com/practice/?problem=ShortestCommonSupersequenceII">Shortest Common Supersequence II</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestDecreasingSubsequence">Longest Decreasing Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestBitonicSubsequence">Longest Bitonic Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=MaxSumIncreasingSubsequence">Max Sum Increasing Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=EditDistanceProblem">Edit Distance Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximizeValue">Maximize Value</a></li><li><a href="https://techiedelight.com/practice/?problem=01KnapsackProblem">0/1 Knapsack Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=PartitionProblem">Partition Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=SubsetSumProblem">Subset Sum Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumSumPartitionProblem">Minimum Sum Partition Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestAlternatingSubsequence">Longest Alternating Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=LinearEquationKVariables">Linear Equation K Variables</a></li><li><a href="https://techiedelight.com/practice/?problem=WordBreakProblem">Word Break Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=WeightedIntervalScheduling">Weighted Interval Scheduling</a></li><li><a href="https://techiedelight.com/practice/?problem=MatrixChainMultiplication">Matrix Chain Multiplication</a></li><li><a href="https://techiedelight.com/practice/?problem=ClimbingStairs">Climbing Stairs</a></li><li><a href="https://techiedelight.com/practice/?problem=ClimbingStairsII">Climbing Stairs II</a></li><li><a href="https://techiedelight.com/practice/?problem=PotsOfGoldGame">Pots of Gold Game</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumJumps">Minimum Jumps</a></li><li><a href="https://techiedelight.com/practice/?problem=OptimalCostToConstructBST">Optimal Cost to Construct BST</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumSumSubsequence">Maximum Sum Subsequence</a></li><li><a href="https://techiedelight.com/practice/?problem=NthFibonacciNumber">Nth Fibonacci Number</a></li><li><a href="https://techiedelight.com/practice/?problem=CountDecodings">Count Decodings</a></li><li><a href="https://techiedelight.com/practice/?problem=HatCheckProblem">Hat Check Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumSquares">Minimum Squares</a></li><li><a href="https://techiedelight.com/practice/?problem=TruncateArray">Truncate Array</a></li><li><a href="https://techiedelight.com/practice/?problem=DiceThrow">Dice Throw</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumWeightTriangulation">Minimum Weight Triangulation</a></li><li><a href="https://techiedelight.com/practice/?problem=LongestAlternatingSubarray">Longest Alternating Subarray</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructLinkedList">Construct Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructLinkedListII">Construct Linked List II</a></li><li><a href="https://techiedelight.com/practice/?problem=PopLinkedListHead">Pop Linked List Head</a></li><li><a href="https://techiedelight.com/practice/?problem=SortedInsertInLinkedList">Sorted Insert in Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=KthNodeFromEnd">Kth Node from End</a></li><li><a href="https://techiedelight.com/practice/?problem=DeleteNodesLinkedList">Delete Nodes Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=RemoveRedundantNodes">Remove Redundant Nodes</a></li><li><a href="https://techiedelight.com/practice/?problem=AddNumberToLinkedList">Add Number to Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=AddTwoLinkedLists">Add Two Linked Lists</a></li><li><a href="https://techiedelight.com/practice/?problem=SortLinkedList">Sort Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=DutchNationalFlagProblemII">Dutch National Flag Problem II</a></li><li><a href="https://techiedelight.com/practice/?problem=SortDoublyLinkedList">Sort Doubly Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=SwapNodesLinkedList">Swap Nodes Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=SwapNodesLinkedListII">Swap Nodes Linked List II</a></li><li><a href="https://techiedelight.com/practice/?problem=DetectCycleLinkedList">Detect Cycle Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=RemoveCycleLinkedList">Remove Cycle Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=SplitLinkedList">Split Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=SplitLinkedListII">Split Linked List II</a></li><li><a href="https://techiedelight.com/practice/?problem=RemoveDuplicatesLinkedList">Remove Duplicates Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=RemoveDuplicatesLinkedListII">Remove Duplicates Linked List II</a></li><li><a href="https://techiedelight.com/practice/?problem=CloneLinkedList">Clone Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=CloneLinkedListII">Clone Linked List II</a></li><li><a href="https://techiedelight.com/practice/?problem=MoveNodeLinkedList">Move Node Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=MoveNodeLinkedListII">Move Node Linked List II</a></li><li><a href="https://techiedelight.com/practice/?problem=SortedIntersect">Sorted Intersect</a></li><li><a href="https://techiedelight.com/practice/?problem=ShuffleMerge">Shuffle Merge</a></li><li><a href="https://techiedelight.com/practice/?problem=ShuffleMergeII">Shuffle Merge II</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseLinkedList">Reverse Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseLinkedListII">Reverse Linked List II</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseLinkedListIII">Reverse Linked List III</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseLinkedListIV">Reverse Linked List IV</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseDoublyLinkedList">Reverse Doubly Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=RearrangeLinkedList">Rearrange Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=RearrangeLinkedListII">Rearrange Linked List II</a></li><li><a href="https://techiedelight.com/practice/?problem=RearrangeLinkedListIII">Rearrange Linked List III</a></li><li><a href="https://techiedelight.com/practice/?problem=RearrangeLinkedListIV">Rearrange Linked List IV</a></li><li><a href="https://techiedelight.com/practice/?problem=SortedMerge">Sorted Merge</a></li><li><a href="https://techiedelight.com/practice/?problem=SortedMergeII">Sorted Merge II</a></li><li><a href="https://techiedelight.com/practice/?problem=SortedMergeIII">Sorted Merge III</a></li><li><a href="https://techiedelight.com/practice/?problem=SortedMergeIV">Sorted Merge IV</a></li><li><a href="https://techiedelight.com/practice/?problem=PalindromeLinkedList">Palindrome Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=PalindromeLinkedListII">Palindrome Linked List II</a></li><li><a href="https://techiedelight.com/practice/?problem=UpdateRandomPointer">Update Random Pointer</a></li><li><a href="https://techiedelight.com/practice/?problem=ListsIntersectionPoint">Lists Intersection Point</a></li><li><a href="https://techiedelight.com/practice/?problem=InorderTreeTraversal">Inorder Tree Traversal</a></li><li><a href="https://techiedelight.com/practice/?problem=PreorderTreeTraversal">Preorder Tree Traversal</a></li><li><a href="https://techiedelight.com/practice/?problem=PostorderTreeTraversal">Postorder Tree Traversal</a></li><li><a href="https://techiedelight.com/practice/?problem=LevelOrderTraversal">Level Order Traversal</a></li><li><a href="https://techiedelight.com/practice/?problem=SpiralOrderTraversal">Spiral Order Traversal</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseLevelOrderTraversal">Reverse Level Order Traversal</a></li><li><a href="https://techiedelight.com/practice/?problem=CheckIdenticalBinaryTrees">Check Identical Binary Trees</a></li><li><a href="https://techiedelight.com/practice/?problem=HeightOfBinaryTree">Height of Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=HeightOfBinaryTreeII">Height of Binary Tree II</a></li><li><a href="https://techiedelight.com/practice/?problem=HeightOfBinaryTreeIII">Height of Binary Tree III</a></li><li><a href="https://techiedelight.com/practice/?problem=CloneBinaryTree">Clone Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=CloneBinaryTreeII">Clone Binary Tree II</a></li><li><a href="https://techiedelight.com/practice/?problem=IsAncestorOrDescendant">Is Ancestor or Descendant</a></li><li><a href="https://techiedelight.com/practice/?problem=BottomViewBinaryTree">Bottom View Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=TopViewBinaryTree">Top View Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=LeftViewBinaryTree">Left View Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=RightViewBinaryTree">Right View Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=PerfectBinaryTreeTraversal">Perfect Binary Tree Traversal</a></li><li><a href="https://techiedelight.com/practice/?problem=PerfectBinaryTreeTraversalII">Perfect Binary Tree Traversal II</a></li><li><a href="https://techiedelight.com/practice/?problem=BoundaryTraversalBinaryTree">Boundary Traversal Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=DiagonalTraversalBinaryTree">Diagonal Traversal Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=VerticalTraversalBinaryTree">Vertical Traversal Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumWidthBinaryTree">Maximum Width Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumDepthBinaryTree">Minimum Depth Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=CornerNodesInEachLevel">Corner Nodes in Each Level</a></li><li><a href="https://techiedelight.com/practice/?problem=CousinNodes">Cousin Nodes</a></li><li><a href="https://techiedelight.com/practice/?problem=CousinNodesII">Cousin Nodes II</a></li><li><a href="https://techiedelight.com/practice/?problem=LowestCommonAncestor">Lowest Common Ancestor</a></li><li><a href="https://techiedelight.com/practice/?problem=AncestorsOfBinaryTreeNode">Ancestors of Binary Tree Node</a></li><li><a href="https://techiedelight.com/practice/?problem=HeightBalancedBinaryTree">Height Balanced Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=HeightBalancedBinaryTreeII">Height Balanced Binary Tree II</a></li><li><a href="https://techiedelight.com/practice/?problem=NodesBetweenTwoLevels">Nodes Between Two Levels</a></li><li><a href="https://techiedelight.com/practice/?problem=DistanceBetweenTwoNodes">Distance Between Two Nodes</a></li><li><a href="https://techiedelight.com/practice/?problem=KDistanceNodesFromLeaves">K Distance Nodes from Leaves</a></li><li><a href="https://techiedelight.com/practice/?problem=TransformBinaryTree">Transform Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=TransformBinaryTreeII">Transform Binary Tree II</a></li><li><a href="https://techiedelight.com/practice/?problem=TruncateBinaryTree">Truncate Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=TruncateBinaryTreeII">Truncate Binary Tree II</a></li><li><a href="https://techiedelight.com/practice/?problem=SumTree">Sum Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=RootToLeafPathsInBinaryTree">Root to Leaf Paths in Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=LeafToRootPathsInBinaryTree">Leaf to Root Paths in Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=MirrorOfBinaryTree">Mirror of Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=NodeDescendantDifference">Node Descendant Difference</a></li><li><a href="https://techiedelight.com/practice/?problem=AlternateLevelsSumDifference">Alternate Levels Sum Difference</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumSumPathBinaryTree">Maximum Sum Path Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumSumPathBinaryTreeII">Maximum Sum Path Binary Tree II</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumSumPathBinaryTreeIII">Maximum Sum Path Binary Tree III</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructBinaryTree">Construct Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructBinaryTreeII">Construct Binary Tree II</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructBinaryTreeIII">Construct Binary Tree III</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructBinaryTreeIV">Construct Binary Tree IV</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructBinaryTreeV">Construct Binary Tree V</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructBinaryTreeVI">Construct Binary Tree VI</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructCartesianTree">Construct Cartesian Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructLCRSBinaryTree">Construct LCRS Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructExpressionTree">Construct Expression Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=EvaluateExpressionTree">Evaluate Expression Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=IsSymmetricBinaryTree">Is Symmetric Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=IsCompleteBinaryTree">Is Complete Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=IsSkewedBinaryTree">Is Skewed Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=IsSubtree">Is Subtree</a></li><li><a href="https://techiedelight.com/practice/?problem=IsBinaryTreeMinHeap">Is Binary Tree Min Heap</a></li><li><a href="https://techiedelight.com/practice/?problem=DiameterOfBinaryTree">Diameter of Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=DiagonalSumBinaryTree">Diagonal Sum Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=PostorderFromInorderAndPreorder">Postorder from Inorder and Preorder</a></li><li><a href="https://techiedelight.com/practice/?problem=PreorderFromInorderAndPostorder">Preorder from Inorder and Postorder</a></li><li><a href="https://techiedelight.com/practice/?problem=BinaryTreesWithSameInorder">Binary Trees with Same Inorder</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumIndependentSetProblem">Maximum Independent Set Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=NextNodeAtSameLevel">Next Node at Same Level</a></li><li><a href="https://techiedelight.com/practice/?problem=InvertAlternateLevels">Invert Alternate Levels</a></li><li><a href="https://techiedelight.com/practice/?problem=SubtreesWithSameNodeValue">Subtrees with Same Node Value</a></li><li><a href="https://techiedelight.com/practice/?problem=SplitBinaryTree">Split Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=SetInorderSuccessor">Set Inorder Successor</a></li><li><a href="https://techiedelight.com/practice/?problem=VerticalSumBinaryTree">Vertical Sum Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=LeafTraversalBinaryTree">Leaf Traversal Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=LinkNodesBinaryTree">Link Nodes Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=TernaryTreeToDoublyLinkedList">Ternary Tree to Doubly Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=ExtractBinaryTreeLeaves">Extract Binary Tree Leaves</a></li><li><a href="https://techiedelight.com/practice/?problem=BinaryTreeToDoublyLinkedList">Binary Tree to Doubly Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=BinaryTreeToDoublyLinkedListII">Binary Tree to Doubly Linked List II</a></li><li><a href="https://techiedelight.com/practice/?problem=LinkedListToCompleteBinaryTree">Linked List to Complete Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=AncestorMatrix">Ancestor Matrix</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructBST">Construct BST</a></li><li><a href="https://techiedelight.com/practice/?problem=InsertKeyIntoBST">Insert key into BST</a></li><li><a href="https://techiedelight.com/practice/?problem=SearchKeyInBST">Search key in BST</a></li><li><a href="https://techiedelight.com/practice/?problem=DeleteKeyFromBST">Delete key from BST</a></li><li><a href="https://techiedelight.com/practice/?problem=IsSameBSTs">Is Same BSTs</a></li><li><a href="https://techiedelight.com/practice/?problem=InorderPredecessorBST">Inorder Predecessor BST</a></li><li><a href="https://techiedelight.com/practice/?problem=InorderSuccessorBST">Inorder Successor BST</a></li><li><a href="https://techiedelight.com/practice/?problem=LowestCommonAncestorII">Lowest Common Ancestor II</a></li><li><a href="https://techiedelight.com/practice/?problem=KthSmallestNodeBST">Kth Smallest Node BST</a></li><li><a href="https://techiedelight.com/practice/?problem=KthLargestNodeBST">Kth Largest Node BST</a></li><li><a href="https://techiedelight.com/practice/?problem=FloorAndCeilII">Floor and Ceil II</a></li><li><a href="https://techiedelight.com/practice/?problem=2SumBST">2 Sum BST</a></li><li><a href="https://techiedelight.com/practice/?problem=2SumBSTII">2 Sum BST II</a></li><li><a href="https://techiedelight.com/practice/?problem=3SumBST">3 Sum BST</a></li><li><a href="https://techiedelight.com/practice/?problem=TransformBST">Transform BST</a></li><li><a href="https://techiedelight.com/practice/?problem=TruncateBST">Truncate BST</a></li><li><a href="https://techiedelight.com/practice/?problem=IsPreorderSequenceOfBST">Is Preorder Sequence of BST</a></li><li><a href="https://techiedelight.com/practice/?problem=IsSkewedBST">Is Skewed BST</a></li><li><a href="https://techiedelight.com/practice/?problem=NodesWithinARangeInBST">Nodes Within a Range in BST</a></li><li><a href="https://techiedelight.com/practice/?problem=SubtreesWithinARangeInBST">Subtrees Within a Range in BST</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructBSTFromPreorder">Construct BST from Preorder</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructBSTFromPostorder">Construct BST from Postorder</a></li><li><a href="https://techiedelight.com/practice/?problem=CompleteBSTTraversal">Complete BST Traversal</a></li><li><a href="https://techiedelight.com/practice/?problem=MergeBSTsToDoublyLinkedList">Merge BSTs to Doubly Linked List</a></li><li><a href="https://techiedelight.com/practice/?problem=MergeHeightBalancedBSTs">Merge Height Balanced BSTs</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructHeightBalancedBST">Construct Height Balanced BST</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructHeightBalancedBSTII">Construct Height Balanced BST II</a></li><li><a href="https://techiedelight.com/practice/?problem=ConstructHeightBalancedBSTIII">Construct Height Balanced BST III</a></li><li><a href="https://techiedelight.com/practice/?problem=ConvertBinaryTreeToBST">Convert Binary Tree to BST</a></li><li><a href="https://techiedelight.com/practice/?problem=LargestBSTSize">Largest BST Size</a></li><li><a href="https://techiedelight.com/practice/?problem=IsBST">Is BST</a></li><li><a href="https://techiedelight.com/practice/?problem=FixBinaryTree">Fix Binary Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=Probability">Probability</a></li><li><a href="https://techiedelight.com/practice/?problem=ProbabilityII">Probability II</a></li><li><a href="https://techiedelight.com/practice/?problem=ProbabilityIII">Probability III</a></li><li><a href="https://techiedelight.com/practice/?problem=ProbabilityIV">Probability IV</a></li><li><a href="https://techiedelight.com/practice/?problem=ProbabilityV">Probability V</a></li><li><a href="https://techiedelight.com/practice/?problem=ProbabilityVI">Probability VI</a></li><li><a href="https://techiedelight.com/practice/?problem=ProbabilityVII">Probability VII</a></li><li><a href="https://techiedelight.com/practice/?problem=ProbabilityVIII">Probability VIII</a></li><li><a href="https://techiedelight.com/practice/?problem=IsBipartiteGraph">Is Bipartite Graph</a></li><li><a href="https://techiedelight.com/practice/?problem=IsConnectedGraph">Is Connected Graph</a></li><li><a href="https://techiedelight.com/practice/?problem=IsAcyclicConnectedGraph">Is Acyclic Connected Graph</a></li><li><a href="https://techiedelight.com/practice/?problem=IsDAG">Is DAG</a></li><li><a href="https://techiedelight.com/practice/?problem=TopologicalSort">Topological Sort</a></li><li><a href="https://techiedelight.com/practice/?problem=RootVertexInGraph">Root Vertex in Graph</a></li><li><a href="https://techiedelight.com/practice/?problem=ConnectivityMatrix">Connectivity Matrix</a></li><li><a href="https://techiedelight.com/practice/?problem=BridgesInGraph">Bridges in Graph</a></li><li><a href="https://techiedelight.com/practice/?problem=KColorableGraph">K Colorable Graph</a></li><li><a href="https://techiedelight.com/practice/?problem=GraphColoring">Graph Coloring</a></li><li><a href="https://techiedelight.com/practice/?problem=IsStronglyConnectedGraph">Is Strongly Connected Graph</a></li><li><a href="https://techiedelight.com/practice/?problem=DetectCycleInGraph">Detect Cycle in Graph</a></li><li><a href="https://techiedelight.com/practice/?problem=LeastCostPath">Least Cost Path</a></li><li><a href="https://techiedelight.com/practice/?problem=LeastCostPathII">Least Cost Path II</a></li><li><a href="https://techiedelight.com/practice/?problem=LeastCostPathIII">Least Cost Path III</a></li><li><a href="https://techiedelight.com/practice/?problem=GreatestCostPath">Greatest Cost Path</a></li><li><a href="https://techiedelight.com/practice/?problem=IsReachableVertex">Is Reachable Vertex</a></li><li><a href="https://techiedelight.com/practice/?problem=TotalPathsInDigraph">Total Paths in Digraph</a></li><li><a href="https://techiedelight.com/practice/?problem=SingleSourceShortestPaths">Single Source Shortest Paths</a></li><li><a href="https://techiedelight.com/practice/?problem=SingleSourceShortestPathsII">Single Source Shortest Paths II</a></li><li><a href="https://techiedelight.com/practice/?problem=AllPairsShortestPaths">All Pairs Shortest Paths</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumSpanningTree">Minimum Spanning Tree</a></li><li><a href="https://techiedelight.com/practice/?problem=MaximumCostPath">Maximum Cost Path</a></li><li><a href="https://techiedelight.com/practice/?problem=NegativeWeightCycle">Negative Weight Cycle</a></li><li><a href="https://techiedelight.com/practice/?problem=HamiltonianPath">Hamiltonian Path</a></li><li><a href="https://techiedelight.com/practice/?problem=EulerianPath">Eulerian Path</a></li><li><a href="https://techiedelight.com/practice/?problem=EulerianPathII">Eulerian Path II</a></li><li><a href="https://techiedelight.com/practice/?problem=EulerianCycle">Eulerian Cycle</a></li><li><a href="https://techiedelight.com/practice/?problem=Factorial">Factorial</a></li><li><a href="https://techiedelight.com/practice/?problem=FactorialSeries">Factorial Series</a></li><li><a href="https://techiedelight.com/practice/?problem=PalindromeNumber">Palindrome Number</a></li><li><a href="https://techiedelight.com/practice/?problem=PrimesInRange">Primes in Range</a></li><li><a href="https://techiedelight.com/practice/?problem=MinimumAndMaximumElement">Minimum and Maximum Element</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseArray">Reverse Array</a></li><li><a href="https://techiedelight.com/practice/?problem=GreatestCommonDivisor">Greatest Common Divisor</a></li><li><a href="https://techiedelight.com/practice/?problem=BezoutCoefficients">Bezout Coefficients</a></li><li><a href="https://techiedelight.com/practice/?problem=CubesSum">Cubes Sum</a></li><li><a href="https://techiedelight.com/practice/?problem=ClockAngleProblem">Clock Angle Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=TowerOfHanoiProblem">Tower of Hanoi Problem</a></li><li><a href="https://techiedelight.com/practice/?problem=SortStack">Sort Stack</a></li><li><a href="https://techiedelight.com/practice/?problem=ReverseStack">Reverse Stack</a></li><li><a href="https://techiedelight.com/practice/?problem=GenerateBinaryNumbers">Generate Binary Numbers</a></li><li><a href="https://techiedelight.com/practice/?problem=ConvertNumberToWords">Convert Number to Words</a></li><li><a href="https://techiedelight.com/practice/?problem=ImplementStrstrFunction">Implement Strstr Function</a></li><li><a href="https://techiedelight.com/practice/?problem=ShortestSuperstringProblem">Shortest Superstring Problem</a></li></ol><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=2810bf3249a4" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techie-delight/data-structures-and-algorithms-practice-problems-2810bf3249a4">Data Structures and Algorithms — Practice Problems</a> was originally published in <a href="https://medium.com/techie-delight">Techie Delight</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[500+ Data Structures and Algorithms Interview Questions & Practice Problems]]></title>
            <link>https://medium.com/techie-delight/500-data-structures-and-algorithms-practice-problems-35afe8a1e222?source=rss----d2ee351b3e1d---4</link>
            <guid isPermaLink="false">https://medium.com/p/35afe8a1e222</guid>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[interview-questions]]></category>
            <category><![CDATA[techie-delight]]></category>
            <dc:creator><![CDATA[Vivek Srivastava]]></dc:creator>
            <pubDate>Thu, 26 Aug 2021 18:54:20 GMT</pubDate>
            <atom:updated>2021-08-21T15:58:38.054Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/640/0*2CpRRrWvTilAeXdu.png" /></figure><h3>Array</h3><ol><li><a href="https://www.techiedelight.com/find-pair-with-given-sum-array/">Find pair with given sum in the array</a></li><li><a href="https://www.techiedelight.com/check-subarray-with-0-sum-exists-not/">Check if subarray with 0 sum is exists or not</a></li><li><a href="https://www.techiedelight.com/find-sub-array-with-0-sum/">Print all sub-arrays with 0 sum</a></li><li><a href="https://www.techiedelight.com/sort-binary-array-linear-time/">Sort binary array in linear time</a></li><li><a href="https://www.techiedelight.com/find-duplicate-element-limited-range-array/">Find a duplicate element in a limited range array</a></li><li><a href="https://www.techiedelight.com/find-maximum-length-sub-array-having-given-sum/">Find maximum length sub-array having given sum</a></li><li><a href="https://www.techiedelight.com/find-maximum-length-sub-array-equal-number-0s-1s/">Find maximum length sub-array having equal number of 0’s and 1’s</a></li><li><a href="https://www.techiedelight.com/find-maximum-product-two-integers-array/">Find maximum product of two integers in an array</a></li><li><a href="https://www.techiedelight.com/sort-array-containing-0s-1s-2s-dutch-national-flag-problem/">Sort an array containing 0’s, 1’s and 2’s (Dutch National Flag Problem)</a></li><li><a href="https://www.techiedelight.com/inplace-merge-two-sorted-arrays/">In place merge two sorted arrays</a></li><li><a href="https://www.techiedelight.com/merge-two-arrays-satisfying-given-constraints/">Merge two arrays by satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/find-index-0-replaced-get-maximum-length-sequence-of-continuous-ones/">Find index of 0 to replace to get maximum length sequence of continuous ones</a></li><li><a href="https://www.techiedelight.com/shuffle-given-array-elements-fisher-yates-shuffle/">Shuffle a given array of elements (Fisher–Yates shuffle)</a></li><li><a href="https://www.techiedelight.com/rearrange-the-array-with-alternate-high-and-low-elements/">Rearrange the array with alternate high and low elements</a></li><li><a href="https://www.techiedelight.com/find-equilibrium-index-array/">Find equilibrium index of an array</a></li><li><a href="https://www.techiedelight.com/find-largest-sub-array-formed-by-consecutive-integers/">Find largest sub-array formed by consecutive integers</a></li><li><a href="https://www.techiedelight.com/find-majority-element-in-an-array-boyer-moore-majority-vote-algorithm/">Find majority element (Boyer–Moore Majority Vote Algorithm)</a></li><li><a href="https://www.techiedelight.com/move-zeros-present-array-end/">Move all zeros present in the array to the end</a></li><li><a href="https://www.techiedelight.com/replace-element-array-product-every-element-without-using-division-operator/">Replace each element of array with product of every other element without using / operator</a></li><li><a href="https://www.techiedelight.com/find-longest-bitonic-subarray-array/">Find Longest Bitonic Subarray in an array</a></li><li><a href="https://www.techiedelight.com/longest-increasing-subsequence/">Longest Increasing Subsequence</a></li><li><a href="https://www.techiedelight.com/find-maximum-difference-between-two-elements-array/">Find maximum difference between two elements in the array by satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/maximum-subarray-problem-kadanes-algorithm/">Maximum Sum Subarray Problem (Kadane’s Algorithm)</a></li><li><a href="https://www.techiedelight.com/print-continuous-subarray-with-maximum-sum/">Print continuous subarray with maximum sum</a></li><li><a href="https://www.techiedelight.com/maximum-sum-circular-subarray/">Maximum Sum Circular Subarray</a></li><li><a href="https://www.techiedelight.com/find-distinct-combinations-of-given-length/">Find all distinct combinations of given length — I</a></li><li><a href="https://www.techiedelight.com/find-distinct-combinations-given-length-repetition-allowed/">Find all distinct combinations of given length with repetition allowed</a></li><li><a href="https://www.techiedelight.com/find-maximum-sequence-of-continuous-1s-can-formed-replacing-k-zeroes-ones/">Find maximum sequence of continuous 1’s formed by replacing at-most k zeroes by ones</a></li><li><a href="https://www.techiedelight.com/find-minimum-sum-subarray-given-size-k/">Find minimum sum subarray of given size k</a></li><li><a href="https://www.techiedelight.com/find-maximum-product-subarray-given-array/">Find maximum product subarray in a given array</a></li><li><a href="https://www.techiedelight.com/find-subarray-having-given-sum-given-array/">Find subarray having given sum in given array of integers</a></li><li><a href="https://www.techiedelight.com/length-of-smallest-subarray-with-sum-greater-number/">Find the length of smallest subarray whose sum of elements is greater than the given number</a></li><li><a href="https://www.techiedelight.com/find-largest-number-possible-set-given-numbers/">Find largest number possible from set of given numbers</a></li><li><a href="https://www.techiedelight.com/smallest-window-sorting-which-make-array-sorted/">Find the smallest window in array sorting which will make the entire array sorted</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-path-involving-elements-given-arrays/">Find maximum sum path involving elements of given arrays</a></li><li><a href="https://www.techiedelight.com/maximum-profit-earned-buying-and-selling-shares/">Maximum profit earned by buying and selling shares any number of times</a></li><li><a href="https://www.techiedelight.com/trapping-rain-water-within-given-set-bars/">Trapping Rain Water within given set of bars</a></li><li><a href="https://www.techiedelight.com/minimum-number-of-platforms-needed-avoid-delay-arrival-train/">Find minimum platforms needed in the station so to avoid any delay in arrival of any train</a></li><li><a href="https://www.techiedelight.com/decode-the-array-constructed-another-array/">Decode the array constructed from another array</a></li><li><a href="https://www.techiedelight.com/sort-array-using-one-swap/">Sort an array using one swap</a></li><li><a href="https://www.techiedelight.com/find-triplet-given-with-given-sum/">Find Triplet with given sum in an array</a></li><li><a href="https://www.techiedelight.com/length-longest-continuous-sequence-same-sum-binary-arrays/">Length of longest continuous sequence with same sum in given binary arrays</a></li><li><a href="https://www.techiedelight.com/reverse-every-consecutive-m-elements-given-subarray/">Reverse every consecutive m elements of the given subarray</a></li><li><a href="https://www.techiedelight.com/maximum-product-subset-problem/">Maximum Product Subset Problem</a></li><li><a href="https://www.techiedelight.com/find-pairs-with-given-difference-array/">Find pairs with given difference k in the array</a></li><li><a href="https://www.techiedelight.com/find-pairs-given-difference-k-array-constant-space-solution/">Find pairs with given difference k in the array | Constant space solution</a></li><li><a href="https://www.techiedelight.com/4-sum-problem/">4 sum problem | Quadruplets with given sum</a></li><li><a href="https://www.techiedelight.com/print-all-quadruplets-with-given-sum-4-sum-problem-extended/">Print all quadruplets with given sum | 4-sum problem extended</a></li><li><a href="https://www.techiedelight.com/quickselect-algorithm/">Quickselect Algorithm</a></li><li><a href="https://www.techiedelight.com/rearrange-array-such-that-array-index-is-set-to-i/">Rearrange array such that A[A[i]] is set to i for every element A[i]</a></li><li><a href="https://www.techiedelight.com/print-triplets-forms-arithmetic-progression/">Print all Triplets that forms Arithmetic Progression</a></li><li><a href="https://www.techiedelight.com/print-triplets-forms-geometric-progression/">Print all Triplets that forms Geometric Progression</a></li><li><a href="https://www.techiedelight.com/print-all-combination-numbers-from-1-to-n/">Print all combination of numbers from 1 to n having sum n</a></li><li><a href="https://www.techiedelight.com/replace-each-element-corresponding-rank-array/">Replace each element of the array by its corresponding rank in the array</a></li><li><a href="https://www.techiedelight.com/print-triplets-array-sum-less-equal-given-number/">Print all Triplets in an array with sum less than or equal to given number</a></li><li><a href="https://www.techiedelight.com/group-elements-array-based-first-occurrence/">Group elements of an array based on their first occurrence</a></li><li><a href="https://www.techiedelight.com/find-minimum-difference-index-two-given-elements-present-array/">Find minimum difference between index of two given elements present in the array</a></li><li><a href="https://www.techiedelight.com/find-maximum-absolute-difference-subarrays/">Find maximum absolute difference between sum of two non-overlapping sub-arrays</a></li><li><a href="https://www.techiedelight.com/find-symmetric-pairs-array-pairs/">Find all Symmetric Pairs in an Array of Pairs</a></li><li><a href="https://www.techiedelight.com/partition-array-into-two-sub-arrays-with-same-sum/">Partition an array into two sub-arrays with the same sum</a></li><li><a href="https://www.techiedelight.com/count-distinct-elements-every-sub-array-size-k-array/">Find count of distinct elements in every sub-array of size k</a></li><li><a href="https://www.techiedelight.com/find-two-numbers-maximum-sum-array-digits/">Find two numbers with maximum sum formed by array digits</a></li><li><a href="https://www.techiedelight.com/print-sub-arrays-array-distinct-elements/">Print all sub-arrays of an array having distinct elements</a></li><li><a href="https://www.techiedelight.com/find-triplet-maximum-product-array/">Find a Triplet having Maximum Product in an Array</a></li><li><a href="https://www.techiedelight.com/find-minimum-index-repeating-element-array/">Find Minimum Index of Repeating Element in an Array</a></li><li><a href="https://www.techiedelight.com/generate-random-input-array-according-given-probabilities/">Generate random input from an array according to given probabilities</a></li><li><a href="https://www.techiedelight.com/find-pair-array-minimum-absolute-sum/">Find pair in an array having minimum absolute sum</a></li><li><a href="https://www.techiedelight.com/find-index-maximum-occurring-element-equal-probability/">Find Index of Maximum Occurring Element with Equal Probability</a></li><li><a href="https://www.techiedelight.com/check-array-formed-consecutive-integers/">Check if an Array is Formed by Consecutive Integers</a></li><li><a href="https://www.techiedelight.com/find-two-non-overlapping-pairs-sum-array/">Find two non-overlapping pairs having same sum in an array</a></li><li><a href="https://www.techiedelight.com/add-elements-two-arrays/">Add elements of two arrays into a new array</a></li><li><a href="https://www.techiedelight.com/find-minimum-product-triplets-array/">Find Minimum Product among all Combinations of Triplets in an Array</a></li><li><a href="https://www.techiedelight.com/replace-every-element-array-least-greater-element-right/">Replace every element of an array with the least greater element on its right</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-elements-array/">Find all odd occurring elements in an array having limited range of elements</a></li><li><a href="https://www.techiedelight.com/count-distinct-absolute-values-sorted-array/">Count the distinct absolute values in the sorted array</a></li><li><a href="https://www.techiedelight.com/print-combinations-integers-sum-given-number/">Print all combinations of positive integers in increasing order that sum to a given number</a></li><li><a href="https://www.techiedelight.com/find-distinct-combinations-given-length-2/">Find all distinct combinations of given length — II</a></li><li><a href="https://www.techiedelight.com/find-subarrays-given-sum-array/">Find subarrays with given sum in an array</a></li><li><a href="https://www.techiedelight.com/surpasser-count-each-element-array/">Find the surpasser count for each element of an array</a></li><li><a href="https://www.techiedelight.com/find-maximum-length-sequence-continuous-ones-sliding-window/">Find maximum length sequence of continuous ones (Using Sliding Window)</a></li><li><a href="https://www.techiedelight.com/find-maximum-length-sequence-continuous-ones/">Find maximum length sequence of continuous ones</a></li><li><a href="https://www.techiedelight.com/find-index-that-divides-array-non-empty-subarrays-equal-sum/">Find index that divides an array into two non-empty subarrays of equal sum</a></li><li><a href="https://www.techiedelight.com/calculate-frequency-elements-present-array-specified-range/">Calculate frequency of all elements present in an array of specified range</a></li><li><a href="https://www.techiedelight.com/rearrange-array-positive-negative-numbers-alternate-positions/">Rearrange the array such that it contains positive and negative numbers at alternate positions</a></li><li><a href="https://www.techiedelight.com/find-sorted-triplet-array/">Find a sorted triplet in the given array</a></li><li><a href="https://www.techiedelight.com/shuffle-array-according-to-given-order/">Shuffle an array according to the given order of elements</a></li><li><a href="https://www.techiedelight.com/count-strictly-increasing-sub-arrays/">Count number of strictly increasing sub-arrays in an array</a></li><li><a href="https://www.techiedelight.com/find-duplicates-within-given-range-array/">Find duplicates within given range k in an array</a></li><li><a href="https://www.techiedelight.com/longest-alternating-subarray-problem/">Longest Alternating Subarray Problem</a></li><li><a href="https://www.techiedelight.com/find-minimum-range-given-arrays/">Find minimum range with at-least one element from each of the given arrays</a></li><li><a href="https://www.techiedelight.com/find-longest-subsequence-formed-by-consecutive-integers/">Find longest subsequence formed by consecutive integers</a></li><li><a href="https://www.techiedelight.com/find-elements-array-greater-than-elements-right/">Find all elements in an array that are greater than all elements present to their right</a></li><li><a href="https://www.techiedelight.com/find-missing-number-array-without-extra-space/">Find missing number in array without using extra space</a></li><li><a href="https://www.techiedelight.com/determine-index-element-array/">Determine index of an element in given array which satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/find-minimum-moves-required-converting-array/">Find minimum moves required for converting a given array to an array of zeroes</a></li><li><a href="https://www.techiedelight.com/left-rotate-array-c/">Left rotate an array</a></li><li><a href="https://www.techiedelight.com/right-rotate-an-array-k-times/">Right rotate an array k times</a></li><li><a href="https://www.techiedelight.com/find-maximum-profit-earned-from-at-most-two-stock-transactions/">Find maximum profit earned from at most two stock transactions</a></li><li><a href="https://www.techiedelight.com/find-frequency-element-sorted-array-containing-duplicates/">Find Frequency of each element in a sorted array containing duplicates</a></li><li><a href="https://www.techiedelight.com/find-minimum-maximum-element-array-using-minimum-comparisons/">Find Minimum and Maximum element in an array using minimum comparisons</a></li><li><a href="https://www.techiedelight.com/difference-between-subarray-subsequence-subset/">Difference between Subarray, Subsequence and Subset</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-element-array-single-traversal/">Find odd occurring element in an array in single traversal</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-element-logn-time/">Find odd occurring element in logarithmic time</a></li><li><a href="https://www.techiedelight.com/find-two-odd-occurring-element-array-without-extra-space/">Find two odd occurring elements in an array without using any extra space</a></li><li><a href="https://www.techiedelight.com/check-given-array-represents-min-heap-not/">Check if given array represents min heap or not</a></li><li><a href="https://www.techiedelight.com/find-kth-smallest-element-array/">Find K’th smallest element in an array</a></li><li><a href="https://www.techiedelight.com/find-kth-largest-element-array/">Find K’th largest element in an array</a></li><li><a href="https://www.techiedelight.com/sort-k-sorted-array/">Sort a K-Sorted Array</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-variable-length/">Merge M sorted lists of variable length</a></li><li><a href="https://www.techiedelight.com/find-smallest-range-least-one-element-given-lists/">Find smallest range with at-least one element from each of the given lists</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/">Merge M sorted lists each containing N elements</a></li><li><a href="https://www.techiedelight.com/maximum-sum-of-subsequence-with-no-adjacent-elements/">Find maximum sum of subsequence with no adjacent elements</a></li><li><a href="https://www.techiedelight.com/find-ways-calculate-target-elements-array/">Find ways to calculate a target from elements of specified array</a></li><li><a href="https://www.techiedelight.com/sort-elements-by-their-frequency-and-index/">Sort elements by their frequency and Index</a></li><li><a href="https://www.techiedelight.com/custom-sort-sort-elements-array-order-elements-defined-second-array/">Sort an array based on order defined by another array</a></li><li><a href="https://www.techiedelight.com/inversion-count-array/">Inversion Count of an array</a></li><li><a href="https://www.techiedelight.com/positive-and-negative-integers-segregate/">Segregate positive and negative integers in linear time</a></li><li><a href="https://www.techiedelight.com/find-number-rotations-circularly-sorted-array/">Find number of rotations in a circularly sorted array</a></li><li><a href="https://www.techiedelight.com/search-element-circular-sorted-array/">Search an element in a circular sorted array</a></li><li><a href="https://www.techiedelight.com/find-first-or-last-occurrence-of-a-given-number-sorted-array/">Find first or last occurrence of a given number in a sorted array</a></li><li><a href="https://www.techiedelight.com/count-occurrences-number-sorted-array-duplicates/">Count occurrences of a number in a sorted array with duplicates</a></li><li><a href="https://www.techiedelight.com/find-smallest-missing-element-sorted-array/">Find smallest missing element from a sorted array</a></li><li><a href="https://www.techiedelight.com/find-floor-ceil-number-sorted-array/">Find Floor and Ceil of a number in a sorted array</a></li><li><a href="https://www.techiedelight.com/search-nearly-sorted-array-ologn-time/">Search in a nearly sorted array in logarithmic time</a></li><li><a href="https://www.techiedelight.com/find-number-1s-sorted-binary-array/">Find number of 1’s in a sorted binary array</a></li><li><a href="https://www.techiedelight.com/find-missing-term-sequence-ologn-time/">Find Missing Term in a Sequence in Logarithmic time</a></li><li><a href="https://www.techiedelight.com/find-missing-number-duplicate-elements-array/">Find missing number and duplicate elements in an array</a></li><li><a href="https://www.techiedelight.com/find-peak-element-array/">Find the peak element in an array</a></li><li><a href="https://www.techiedelight.com/find-floor-ceil-number-sorted-array-recursive/">Find Floor and Ceil of a number in a sorted array (Recursive solution)</a></li><li><a href="https://www.techiedelight.com/print-distinct-subsets-given-set/">Print all distinct subsets of a given set</a></li><li><a href="https://www.techiedelight.com/find-two-duplicate-elements-limited-range-array-using-xor/">Find two duplicate elements in a limited range array (using XOR)</a></li><li><a href="https://www.techiedelight.com/combinations-of-words-formed-replacing-given-numbers-corresponding-english-alphabet/">Combinations of words formed by replacing given numbers with corresponding alphabets</a></li><li><a href="https://www.techiedelight.com/0-1-knapsack-problem/">0–1 Knapsack Problem</a></li><li><a href="https://www.techiedelight.com/subset-sum-problem/">Subset sum Problem</a></li><li><a href="https://www.techiedelight.com/partition-problem/">Partition Problem</a></li><li><a href="https://www.techiedelight.com/3-partition-problem/">3-Partition Problem</a></li><li><a href="https://www.techiedelight.com/3-partition-problem-extended-print-all-partitions/">3-partition problem extended | Print all partitions</a></li><li><a href="https://www.techiedelight.com/k-partition-problem-print-all-subsets/">K-Partition Problem | Printing all Partitions</a></li><li><a href="https://www.techiedelight.com/minimum-sum-partition-problem/">Minimum Sum Partition Problem</a></li><li><a href="https://www.techiedelight.com/rot-cutting/">Rod Cutting</a></li><li><a href="https://www.techiedelight.com/longest-alternating-subsequence/">Longest Alternating Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/coin-change-making-problem-unlimited-supply-coins/">Coin change-making problem (unlimited supply of coins)</a></li><li><a href="https://www.techiedelight.com/coin-change-problem-find-total-number-ways-get-denomination-coins/">Coin Change Problem — Find total number of ways to get the denomination of coins</a></li><li><a href="https://www.techiedelight.com/find-maximum-profit-earned-at-most-k-stock-transactions/">Find maximum profit earned from at most K stock transactions</a></li></ol><h3>Backtracking</h3><ol><li><a href="https://www.techiedelight.com/print-possible-solutions-n-queens-problem/">Print all possible solutions to N Queens Problem</a></li><li><a href="https://www.techiedelight.com/print-possible-knights-tours-chessboard/">Print all Possible Knight’s Tours in a chessboard</a></li><li><a href="https://www.techiedelight.com/find-shortest-path-in-maze/">Find Shortest Path in Maze</a></li><li><a href="https://www.techiedelight.com/find-longest-possible-route-matrix/">Find Longest Possible Route in a Matrix</a></li><li><a href="https://www.techiedelight.com/find-path-source-destination-matrix-satisfies-given-constraints/">Find path from source to destination in a matrix that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/find-total-number-unique-paths-maze-source-destination/">Find total number of unique paths in a maze from source to destination</a></li><li><a href="https://www.techiedelight.com/print-all-hamiltonian-path-present-in-a-graph/">Print All Hamiltonian Path present in a graph</a></li><li><a href="https://www.techiedelight.com/print-k-colorable-configurations-graph-vertex-coloring-graph/">Print all k-colorable configurations of the graph (Vertex coloring of graph)</a></li><li><a href="https://www.techiedelight.com/find-permutations-given-string/">Find all Permutations of a given string</a></li><li><a href="https://www.techiedelight.com/find-combinations-of-elements-satisfies-given-constraints/">All combinations of elements satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/">Find all binary strings that can be formed from given wildcard pattern</a></li><li><a href="https://www.techiedelight.com/k-partition-problem-print-all-subsets/">K-Partition Problem | Printing all Partitions</a></li><li><a href="https://www.techiedelight.com/magnet-puzzle/">Magnet Puzzle</a></li><li><a href="https://www.techiedelight.com/find-ways-calculate-target-elements-array/">Find ways to calculate a target from elements of specified array</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-possible-k-swaps/">Find minimum number possible by doing at-most K swaps</a></li><li><a href="https://www.techiedelight.com/determine-pattern-matches-string-not/">Determine if a pattern matches with a string or not</a></li><li><a href="https://www.techiedelight.com/generate-list-of-possible-words-from-a-character-matrix/">Generate list of possible words from a character matrix</a></li><li><a href="https://www.techiedelight.com/find-path-between-vertices-directed-graph/">Find the path between given vertices in a directed graph</a></li><li><a href="https://www.techiedelight.com/find-all-possible-topological-orderings-of-dag/">Find all Possible Topological Orderings of a DAG</a></li><li><a href="https://www.techiedelight.com/print-all-shortest-routes-rectangular-grid/">Print all shortest routes in a rectangular grid</a></li></ol><h3>Binary</h3><ol><li><a href="https://www.techiedelight.com/bit-hacks-part-1-basic/">Bit Hacks — Part 1 (Basic)</a></li><li><a href="https://www.techiedelight.com/bit-hacks-part-2-playing-kth-bit/">Bit Hacks — Part 2 (Playing with k’th bit)</a></li><li><a href="https://www.techiedelight.com/bit-hacks-part-3-playing-rightmost-set-bit-number/">Bit Hacks — Part 3 (Playing with rightmost set bit of a number)</a></li><li><a href="https://www.techiedelight.com/bit-hacks-part-4-playing-letters-english-alphabet/">Bit Hacks — Part 4 (Playing with letters of English alphabet)</a></li><li><a href="https://www.techiedelight.com/bit-hacks-part-5-find-absolute-value-integer-without-branching/">Bit Hacks — Part 5 (Find absolute value of an integer without branching)</a></li><li><a href="https://www.techiedelight.com/bit-hacks-part-6-random-problems/">Bit Hacks — Part 6 (Random Problems)</a></li><li><a href="https://www.techiedelight.com/brian-kernighans-algorithm-count-set-bits-integer/">Brian Kernighan’s Algorithm to count set bits in an integer</a></li><li><a href="https://www.techiedelight.com/round-next-highest-power-2/">Round up to the next highest power of 2</a></li><li><a href="https://www.techiedelight.com/round-previous-power-2/">Round up to the previous power of 2</a></li><li><a href="https://www.techiedelight.com/compute-parity-number-using-lookup-table/">Compute parity of a number using lookup table</a></li><li><a href="https://www.techiedelight.com/count-set-bits-using-lookup-table/">Count set bits using lookup table</a></li><li><a href="https://www.techiedelight.com/find-minimum-maximum-two-integers-without-using-branching/">Find the minimum or maximum of two integers without using branching</a></li><li><a href="https://www.techiedelight.com/multiply-16-bit-integers-using-8-bit-multiplier/">Multiply 16-bit integers using 8-bit multiplier</a></li><li><a href="https://www.techiedelight.com/swap-individual-bits-given-position-integer/">Swap individual bits at given position in an integer</a></li><li><a href="https://www.techiedelight.com/check-given-number-power-of-4/">Check if given number is power of 4 or not</a></li><li><a href="https://www.techiedelight.com/check-given-number-power-8-not/">Check if given number is power of 8 or not</a></li><li><a href="https://www.techiedelight.com/reverse-bits-of-given-integer/">Reverse Bits of a given Integer</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-element-array-single-traversal/">Find odd occurring element in an array in single traversal</a></li><li><a href="https://www.techiedelight.com/find-two-odd-occurring-element-array-without-extra-space/">Find two odd occurring elements in an array without using any extra space</a></li><li><a href="https://www.techiedelight.com/swap-two-bits-given-position-integer/">Swap two bits at given position in an integer</a></li><li><a href="https://www.techiedelight.com/add-binary-representation-two-integers/">Add binary representation of two integers</a></li><li><a href="https://www.techiedelight.com/swap-adjacent-bits-number/">Swap Adjacent Bits of a Number</a></li><li><a href="https://www.techiedelight.com/print-distinct-subsets-given-set/">Print all distinct subsets of a given set</a></li><li><a href="https://www.techiedelight.com/perform-division-two-numbers-without-using-division-operator/">Perform Division of two numbers without using division operator (/)</a></li><li><a href="https://www.techiedelight.com/check-adjacent-bits-set-binary-representation-number/">Check if adjacent bits are set in binary representation of a given number</a></li><li><a href="https://www.techiedelight.com/conditionally-negate-value-without-branching/">Conditionally negate a value without branching</a></li><li><a href="https://www.techiedelight.com/find-two-duplicate-elements-limited-range-array-using-xor/">Find two duplicate elements in a limited range array (using XOR)</a></li><li><a href="https://www.techiedelight.com/reverse-bits-integer-using-lookup-table/">Reverse Bits of an integer using lookup table</a></li><li><a href="https://www.techiedelight.com/find-missing-number-duplicate-elements-array/">Find missing number and duplicate elements in an array</a></li><li><a href="https://www.techiedelight.com/circular-shift-integer-k-positions/">Circular shift on binary representation of an integer by k positions</a></li><li><a href="https://www.techiedelight.com/compute-modulus-division-without-division-modulo-operator/">Compute modulus division without division and modulo operator</a></li><li><a href="https://www.techiedelight.com/solve-problems-without-using-multiplication-division-operators/">Solve given set of problems without using multiplication or division operators</a></li><li><a href="https://www.techiedelight.com/find-xor-two-numbers-without-using-xor-operator/">Find XOR of two numbers without using XOR operator</a></li><li><a href="https://www.techiedelight.com/generate-power-set-given-set/">Generate power set of a given set</a></li><li><a href="https://www.techiedelight.com/huffman-coding/">Huffman Coding</a></li><li><a href="https://www.techiedelight.com/find-missing-number-array-without-extra-space/">Find missing number in array without using extra space</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-element-logn-time/">Find odd occurring element in logarithmic time</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-elements-array/">Find all odd occurring elements in an array having limited range of elements</a></li></ol><h3>Binary Tree</h3><ol><li><a href="https://www.techiedelight.com/check-if-two-binary-trees-are-identical-not-iterative-recursive/">Check if two given binary trees are identical or not</a></li><li><a href="https://www.techiedelight.com/calculate-height-binary-tree-iterative-recursive/">Calculate height of a binary tree</a></li><li><a href="https://www.techiedelight.com/delete-given-binary-tree-iterative-recursive/">Delete given Binary Tree</a></li><li><a href="https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/">Inorder Tree Traversal (Iterative &amp; Recursive Implementation)</a></li><li><a href="https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/">Preorder Tree Traversal (Iterative &amp; Recursive Implementation)</a></li><li><a href="https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/">Postorder Tree Traversal (Iterative &amp; Recursive Implementation)</a></li><li><a href="https://www.techiedelight.com/level-order-traversal-binary-tree/">Level Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/spiral-order-traversal-binary-tree/">Spiral Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/reverse-level-order-traversal-binary-tree/">Reverse Level Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-nodes-binary-tree-specific-order/">Print all nodes of a given binary tree in specific order</a></li><li><a href="https://www.techiedelight.com/print-left-view-of-binary-tree/">Print left view of binary tree</a></li><li><a href="https://www.techiedelight.com/print-bottom-view-of-binary-tree/">Print Bottom View of Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-top-view-binary-tree/">Print Top View of Binary Tree</a></li><li><a href="https://www.techiedelight.com/find-next-node-in-same-level-binary-tree/">Find next node in same level for given node in a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-complete-binary-tree-not/">Check if given binary tree is complete binary tree or not</a></li><li><a href="https://www.techiedelight.com/inplace-convert-a-tree-sum-tree/">In-place convert given binary tree to its sum tree</a></li><li><a href="https://www.techiedelight.com/determine-two-nodes-are-cousins/">Determine if given two nodes are cousins of each other</a></li><li><a href="https://www.techiedelight.com/print-cousins-of-given-node-binary-tree/">Print cousins of given node in a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-sum-tree-not/">Check if given binary tree is a sum tree or not</a></li><li><a href="https://www.techiedelight.com/combinations-of-words-formed-replacing-given-numbers-corresponding-english-alphabet/">Combinations of words formed by replacing given numbers with corresponding alphabets</a></li><li><a href="https://www.techiedelight.com/determine-given-binary-tree-is-subtree-of-another-binary-tree-not/">Determine if given binary tree is a subtree of another binary tree or not</a></li><li><a href="https://www.techiedelight.com/find-diameter-of-a-binary-tree/">Find diameter of a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-symmetric-structure-not/">Check if given binary Tree has symmetric structure or not</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-to-its-mirror/">Convert binary tree to its mirror</a></li><li><a href="https://www.techiedelight.com/determine-binary-tree-can-converted-another-number-swaps-left-right-child/">Check if binary tree can be converted to another by doing any no. of swaps of left &amp; right child</a></li><li><a href="https://www.techiedelight.com/find-lowest-common-ancestor-lca-two-nodes-binary-tree/">Find Lowest Common Ancestor (LCA) of two nodes in a binary tree</a></li><li><a href="https://www.techiedelight.com/print-all-paths-from-root-to-leaf-nodes-binary-tree/">Print all paths from root to leaf nodes in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-ancestors-of-given-node-binary-tree/">Find ancestors of given node in a Binary Tree</a></li><li><a href="https://www.techiedelight.com/distance-between-given-pairs-of-nodes-binary-tree/">Find the distance between given pairs of nodes in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-vertical-sum-given-binary-tree/">Find Vertical Sum in a given Binary Tree</a></li><li><a href="https://www.techiedelight.com/vertical-traversal-binary-tree/">Perform vertical traversal of a binary tree — I</a></li><li><a href="https://www.techiedelight.com/print-nodes-binary-tree-vertical-order/">Perform vertical traversal of a binary tree — II</a></li><li><a href="https://www.techiedelight.com/print-corner-nodes-every-level-binary-tree/">Print corner nodes of every level in binary tree</a></li><li><a href="https://www.techiedelight.com/find-diagonal-sum-given-binary-tree/">Find the diagonal sum of given binary tree</a></li><li><a href="https://www.techiedelight.com/print-diagonal-traversal-binary-tree/">Print Diagonal Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/place-convert-given-binary-tree-to-doubly-linked-list/">In-place convert Binary Tree to Doubly Linked List</a></li><li><a href="https://www.techiedelight.com/sink-nodes-containing-zero-bottom-binary-tree/">Sink nodes containing zero to the bottom of the binary tree</a></li><li><a href="https://www.techiedelight.com/convert-given-binary-tree-to-full-tree-removing-half-nodes/">Convert given binary tree to full tree by removing half nodes</a></li><li><a href="https://www.techiedelight.com/truncate-given-binary-tree-remove-nodes-lie-path-sum-less-k/">Truncate given binary tree to remove nodes which lie on a path having sum less than K</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-root-to-leaf-path-binary-tree/">Find maximum sum root-to-leaf path in a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-is-height-balanced-not/">Check if given binary tree is height balanced or not</a></li><li><a href="https://www.techiedelight.com/find-maximum-width-given-binary-tree/">Find maximum width of given binary tree</a></li><li><a href="https://www.techiedelight.com/convert-normal-binary-tree-left-child-right-sibling-binary-tree/">Convert normal binary tree to Left-child right-sibling binary tree</a></li><li><a href="https://www.techiedelight.com/determine-given-binary-tree-is-a-bst-or-not/">Determine if given Binary Tree is a BST or not</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-to-bst-maintaining-original-structure/">Convert a Binary Tree to BST by maintaining its original structure</a></li><li><a href="https://www.techiedelight.com/invert-binary-tree-recursive-iterative/">Invert a Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-right-view-binary-tree/">Print Right View of a Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-all-paths-from-leaf-to-root-binary-tree/">Print all paths from leaf to root node in given binary tree</a></li><li><a href="https://www.techiedelight.com/print-leaf-to-root-path-binary-tree/">Iteratively print leaf to root path for every leaf node in a binary tree</a></li><li><a href="https://www.techiedelight.com/build-binary-tree-given-parent-array/">Build Binary Tree from given Parent array</a></li><li><a href="https://www.techiedelight.com/find-all-nodes-at-given-distance-from-leaf-nodes-in-a-binary-tree/">Find all nodes at given distance from leaf nodes in a binary tree</a></li><li><a href="https://www.techiedelight.com/count-subtrees-value-nodes-binary-tree/">Count all subtrees having same value of nodes in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-maximum-difference-node-descendants/">Find Maximum Difference Between a Node and its Descendants in a Binary Tree</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-ancestor-matrix/">Construct a Binary Tree from Ancestor Matrix</a></li><li><a href="https://www.techiedelight.com/calculate-height-binary-tree-leaf-nodes-forming-circular-doubly-linked-list/">Calculate height of a binary tree with leaf nodes forming a circular doubly linked list</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-path-between-two-leaves-in-a-binary-tree/">Find maximum sum path between two leaves in a binary tree</a></li><li><a href="https://www.techiedelight.com/fix-binary-tree-one-swap-bst/">Fix a binary tree that is only one swap away from becoming a BST</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-from-inorder-preorder-traversal/">Construct a binary tree from inorder and preorder traversal</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-from-inorder-postorder-traversals/">Construct a binary tree from inorder and postorder traversals</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-from-inorder-level-order-traversals/">Construct a binary tree from inorder and level order sequence</a></li><li><a href="https://www.techiedelight.com/construct-full-binary-tree-from-preorder-sequence-with-leaf-information/">Construct a full binary tree from preorder sequence with leaf node information</a></li><li><a href="https://www.techiedelight.com/construct-full-binary-tree-from-preorder-postorder-sequence/">Construct a full binary tree from a preorder and postorder sequence</a></li><li><a href="https://www.techiedelight.com/set-next-pointer-inorder-successor-binary-tree/">Set next pointer to inorder successor of all nodes in binary tree</a></li><li><a href="https://www.techiedelight.com/print-nodes-between-two-levels-binary-tree/">Efficiently print all nodes between two given levels in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-preorder-traversal-binary-tree-from-inorder-postorder/">Find preorder traversal of a binary tree from its inorder and postorder sequence</a></li><li><a href="https://www.techiedelight.com/difference-between-sum-nodes-odd-even-levels/">Find the difference between sum of all nodes present at odd and even levels in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-size-largest-bst-in-binary-tree/">Find the size of the largest BST in a Binary Tree</a></li><li><a href="https://www.techiedelight.com/link-nodes-each-level-binary-tree/">Link nodes present in each level of a binary tree in the form of a linked list</a></li><li><a href="https://www.techiedelight.com/construct-cartesian-tree-from-inorder-traversal/">Construct a Cartesian Tree from In-order Traversal</a></li><li><a href="https://www.techiedelight.com/implementation-treap-data-structure-cpp-java-insert-search-delete/">Implementation of Treap Data Structure (Insert, Search and Delete)</a></li><li><a href="https://www.techiedelight.com/clone-a-binary-tree-with-random-pointers/">Clone a binary tree with random pointers</a></li><li><a href="https://www.techiedelight.com/threaded-binary-tree-overview-implementation/">Threaded Binary Tree: Overview and Implementation</a></li><li><a href="https://www.techiedelight.com/invert-alternate-levels-perfect-binary-tree/">Invert alternate levels of a perfect binary tree</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-into-doubly-linked-list/">Convert a Binary Tree into a Doubly Linked List in Spiral Order</a></li><li><a href="https://www.techiedelight.com/check-binary-tree-is-min-heap/">Check if a binary tree is a min-heap or not</a></li><li><a href="https://www.techiedelight.com/determine-binary-tree-satisfy-height-balanced-property-red-black-tree/">Determine if a binary tree satisfy the height-balanced property of red–black tree</a></li><li><a href="https://www.techiedelight.com/depth-first-search-dfs-vs-breadth-first-search-bfs/">Depth first search (DFS) vs Breadth first search (BFS)</a></li></ol><h3>BST</h3><ol><li><a href="https://www.techiedelight.com/insertion-in-bst/">Insertion in BST</a></li><li><a href="https://www.techiedelight.com/search-given-key-in-bst/">Search given key in BST</a></li><li><a href="https://www.techiedelight.com/deletion-from-bst/">Deletion from BST</a></li><li><a href="https://www.techiedelight.com/construct-balanced-bst-given-keys/">Construct balanced BST from given keys</a></li><li><a href="https://www.techiedelight.com/determine-given-binary-tree-is-a-bst-or-not/">Determine if given Binary Tree is a BST or not</a></li><li><a href="https://www.techiedelight.com/check-given-keys-represents-same-bsts-not-without-building-bst/">Check if given keys represents same BSTs or not without building the BST</a></li><li><a href="https://www.techiedelight.com/find-inorder-predecessor-given-key-bst/">Find inorder predecessor for given key in a BST</a></li><li><a href="https://www.techiedelight.com/find-lowest-common-ancestor-lca-two-nodes-bst/">Find Lowest Common Ancestor (LCA) of two nodes in a Binary Search Tree</a></li><li><a href="https://www.techiedelight.com/find-kth-smallest-largest-element-bst/">Find K’th smallest and K’th largest element in BST</a></li><li><a href="https://www.techiedelight.com/floor-ceil-bst-iterative-recursive/">Floor and Ceil in a Binary Search Tree</a></li><li><a href="https://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/">Find optimal cost to construct binary search tree</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-to-bst-maintaining-original-structure/">Convert a Binary Tree to BST by maintaining its original structure</a></li><li><a href="https://www.techiedelight.com/remove-nodes-bst-keys-outside-valid-range/">Remove nodes from BST that have keys outside the valid range</a></li><li><a href="https://www.techiedelight.com/find-pair-with-given-sum-bst/">Find a pair with given sum in a BST</a></li><li><a href="https://www.techiedelight.com/find-inorder-successor-given-key-bst/">Find inorder successor for given key in a BST</a></li><li><a href="https://www.techiedelight.com/replace-every-element-array-least-greater-element-right/">Replace every element of an array with the least greater element on its right</a></li><li><a href="https://www.techiedelight.com/fix-binary-tree-one-swap-bst/">Fix a binary tree that is only one swap away from becoming a BST</a></li><li><a href="https://www.techiedelight.com/update-every-key-bst-contain-sum-greater-keys/">Update every key in BST to contain sum of all greater keys</a></li><li><a href="https://www.techiedelight.com/check-sequence-represents-preorder-traversal-bst/">Check if a given sequence represents preorder traversal of a BST</a></li><li><a href="https://www.techiedelight.com/build-binary-search-tree-from-postorder-sequence/">Build a Binary Search Tree from a Postorder Sequence</a></li><li><a href="https://www.techiedelight.com/build-binary-search-tree-from-preorder-sequence/">Build a Binary Search Tree from a Preorder Sequence</a></li><li><a href="https://www.techiedelight.com/find-triplet-with-given-sum-bst/">Find a triplet with given sum in a BST</a></li><li><a href="https://www.techiedelight.com/count-subtrees-bst-whose-nodes-within-range/">Count subtrees in a BST whose nodes lies within a given range</a></li><li><a href="https://www.techiedelight.com/merge-two-bsts-into-doubly-linked-list-sorted-order/">Merge two BSTs into a doubly linked list in sorted order</a></li><li><a href="https://www.techiedelight.com/construct-height-balanced-bst-from-unbalanced-bst/">Construct a height-balanced BST from an unbalanced BST</a></li><li><a href="https://www.techiedelight.com/find-size-largest-bst-in-binary-tree/">Find the size of the largest BST in a Binary Tree</a></li><li><a href="https://www.techiedelight.com/convert-binary-search-tree-into-min-heap/">Convert a Binary Search Tree into a Min Heap</a></li><li><a href="https://www.techiedelight.com/construct-height-balanced-bst-from-sorted-doubly-linked-list/">Construct a Height-Balanced BST from a Sorted Doubly Linked List</a></li></ol><h3>Divide &amp; Conquer</h3><ol><li><a href="https://www.techiedelight.com/binary-search/">Binary Search Algorithm</a></li><li><a href="https://www.techiedelight.com/find-number-rotations-circularly-sorted-array/">Find number of rotations in a circularly sorted array</a></li><li><a href="https://www.techiedelight.com/search-element-circular-sorted-array/">Search an element in a circular sorted array</a></li><li><a href="https://www.techiedelight.com/find-first-or-last-occurrence-of-a-given-number-sorted-array/">Find first or last occurrence of a given number in a sorted array</a></li><li><a href="https://www.techiedelight.com/count-occurrences-number-sorted-array-duplicates/">Count occurrences of a number in a sorted array with duplicates</a></li><li><a href="https://www.techiedelight.com/find-smallest-missing-element-sorted-array/">Find smallest missing element from a sorted array</a></li><li><a href="https://www.techiedelight.com/find-floor-ceil-number-sorted-array/">Find Floor and Ceil of a number in a sorted array</a></li><li><a href="https://www.techiedelight.com/search-nearly-sorted-array-ologn-time/">Search in a nearly sorted array in logarithmic time</a></li><li><a href="https://www.techiedelight.com/find-number-1s-sorted-binary-array/">Find number of 1’s in a sorted binary array</a></li><li><a href="https://www.techiedelight.com/find-peak-element-array/">Find the peak element in an array</a></li><li><a href="https://www.techiedelight.com/maximum-sum-subarray-using-divide-conquer/">Maximum Sum Subarray using Divide &amp; Conquer</a></li><li><a href="https://www.techiedelight.com/power-function-implementation-recursive-iterative/">Efficiently implement a power function</a></li><li><a href="https://www.techiedelight.com/find-missing-term-sequence-ologn-time/">Find Missing Term in a Sequence in Logarithmic time</a></li><li><a href="https://www.techiedelight.com/division-two-numbers-using-binary-search-algorithm/">Division of Two Numbers using Binary Search Algorithm</a></li><li><a href="https://www.techiedelight.com/find-floor-ceil-number-sorted-array-recursive/">Find Floor and Ceil of a number in a sorted array (Recursive solution)</a></li><li><a href="https://www.techiedelight.com/find-frequency-element-sorted-array-containing-duplicates/">Find Frequency of each element in a sorted array containing duplicates</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-element-logn-time/">Find odd occurring element in logarithmic time</a></li><li><a href="https://www.techiedelight.com/ternary-search-vs-binary-search/">Ternary Search vs Binary search</a></li><li><a href="https://www.techiedelight.com/exponential-search/">Exponential search</a></li><li><a href="https://www.techiedelight.com/unbounded-binary-search/">Unbounded Binary Search</a></li><li><a href="https://www.techiedelight.com/interpolation-search/">Interpolation search</a></li><li><a href="https://www.techiedelight.com/merge-sort/">Merge Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/quicksort/">QuickSort Algorithm</a></li></ol><h3>Dynamic Programming</h3><ol><li><a href="https://www.techiedelight.com/introduction-dynamic-programming/">Introduction to Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence/">Longest Common Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence-lcs-space-optimized-version/">Longest Common Subsequence | Space optimized version</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence-of-k-sequences/">Longest Common Subsequence of K-sequences</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence-finding-lcs/">Longest Common Subsequence | Finding all LCS</a></li><li><a href="https://www.techiedelight.com/longest-common-substring-problem/">Longest Common Substring Problem</a></li><li><a href="https://www.techiedelight.com/longest-palindromic-subsequence-using-dynamic-programming/">Longest Palindromic Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-repeated-subsequence-problem/">Longest Repeated Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/implement-diff-utility/">Implement Diff Utility</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-introduction-scs-length/">Shortest Common Supersequence Problem</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-finding-scs/">Shortest Common Supersequence | Finding all SCS</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-using-lcs/">Shortest Common Supersequence Problem using LCS</a></li><li><a href="https://www.techiedelight.com/longest-increasing-subsequence-using-dynamic-programming/">Longest Increasing Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-decreasing-subsequence-problem/">Longest Decreasing Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-bitonic-subsequence/">Longest Bitonic Subsequence</a></li><li><a href="https://www.techiedelight.com/increasing-subsequence-with-maximum-sum/">Increasing Subsequence with Maximum Sum</a></li><li><a href="https://www.techiedelight.com/levenshtein-distance-edit-distance-problem/">The Levenshtein Distance (Edit Distance) Problem</a></li><li><a href="https://www.techiedelight.com/find-size-largest-square-sub-matrix-1s-present-given-binary-matrix/">Find size of largest square sub-matrix of 1’s present in given binary matrix</a></li><li><a href="https://www.techiedelight.com/matrix-chain-multiplication/">Matrix Chain Multiplication</a></li><li><a href="https://www.techiedelight.com/find-minimum-cost-reach-last-cell-matrix-first-cell/">Find the minimum cost to reach last cell of the matrix from its first cell</a></li><li><a href="https://www.techiedelight.com/find-longest-sequence-formed-adjacent-numbers-matrix/">Find longest sequence formed by adjacent numbers in the matrix</a></li><li><a href="https://www.techiedelight.com/counting-paths-on-grid-to-reach-destination-cell/">Count number of paths in a matrix with given cost to reach destination cell</a></li><li><a href="https://www.techiedelight.com/0-1-knapsack-problem/">0–1 Knapsack Problem</a></li><li><a href="https://www.techiedelight.com/maximize-value-of-the-expression/">Maximize value of the expression</a></li><li><a href="https://www.techiedelight.com/partition-problem/">Partition Problem</a></li><li><a href="https://www.techiedelight.com/subset-sum-problem/">Subset sum Problem</a></li><li><a href="https://www.techiedelight.com/3-partition-problem/">3-Partition Problem</a></li><li><a href="https://www.techiedelight.com/minimum-sum-partition-problem/">Minimum Sum Partition Problem</a></li><li><a href="https://www.techiedelight.com/rot-cutting/">Rod Cutting</a></li><li><a href="https://www.techiedelight.com/maximum-product-rod-cutting/">Maximum Product Rod Cutting</a></li><li><a href="https://www.techiedelight.com/coin-change-making-problem-unlimited-supply-coins/">Coin change-making problem (unlimited supply of coins)</a></li><li><a href="https://www.techiedelight.com/coin-change-problem-find-total-number-ways-get-denomination-coins/">Coin Change Problem — Find total number of ways to get the denomination of coins</a></li><li><a href="https://www.techiedelight.com/total-possible-solutions-linear-equation-k-variables/">Total possible solutions to linear equation of k variables</a></li><li><a href="https://www.techiedelight.com/longest-alternating-subsequence/">Longest Alternating Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/count-number-times-pattern-appears-given-string-subsequence/">Count number of times a pattern appears in given string as a subsequence</a></li><li><a href="https://www.techiedelight.com/collect-maximum-points-matrix-satisfying-given-constraints/">Collect maximum points in a matrix by satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/find-n-digit-binary-strings-without-consecutive-1s/">Find all N-digit binary strings without any consecutive 1’s</a></li><li><a href="https://www.techiedelight.com/count-total-possible-combinations-n-digit-numbers-mobile-keypad/">Count total possible combinations of N-digit numbers in a mobile keypad</a></li><li><a href="https://www.techiedelight.com/word-break-problem/">Word Break Problem</a></li><li><a href="https://www.techiedelight.com/determine-minimal-adjustment-cost-array/">Determine Minimal Adjustment Cost of an Array</a></li><li><a href="https://www.techiedelight.com/check-given-string-k-palindrome-not/">Check if a string is K-Palindrome or not</a></li><li><a href="https://www.techiedelight.com/total-ways-sum-with-n-throws-dice-having-k-faces/">Find total ways to achieve given sum with n throws of dice having k faces</a></li><li><a href="https://www.techiedelight.com/wildcard-pattern-matching/">Wildcard Pattern Matching</a></li><li><a href="https://www.techiedelight.com/find-ways-fill-n-x-4-matrix-with-1-x-4-tiles/">Find number of ways to fill a N x 4 matrix with 1 x 4 tiles</a></li><li><a href="https://www.techiedelight.com/reach-bottom-right-corner-matrix-exactly-k-turns/">Ways to reach the bottom-right corner of a matrix with exactly k turns allowed</a></li><li><a href="https://www.techiedelight.com/weighted-interval-scheduling-problem/">Weighted Interval Scheduling Problem</a></li><li><a href="https://www.techiedelight.com/box-stacking-problem/">Box Stacking Problem</a></li><li><a href="https://www.techiedelight.com/find-total-ways-reach-nth-stair-with-atmost-m-steps/">Find total ways to reach the n’th stair with at-most m steps</a></li><li><a href="https://www.techiedelight.com/find-total-ways-to-reach-nth-stair/">Find total ways to reach the n’th stair from the bottom</a></li><li><a href="https://www.techiedelight.com/activity-selection-problem-using-dynamic-programming/">Activity Selection Problem</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-deletions-convert-string-into-palindrome/">Find minimum number of deletions required to convert a string into palindrome</a></li><li><a href="https://www.techiedelight.com/calculate-minimum-cost-to-reach-destination-city-from-source-city/">Calculate minimum cost to reach destination city from source city</a></li><li><a href="https://www.techiedelight.com/pots-gold-game-dynamic-programming/">Pots of Gold Game Problem</a></li><li><a href="https://www.techiedelight.com/find-minimum-cuts-needed-palindromic-partition-string/">Find minimum cuts needed for palindromic partition of a string</a></li><li><a href="https://www.techiedelight.com/weighted-interval-scheduling-problem-using-lis/">Weighted Interval Scheduling using LIS algorithm</a></li><li><a href="https://www.techiedelight.com/find-minimum-jumps-required-reach-destination/">Find minimum jumps required to reach the destination</a></li><li><a href="https://www.techiedelight.com/probability-alive-after-taking-n-steps-island/">Find probability that a person is alive after taking N steps on the island</a></li><li><a href="https://www.techiedelight.com/maximum-sum-of-subsequence-with-no-adjacent-elements/">Find maximum sum of subsequence with no adjacent elements</a></li><li><a href="https://www.techiedelight.com/maximum-length-snake-sequence/">Maximum Length Snake Sequence</a></li><li><a href="https://www.techiedelight.com/calculate-size-largest-plus-1s-binary-matrix/">Calculate size of the largest plus of 1’s in binary matrix</a></li><li><a href="https://www.techiedelight.com/longest-increasing-subsequence-using-lcs/">Longest Increasing Subsequence using LCS</a></li><li><a href="https://www.techiedelight.com/find-maximum-profit-earned-at-most-k-stock-transactions/">Find maximum profit earned from at most K stock transactions</a></li><li><a href="https://www.techiedelight.com/count-all-paths-matrix-from-first-cell-to-last-cell/">Count all paths in a matrix from first cell to last cell</a></li><li><a href="https://www.techiedelight.com/check-string-matches-with-wildcard-pattern/">Check if a string matches with a given wildcard pattern</a></li><li><a href="https://www.techiedelight.com/check-string-interleaving-two-given-strings/">Check if given string is interleaving of two other given strings</a></li><li><a href="https://www.techiedelight.com/find-employees-who-reports-to-manager/">Find all employees who directly or indirectly reports to a manager</a></li><li><a href="https://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/">Find optimal cost to construct binary search tree</a></li><li><a href="https://www.techiedelight.com/maximum-sum-of-subsequence-with-no-adjacent-elements/">Find maximum sum of subsequence with no adjacent elements</a></li><li><a href="https://www.techiedelight.com/maximum-subarray-problem-kadanes-algorithm/">Maximum Sum Subarray Problem (Kadane’s Algorithm)</a></li><li><a href="https://www.techiedelight.com/longest-alternating-subarray-problem/">Longest Alternating Subarray Problem</a></li><li><a href="https://www.techiedelight.com/collect-maximum-value-coins-matrix/">Collect maximum value of coins in a matrix</a></li><li><a href="https://www.techiedelight.com/find-length-longest-path-matrix-consecutive-characters/">Find length of longest path in the matrix with consecutive characters</a></li><li><a href="https://www.techiedelight.com/find-ways-calculate-target-elements-array/">Find ways to calculate a target from elements of specified array</a></li><li><a href="https://www.techiedelight.com/calculate-sum-elements-sub-matrix-constant-time/">Calculate sum of all elements in a sub-matrix in constant time</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-submatrix-in-given-matrix/">Find maximum sum K x K sub-matrix in a given M x N matrix</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-submatrix-present-given-matrix/">Find maximum sum submatrix present in a given matrix</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-bellman-ford-algorithm/">Single-Source Shortest Paths — Bellman Ford Algorithm</a></li><li><a href="https://www.techiedelight.com/pairs-shortest-paths-floyd-warshall-algorithm/">All-Pairs Shortest Paths — Floyd Warshall Algorithm</a></li></ol><h3>Graph</h3><ol><li><a href="https://www.techiedelight.com/terminology-and-representations-of-graphs/">Terminology and Representations of Graphs</a></li><li>Graph Implementation — <a href="https://www.techiedelight.com/implement-graph-data-structure-c/">C</a>, <a href="https://www.techiedelight.com/graph-implementation-c-without-using-stl/">C++</a>, <a href="https://www.techiedelight.com/graph-implementation-using-stl/">C++ (STL)</a>, <a href="https://www.techiedelight.com/graph-implementation-java-using-collections/">Java (Collections)</a>, <a href="https://www.techiedelight.com/graph-implementation-python/">Python</a></li><li><a href="https://www.techiedelight.com/breadth-first-search/">Breadth First Search (BFS) Algorithm</a></li><li><a href="https://www.techiedelight.com/depth-first-search/">Depth First Search (DFS) Algorithm</a></li><li><a href="https://www.techiedelight.com/depth-first-search-dfs-vs-breadth-first-search-bfs/">Depth first search (DFS) vs Breadth first search (BFS)</a></li><li><a href="https://www.techiedelight.com/arrival-departure-time-vertices-dfs/">Arrival and Departure Time of Vertices in DFS</a></li><li><a href="https://www.techiedelight.com/types-edges-involved-dfs-relation/">Types of edges involved in DFS and relation between them</a></li><li><a href="https://www.techiedelight.com/bipartite-graph/">Bipartite Graph</a></li><li><a href="https://www.techiedelight.com/determine-given-graph-bipartite-graph-using-dfs/">Determine if a given graph is Bipartite Graph using DFS</a></li><li><a href="https://www.techiedelight.com/min-throws-required-to-win-snake-and-ladder-game/">Snake and Ladder Problem</a></li><li><a href="https://www.techiedelight.com/topological-sorting-dag/">Topological Sorting in a DAG</a></li><li><a href="https://www.techiedelight.com/kahn-topological-sort-algorithm/">Kahn’s Topological Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/transitive-closure-graph/">Transitive Closure of a Graph</a></li><li><a href="https://www.techiedelight.com/check-undirected-graph-contains-cycle-not/">Check if an undirected graph contains cycle or not</a></li><li><a href="https://www.techiedelight.com/total-paths-in-digraph-from-source-to-destination-m-edges/">Total paths in given digraph from given source to destination having exactly m edges</a></li><li><a href="https://www.techiedelight.com/determine-undirected-graph-tree-acyclic-connected-graph/">Determine if an undirected graph is a Tree (Acyclic Connected Graph)</a></li><li><a href="https://www.techiedelight.com/2-edge-connectivity-graph/">2-Edge Connectivity in the graph</a></li><li><a href="https://www.techiedelight.com/2-vertex-connectivity-graph/">2-Vertex Connectivity in the graph</a></li><li><a href="https://www.techiedelight.com/check-given-digraph-dag-directed-acyclic-graph-not/">Check if given digraph is a DAG (Directed Acyclic Graph) or not</a></li><li><a href="https://www.techiedelight.com/disjoint-set-data-structure-union-find-algorithm/">Disjoint-Set Data Structure (Union-Find Algorithm)</a></li><li><a href="https://www.techiedelight.com/chess-knight-problem-find-shortest-path-source-destination/">Chess Knight Problem — Find Shortest path from source to destination</a></li><li><a href="https://www.techiedelight.com/check-given-graph-strongly-connected-not/">Check if given Graph is Strongly Connected or not</a></li><li><a href="https://www.techiedelight.com/check-graph-strongly-connected-one-dfs-traversal/">Check if given Graph is Strongly Connected or not using one DFS Traversal</a></li><li><a href="https://www.techiedelight.com/union-find-algorithm-cycle-detection-graph/">Union-Find Algorithm for Cycle Detection in undirected graph</a></li><li><a href="https://www.techiedelight.com/kruskals-algorithm-for-finding-minimum-spanning-tree/">Kruskal’s Algorithm for finding Minimum Spanning Tree</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-dijkstras-algorithm/">Single-Source Shortest Paths — Dijkstra’s Algorithm</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-bellman-ford-algorithm/">Single-Source Shortest Paths — Bellman Ford Algorithm</a></li><li><a href="https://www.techiedelight.com/pairs-shortest-paths-floyd-warshall-algorithm/">All-Pairs Shortest Paths — Floyd Warshall Algorithm</a></li><li><a href="https://www.techiedelight.com/cost-of-shortest-path-in-dag-using-one-pass-of-bellman-ford/">Find Cost of Shortest Path in DAG using one pass of Bellman-Ford</a></li><li><a href="https://www.techiedelight.com/least-cost-path-weighted-digraph-using-bfs/">Least Cost Path in Weighted Digraph using BFS</a></li><li><a href="https://www.techiedelight.com/maximum-cost-path-graph-source-destination/">Find maximum cost path in graph from given source to destination</a></li><li><a href="https://www.techiedelight.com/determine-negative-weight-cycle-graph/">Determine negative-weight cycle in a graph</a></li><li><a href="https://www.techiedelight.com/least-cost-path-digraph-source-destination-m-edges/">Least cost path in given digraph from given source to destination having exactly m edges</a></li><li><a href="https://www.techiedelight.com/find-path-between-vertices-directed-graph/">Find the path between given vertices in a directed graph</a></li><li><a href="https://www.techiedelight.com/find-all-possible-topological-orderings-of-dag/">Find all Possible Topological Orderings of a DAG</a></li><li><a href="https://www.techiedelight.com/find-correct-order-alphabets-dictionary-ancient-origin/">Find the correct order of alphabets in a given dictionary of ancient origin</a></li><li><a href="https://www.techiedelight.com/find-cost-longest-path-dag/">Find longest path in a Directed Acyclic Graph (DAG)</a></li><li><a href="https://www.techiedelight.com/construct-directed-graph-from-undirected-graph/">Construct a directed graph from undirected graph that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/print-k-colorable-configurations-graph-vertex-coloring-graph/">Print all k-colorable configurations of the graph (Vertex coloring of graph)</a></li><li><a href="https://www.techiedelight.com/print-all-hamiltonian-path-present-in-a-graph/">Print All Hamiltonian Path present in a graph</a></li><li><a href="https://www.techiedelight.com/greedy-coloring-graph/">Graph Coloring Problem</a></li></ol><h3>Greedy</h3><ol><li><a href="https://www.techiedelight.com/activity-selection-problem/">Activity Selection Problem</a></li><li><a href="https://www.techiedelight.com/huffman-coding/">Huffman Coding</a></li><li><a href="https://www.techiedelight.com/job-sequencing-problem-deadlines/">Job Sequencing Problem with Deadlines</a></li><li><a href="https://www.techiedelight.com/greedy-coloring-graph/">Graph Coloring Problem</a></li><li><a href="https://www.techiedelight.com/kruskals-algorithm-for-finding-minimum-spanning-tree/">Kruskal’s Algorithm for finding Minimum Spanning Tree</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-dijkstras-algorithm/">Single-Source Shortest Paths — Dijkstra’s Algorithm</a></li><li><a href="https://www.techiedelight.com/shortest-superstring-problem/">Shortest Superstring Problem</a></li></ol><h3>Heap</h3><ol><li><a href="https://www.techiedelight.com/introduction-priority-queues-using-binary-heaps/">Introduction to Priority Queues using Binary Heaps</a></li><li>Min Heap and Max Heap Implementation — <a href="https://www.techiedelight.com/min-heap-max-heap-implementation-c/">C++</a>, <a href="https://www.techiedelight.com/min-heap-max-heap-implementation-in-java/">Java</a></li><li><a href="https://www.techiedelight.com/heap-sort-place-place-implementation-c-c/">Heap Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/check-given-array-represents-min-heap-not/">Check if given array represents min heap or not</a></li><li><a href="https://www.techiedelight.com/convert-max-heap-min-heap-linear-time/">Convert Max Heap to Min Heap in linear time</a></li><li><a href="https://www.techiedelight.com/find-kth-largest-element-array/">Find K’th largest element in an array</a></li><li><a href="https://www.techiedelight.com/sort-k-sorted-array/">Sort a K-Sorted Array</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-variable-length/">Merge M sorted lists of variable length</a></li><li><a href="https://www.techiedelight.com/efficiently-merge-k-sorted-linked-lists/">Merge K sorted linked lists</a></li><li><a href="https://www.techiedelight.com/find-kth-smallest-element-array/">Find K’th smallest element in an array</a></li><li><a href="https://www.techiedelight.com/find-smallest-range-least-one-element-given-lists/">Find smallest range with at-least one element from each of the given lists</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/">Merge M sorted lists each containing N elements</a></li><li><a href="https://www.techiedelight.com/first-k-non-repeating-characters-string/">Find first k non-repeating characters in a string in single traversal</a></li><li><a href="https://www.techiedelight.com/find-first-k-maximum-occurring-words-given-set-strings/">Find first k maximum occurring words in given set of strings</a></li><li><a href="https://www.techiedelight.com/implementation-treap-data-structure-cpp-java-insert-search-delete/">Implementation of Treap Data Structure (Insert, Search and Delete)</a></li><li><a href="https://www.techiedelight.com/convert-binary-search-tree-into-min-heap/">Convert a Binary Search Tree into a Min Heap</a></li><li><a href="https://www.techiedelight.com/check-binary-tree-is-min-heap/">Check if a binary tree is a min-heap or not</a></li><li><a href="https://www.techiedelight.com/huffman-coding/">Huffman Coding</a></li><li><a href="https://www.techiedelight.com/external-merge-sort/">External Merge Sort Algorithm</a></li></ol><h3>Linked List</h3><ol><li><a href="https://www.techiedelight.com/introduction-linked-lists/">Introduction to Linked Lists</a></li><li>Linked List Implementation — <a href="https://www.techiedelight.com/linked-list-implementation-part-1/">C</a>, <a href="https://www.techiedelight.com/linked-list-implementation-cpp/">C++</a>, <a href="https://www.techiedelight.com/linked-list-implementation-java/">Java</a>, <a href="https://www.techiedelight.com/linked-list-implementation-python/">Python</a></li><li><a href="https://www.techiedelight.com/linked-list-implementation-part-2/">Linked List | Insertion at Tail</a></li><li><a href="https://www.techiedelight.com/static-linked-list-c/">Static Linked List</a></li><li><a href="https://www.techiedelight.com/clone-given-linked-list/">Clone given Linked List</a></li><li><a href="https://www.techiedelight.com/delete-linked-list/">Delete Linked List</a></li><li><a href="https://www.techiedelight.com/pop-operation-in-linked-list/">Pop operation in linked list</a></li><li><a href="https://www.techiedelight.com/sorted-insert-in-linked-list/">Insert given node into the correct sorted position in the given sorted linked list</a></li><li><a href="https://www.techiedelight.com/given-linked-list-change-sorted-order/">Rearrange linked list in increasing order (Sort linked list)</a></li><li><a href="https://www.techiedelight.com/split-nodes-given-linked-list-front-back-halves/">Split the nodes of the given linked list into front and back halves</a></li><li><a href="https://www.techiedelight.com/remove-duplicates-sorted-linked-list/">Remove duplicates from a sorted linked list</a></li><li><a href="https://www.techiedelight.com/move-front-node-given-list-front-another-list/">Move front node of the given list to the front of the another list</a></li><li><a href="https://www.techiedelight.com/move-even-nodes-to-end-of-list-in-reverse-order/">Move even nodes to the end of the list in reverse order</a></li><li><a href="https://www.techiedelight.com/split-linked-list-into-two-lists-list-containing-alternating-elements/">Split given linked list into two lists where each list containing alternating elements from it</a></li><li><a href="https://www.techiedelight.com/merge-alternate-nodes-two-linked-lists/">Construct a linked list by merging alternate nodes of two given lists</a></li><li><a href="https://www.techiedelight.com/merge-sort-singly-linked-list/">Merge Sort Algorithm for Singly Linked List</a></li><li><a href="https://www.techiedelight.com/merge-given-sorted-linked-lists/">Merge two sorted linked lists into one</a></li><li><a href="https://www.techiedelight.com/efficiently-merge-k-sorted-linked-lists/">Merge K sorted linked lists</a></li><li><a href="https://www.techiedelight.com/intersection-two-given-sorted-linked-lists/">Intersection of two given sorted linked lists</a></li><li><a href="https://www.techiedelight.com/reverse-linked-list-part-1-iterative-solution/">Reverse Linked List (Iterative Solution)</a></li><li><a href="https://www.techiedelight.com/reverse-linked-list-part-2-recursive-solution/">Reverse Linked List (Recursive Solution)</a></li><li><a href="https://www.techiedelight.com/reverse-every-k-nodes-of-a-linked-list/">Reverse every group of k nodes in given linked list</a></li><li><a href="https://www.techiedelight.com/find-kth-node-from-the-end-linked-list/">Find K’th node from the end in a linked list</a></li><li><a href="https://www.techiedelight.com/merge-alternate-nodes-two-linked-lists-first-list/">Merge alternate nodes of two linked lists into the first list</a></li><li><a href="https://www.techiedelight.com/merge-two-sorted-linked-lists-end/">Merge two sorted linked lists from their end</a></li><li><a href="https://www.techiedelight.com/delete-every-n-nodes-linked-list-skipping-m-nodes/">Delete every N nodes in a linked list after skipping M nodes</a></li><li><a href="https://www.techiedelight.com/rearrange-linked-list-specific-manner-linear-time/">Rearrange linked list in specific manner in linear time</a></li><li><a href="https://www.techiedelight.com/check-if-linked-list-is-palindrome/">Check if linked list is palindrome or not</a></li><li><a href="https://www.techiedelight.com/move-last-node-to-front-linked-list/">Move last node to front in a given Linked List</a></li><li><a href="https://www.techiedelight.com/rearrange-the-linked-list-specific-manner/">Rearrange the linked list in specific manner</a></li><li><a href="https://www.techiedelight.com/detect-cycle-linked-list-floyds-cycle-detection-algorithm/">Detect Cycle in a linked list (Floyd’s Cycle Detection Algorithm)</a></li><li><a href="https://www.techiedelight.com/sort-linked-list-containing-0s-1s-2s/">Sort linked list containing 0’s, 1’s and 2’s</a></li><li><a href="https://www.techiedelight.com/stack-implementation-using-linked-list/">Implement Stack using Linked List</a></li><li><a href="https://www.techiedelight.com/queue-implementation-using-linked-list/">Implement Queue using Linked List</a></li><li><a href="https://www.techiedelight.com/remove-duplicates-linked-list/">Remove duplicates from a linked list</a></li><li><a href="https://www.techiedelight.com/rearrange-linked-list-alternating-high-low-values/">Rearrange the linked list so that it has alternating high, low values</a></li><li><a href="https://www.techiedelight.com/rearrange-linked-list-separating-odd-nodes-even/">Rearrange a Linked List by Separating Odd Nodes from the Even Ones</a></li><li><a href="https://www.techiedelight.com/calculate-height-binary-tree-leaf-nodes-forming-circular-doubly-linked-list/">Calculate height of a binary tree with leaf nodes forming a circular doubly linked list</a></li><li><a href="https://www.techiedelight.com/xor-linked-list-overview-implementation-c-cpp/">XOR Linked List: Overview and Implementation</a></li><li><a href="https://www.techiedelight.com/convert-multilevel-linked-list-singly/">Convert a multilevel linked list to a singly linked list</a></li><li><a href="https://www.techiedelight.com/recursively-check-linked-list-characters-palindrome-or-not/">Recursively check if linked list of characters is palindrome or not</a></li><li><a href="https://www.techiedelight.com/merge-two-bsts-into-doubly-linked-list-sorted-order/">Merge two BSTs into a doubly linked list in sorted order</a></li><li><a href="https://www.techiedelight.com/remove-redundant-nodes-path-formed-linked-list/">Remove redundant nodes from a path formed by a linked list</a></li><li><a href="https://www.techiedelight.com/add-single-digit-number-linked-list-representing-number/">Add a single-digit number to a linked list representing a number</a></li><li><a href="https://www.techiedelight.com/reverse-alternate-group-k-nodes-linked-list/">Reverse every alternate group of k nodes in a linked list</a></li><li><a href="https://www.techiedelight.com/determine-linked-list-palindrome-or-not/">Determine if a given linked list is a palindrome or not</a></li><li><a href="https://www.techiedelight.com/sort-doubly-linked-list-merge-sort/">Sort a Doubly Linked List using Merge Sort</a></li><li><a href="https://www.techiedelight.com/reverse-doubly-linked-list/">Reverse a Doubly Linked List</a></li><li><a href="https://www.techiedelight.com/pairwise-swap-adjacent-nodes-linked-list/">Pairwise swap adjacent nodes of a linked list</a></li><li><a href="https://www.techiedelight.com/flatten-linked-list/">Flatten a linked list</a></li><li><a href="https://www.techiedelight.com/check-linked-list-strings-palindromic/">Check if a Linked List of String is Palindromic</a></li><li><a href="https://www.techiedelight.com/flatten-multilevel-linked-list/">Flatten a multilevel linked list</a></li><li><a href="https://www.techiedelight.com/construct-height-balanced-bst-from-unbalanced-bst/">Construct a height-balanced BST from an unbalanced BST</a></li><li><a href="https://www.techiedelight.com/swap-kth-node-beginning-with-kth-node-end/">Swap K’th node from beginning with K’th node from end in a Linked List</a></li><li><a href="https://www.techiedelight.com/add-two-linked-lists-without-using-extra-space/">Add two linked lists without using any extra space</a></li><li><a href="https://www.techiedelight.com/clone-a-linked-list-with-random-pointers/">Clone a Linked List with Random Pointers</a></li><li><a href="https://www.techiedelight.com/update-random-pointer-linked-list-node-maximum-node/">Update random pointer for each linked list node to point to the maximum node</a></li><li><a href="https://www.techiedelight.com/link-nodes-each-level-binary-tree/">Link nodes present in each level of a binary tree in the form of a linked list</a></li><li><a href="https://www.techiedelight.com/convert-ternary-tree-doubly-linked-list/">Convert a Ternary Tree to a Doubly Linked List</a></li><li><a href="https://www.techiedelight.com/print-nodes-binary-tree-vertical-order/">Print nodes of a given binary tree in vertical order</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-into-doubly-linked-list/">Convert a Binary Tree into a Doubly Linked List in Spiral Order</a></li><li><a href="https://www.techiedelight.com/construct-height-balanced-bst-from-sorted-doubly-linked-list/">Construct a Height-Balanced BST from a Sorted Doubly Linked List</a></li><li><a href="https://www.techiedelight.com/in-place-merge-two-sorted-linked-lists/">In-place merge two sorted linked lists without modifying links of the first list</a></li><li><a href="https://www.techiedelight.com/reverse-specified-portion-linked-list/">Reverse specified portion of a Linked List</a></li></ol><h3>Matrix</h3><ol><li><a href="https://www.techiedelight.com/print-matrix-spiral-order/">Print Matrix in Spiral Order</a></li><li><a href="https://www.techiedelight.com/create-spiral-matrix-given-array/">Create Spiral Matrix from given array</a></li><li><a href="https://www.techiedelight.com/shift-matrix-elements-1-spiral-order/">Shift all matrix elements by 1 in Spiral Order</a></li><li><a href="https://www.techiedelight.com/find-shortest-path-source-destination-matrix-satisfies-given-constraints/">Find Shortest path from source to destination in a matrix that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/change-elements-row-column-j-matrix-0-cell-j-value-0/">Change all elements of row i and column j in a matrix to 0 if cell (i, j) has value 0</a></li><li><a href="https://www.techiedelight.com/print-matrix-diagonally-positive-slope/">Print diagonal elements of the matrix having positive slope</a></li><li><a href="https://www.techiedelight.com/find-all-paths-from-source-to-destination-in-matrix/">Find all paths from first cell to last cell of a matrix</a></li><li><a href="https://www.techiedelight.com/replace-occurrences-0-not-surrounded-1-binary-matrix/">Replace all occurrences of 0 that are not surrounded by 1 in a binary matrix</a></li><li><a href="https://www.techiedelight.com/place-rotate-matrix-90-degrees-clock-wise-direction/">In-place rotate the matrix by 90 degrees in clock-wise direction</a></li><li><a href="https://www.techiedelight.com/count-negative-elements-present-sorted-matrix/">Count negative elements present in sorted matrix in linear time</a></li><li><a href="https://www.techiedelight.com/report-all-occurrences-of-an-element-in-sorted-matrix/">Report all occurrences of an element in row wise and column wise sorted matrix in linear time</a></li><li><a href="https://www.techiedelight.com/calculate-sum-elements-sub-matrix-constant-time/">Calculate sum of all elements in a sub-matrix in constant time</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-submatrix-in-given-matrix/">Find maximum sum K x K sub-matrix in a given M x N matrix</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-submatrix-present-given-matrix/">Find maximum sum submatrix present in a given matrix</a></li><li><a href="https://www.techiedelight.com/count-the-number-of-islands/">Count the number of islands</a></li><li><a href="https://www.techiedelight.com/flood-fill-algorithm/">Flood Fill Algorithm</a></li><li><a href="https://www.techiedelight.com/find-shortest-safe-route-field-sensors-present/">Find shortest safe route in a field with sensors present</a></li><li><a href="https://www.techiedelight.com/find-occurrences-given-string-character-matrix/">Find all occurrences of given string in a character matrix</a></li><li><a href="https://www.techiedelight.com/lee-algorithm-shortest-path-in-a-maze/">Shortest path in a Maze | Lee Algorithm</a></li><li><a href="https://www.techiedelight.com/check-given-matrix-toeplitz-matrix-not/">Check if given matrix is Toeplitz matrix or not</a></li><li><a href="https://www.techiedelight.com/inplace-rotate-matrix-180-degrees/">In-place rotate the matrix by 180 degrees</a></li><li><a href="https://www.techiedelight.com/fill-binary-matrix-alternating-rectangles-0-1/">Fill Binary Matrix with Alternating Rectangles of 0 and 1</a></li><li><a href="https://www.techiedelight.com/find-common-elements-present-every-row-given-matrix/">Find all common elements present in every row of given matrix</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-ancestor-matrix/">Construct a Binary Tree from Ancestor Matrix</a></li><li><a href="https://www.techiedelight.com/find-common-elements-present-rows-matrix/">Find common elements present in all rows of a matrix</a></li><li><a href="https://www.techiedelight.com/find-index-row-containing-maximum-number-1s-matrix/">Find index of the row containing maximum number of 1’s in a binary matrix</a></li><li><a href="https://www.techiedelight.com/largest-square-sub-matrix-surrounded-by-1s/">Find the largest square sub-matrix which is surrounded by all 1&#39;s</a></li><li><a href="https://www.techiedelight.com/find-minimum-passes-required-convert-negative-values-matrix/">Find minimum passes required to convert all negative values in the matrix</a></li><li><a href="https://www.techiedelight.com/print-spiral-square-matrix-without-extra-space/">Print a spiral square matrix without using any extra space</a></li><li><a href="https://www.techiedelight.com/print-all-shortest-routes-rectangular-grid/">Print all shortest routes in a rectangular grid</a></li><li><a href="https://www.techiedelight.com/find-length-longest-path-matrix-consecutive-characters/">Find length of longest path in the matrix with consecutive characters</a></li><li><a href="https://www.techiedelight.com/collect-maximum-value-coins-matrix/">Collect maximum value of coins in a matrix</a></li><li><a href="https://www.techiedelight.com/young-tableau-insert-search-extract-min-delete-replace/">Young Tableau | Insert, Search, Extract-Min, Delete, Replace</a></li><li><a href="https://www.techiedelight.com/sort-array-using-young-tableau/">Sort an array using Young tableau</a></li><li><a href="https://www.techiedelight.com/find-path-source-destination-matrix-satisfies-given-constraints/">Find path from source to destination in a matrix that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/generate-list-of-possible-words-from-a-character-matrix/">Generate list of possible words from a character matrix</a></li><li><a href="https://www.techiedelight.com/probability-alive-after-taking-n-steps-island/">Find probability that a person is alive after taking N steps on the island</a></li><li><a href="https://www.techiedelight.com/collect-maximum-points-matrix-satisfying-given-constraints/">Collect maximum points in a matrix by satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/counting-paths-on-grid-to-reach-destination-cell/">Count number of paths in a matrix with given cost to reach destination cell</a></li><li><a href="https://www.techiedelight.com/find-longest-sequence-formed-adjacent-numbers-matrix/">Find longest sequence formed by adjacent numbers in the matrix</a></li><li><a href="https://www.techiedelight.com/find-minimum-cost-reach-last-cell-matrix-first-cell/">Find the minimum cost to reach last cell of the matrix from its first cell</a></li><li><a href="https://www.techiedelight.com/reach-bottom-right-corner-matrix-exactly-k-turns/">Ways to reach the bottom-right corner of a matrix with exactly k turns allowed</a></li><li><a href="https://www.techiedelight.com/matrix-chain-multiplication/">Matrix Chain Multiplication</a></li><li><a href="https://www.techiedelight.com/find-size-largest-square-sub-matrix-1s-present-given-binary-matrix/">Find size of largest square sub-matrix of 1’s present in given binary matrix</a></li><li><a href="https://www.techiedelight.com/chess-knight-problem-find-shortest-path-source-destination/">Chess Knight Problem — Find Shortest path from source to destination</a></li><li><a href="https://www.techiedelight.com/find-duplicate-rows-binary-matrix/">Find Duplicate rows in a binary matrix</a></li><li><a href="https://www.techiedelight.com/print-possible-solutions-n-queens-problem/">Print all possible solutions to N Queens Problem</a></li><li><a href="https://www.techiedelight.com/print-possible-knights-tours-chessboard/">Print all Possible Knight’s Tours in a chessboard</a></li><li><a href="https://www.techiedelight.com/find-shortest-path-in-maze/">Find Shortest Path in Maze</a></li><li><a href="https://www.techiedelight.com/find-longest-possible-route-matrix/">Find Longest Possible Route in a Matrix</a></li><li><a href="https://www.techiedelight.com/find-total-number-unique-paths-maze-source-destination/">Find total number of unique paths in a maze from source to destination</a></li><li><a href="https://www.techiedelight.com/calculate-size-largest-plus-1s-binary-matrix/">Calculate size of the largest plus of 1’s in binary matrix</a></li><li><a href="https://www.techiedelight.com/find-maximum-value-choices-indexes/">Find the maximum value of M[c][d] — M[a][b] over all choices of indexes</a></li><li><a href="https://www.techiedelight.com/find-shortest-distance-every-cell-landmine-maze/">Find shortest distance of every cell from landmine in a Maze</a></li><li><a href="https://www.techiedelight.com/find-shortest-route-device-construct-given-string/">Find shortest route in a device to construct the given string</a></li><li><a href="https://www.techiedelight.com/calculate-minimum-cost-to-reach-destination-city-from-source-city/">Calculate minimum cost to reach destination city from source city</a></li><li><a href="https://www.techiedelight.com/count-all-paths-matrix-from-first-cell-to-last-cell/">Count all paths in a matrix from first cell to last cell</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/">Merge M sorted lists each containing N elements</a></li><li><a href="https://www.techiedelight.com/travelling-salesman-problem-using-branch-and-bound/">Travelling Salesman Problem using Branch and Bound</a></li></ol><h3>Puzzles</h3><ol><li><a href="https://www.techiedelight.com/angle-between-hour-minute-hand/">Clock Angle Problem — Find angle between hour and minute hand</a></li><li><a href="https://www.techiedelight.com/add-two-numbers-without-using-addition-operator/">Add two numbers without using addition operator</a></li><li><a href="https://www.techiedelight.com/generate-power-set-given-set/">Generate power set of a given set</a></li><li><a href="https://www.techiedelight.com/implement-power-function-without-using-multiplication-division-operators/">Implement power function without using multiplication and division operators</a></li><li><a href="https://www.techiedelight.com/print-numbers-1-n-without-using-semicolon/">Print all numbers between 1 to N without using semicolon</a></li><li><a href="https://www.techiedelight.com/swap-two-numbers-without-using-third-variable/">Swap two numbers without using third variable</a></li><li><a href="https://www.techiedelight.com/determine-condition-to-print-specific-output/">Determine the if condition to print specific output</a></li><li><a href="https://www.techiedelight.com/maximum-minimum-three-numbers-without-using-conditional-statement-ternary-operator/">Find maximum &amp; minimum of triplet without using conditional statement and ternary operator</a></li><li><a href="https://www.techiedelight.com/numbers-represented-as-sum-of-two-cubes/">Find numbers represented as sum of two cubes for two different pairs</a></li><li><a href="https://www.techiedelight.com/print-hello-world-empty-main-function/">Print “Hello World” with empty main() function</a></li><li><a href="https://www.techiedelight.com/tower-of-hanoi-problem/">Tower of Hanoi Problem</a></li><li><a href="https://www.techiedelight.com/print-numbers-1-n-without-using-loop-4-methods/">Print all numbers between 1 to N without using any loop</a></li><li><a href="https://www.techiedelight.com/print-a-semicolon-without-using-semicolon-anywhere-program/">Print a semicolon without using semicolon anywhere in the program</a></li><li><a href="https://www.techiedelight.com/multiply-two-numbers-without-using-multiplication-operator-loops/">Multiply two numbers without using multiplication operator or loops</a></li><li><a href="https://www.techiedelight.com/find-square-number-without-using-multiplication-division-operator/">Find square of a number without using multiplication and division operator</a></li><li><a href="https://www.techiedelight.com/find-number-even-odd-without-using-conditional-statement/">Find if a number is even or odd without using any conditional statement</a></li><li><a href="https://www.techiedelight.com/set-elements-binary-array-0-single-line/">Set both elements of a binary array to 0 in single line</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-without-using-conditional-statement-ternary-operator/">Find minimum number without using conditional statement or ternary operator</a></li><li><a href="https://www.techiedelight.com/perform-division-two-numbers-without-using-division-operator/">Perform Division of two numbers without using division operator (/)</a></li><li><a href="https://www.techiedelight.com/generate-0-1-75-25-probability/">Generate 0 and 1 with 75% and 25% Probability</a></li><li><a href="https://www.techiedelight.com/generate-random-numbers-equal-probability/">Generate Desired Random Numbers With Equal Probability</a></li><li><a href="https://www.techiedelight.com/return-0-1-2-equal-probability-using-specified-function/">Return 0, 1 and 2 with equal Probability using the specified function</a></li><li><a href="https://www.techiedelight.com/generate-fair-results-biased-coin/">Generate Fair Results from a Biased Coin</a></li><li><a href="https://www.techiedelight.com/generate-numbers-1-7-equal-probability/">Generate numbers from 1 to 7 with equal probability using specified function</a></li><li><a href="https://www.techiedelight.com/implement-ternary-operator-without-using-conditional-statements/">Implement Ternary Operator Without Using Conditional Expressions</a></li><li><a href="https://www.techiedelight.com/determine-two-integers-equal-without-using-comparison-arithmetic-operators/">Determine if two integers are equal without using comparison and arithmetic operators</a></li><li><a href="https://www.techiedelight.com/get-0-1-equal-probability-using-specified-function/">Return 0 and 1 with equal Probability using the specified function</a></li><li><a href="https://www.techiedelight.com/generate-random-input-array-according-given-probabilities/">Generate random input from an array according to given probabilities</a></li><li><a href="https://www.techiedelight.com/compute-modulus-division-without-division-modulo-operator/">Compute modulus division without division and modulo operator</a></li></ol><h3>Queue</h3><ol><li>Queue Implementation using Array/List — <a href="https://www.techiedelight.com/circular-queue-implementation-c/">C</a>, <a href="https://www.techiedelight.com/queue-implementation-cpp/">C++</a>, <a href="https://www.techiedelight.com/queue-implementation-in-java/">Java</a>, <a href="https://www.techiedelight.com/queue-implementation-python/">Python</a></li><li><a href="https://www.techiedelight.com/queue-implementation-using-linked-list/">Queue Implementation using Linked List</a></li><li><a href="https://www.techiedelight.com/implement-stack-using-queue-data-structure/">Implement Stack using Queue Data Structure</a></li><li><a href="https://www.techiedelight.com/implement-a-queue-using-stack-data-structure/">Implement a Queue using Stack Data Structure</a></li><li><a href="https://www.techiedelight.com/print-nodes-between-two-levels-binary-tree/">Efficiently print all nodes between two given levels in a binary tree</a></li><li><a href="https://www.techiedelight.com/chess-knight-problem-find-shortest-path-source-destination/">Chess Knight Problem — Find Shortest path from source to destination</a></li><li><a href="https://www.techiedelight.com/lee-algorithm-shortest-path-in-a-maze/">Shortest path in a Maze | Lee Algorithm</a></li><li><a href="https://www.techiedelight.com/find-shortest-safe-route-field-sensors-present/">Find shortest safe route in a field with sensors present</a></li><li><a href="https://www.techiedelight.com/flood-fill-algorithm/">Flood Fill Algorithm</a></li><li><a href="https://www.techiedelight.com/count-the-number-of-islands/">Count the number of islands</a></li><li><a href="https://www.techiedelight.com/find-shortest-path-source-destination-matrix-satisfies-given-constraints/">Find Shortest path from source to destination in a matrix that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/generate-binary-numbers-1-n/">Generate binary numbers between 1 to N</a></li><li><a href="https://www.techiedelight.com/calculate-height-binary-tree-iterative-recursive/">Calculate height of a binary tree</a></li><li><a href="https://www.techiedelight.com/delete-given-binary-tree-iterative-recursive/">Delete given Binary Tree</a></li><li><a href="https://www.techiedelight.com/level-order-traversal-binary-tree/">Level Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/spiral-order-traversal-binary-tree/">Spiral Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/reverse-level-order-traversal-binary-tree/">Reverse Level Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-nodes-binary-tree-specific-order/">Print all nodes of a given binary tree in specific order</a></li><li><a href="https://www.techiedelight.com/print-left-view-of-binary-tree/">Print left view of binary tree</a></li><li><a href="https://www.techiedelight.com/find-next-node-in-same-level-binary-tree/">Find next node in same level for given node in a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-complete-binary-tree-not/">Check if given binary tree is complete binary tree or not</a></li><li><a href="https://www.techiedelight.com/print-diagonal-traversal-binary-tree/">Print Diagonal Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-corner-nodes-every-level-binary-tree/">Print corner nodes of every level in binary tree</a></li><li><a href="https://www.techiedelight.com/invert-binary-tree-recursive-iterative/">Invert a Binary Tree</a></li><li><a href="https://www.techiedelight.com/find-minimum-passes-required-convert-negative-values-matrix/">Find minimum passes required to convert all negative values in the matrix</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-into-doubly-linked-list/">Convert a Binary Tree into a Doubly Linked List in Spiral Order</a></li><li><a href="https://www.techiedelight.com/check-binary-tree-is-min-heap/">Check if a binary tree is a min-heap or not</a></li><li><a href="https://www.techiedelight.com/invert-alternate-levels-perfect-binary-tree/">Invert alternate levels of a perfect binary tree</a></li><li><a href="https://www.techiedelight.com/convert-binary-search-tree-into-min-heap/">Convert a Binary Search Tree into a Min Heap</a></li><li><a href="https://www.techiedelight.com/min-throws-required-to-win-snake-and-ladder-game/">Snake and Ladder Problem</a></li><li><a href="https://www.techiedelight.com/find-shortest-distance-every-cell-landmine-maze/">Find shortest distance of every cell from landmine in a Maze</a></li><li><a href="https://www.techiedelight.com/convert-multilevel-linked-list-singly/">Convert a multilevel linked list to a singly linked list</a></li><li><a href="https://www.techiedelight.com/breadth-first-search/">Breadth First Search (BFS) Algorithm</a></li><li><a href="https://www.techiedelight.com/check-undirected-graph-contains-cycle-not/">Check if an undirected graph contains cycle or not</a></li><li><a href="https://www.techiedelight.com/maximum-cost-path-graph-source-destination/">Find maximum cost path in graph from given source to destination</a></li><li><a href="https://www.techiedelight.com/total-paths-in-digraph-from-source-to-destination-m-edges/">Total paths in given digraph from given source to destination having exactly m edges</a></li><li><a href="https://www.techiedelight.com/least-cost-path-digraph-source-destination-m-edges/">Least cost path in given digraph from given source to destination having exactly m edges</a></li></ol><h3>Sorting</h3><ol><li><a href="https://www.techiedelight.com/insertion-sort-iterative-recursive/">Insertion Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/selection-sort-iterative-recursive/">Selection Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/bubble-sort-iterative-recursive/">Bubble Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/merge-sort/">Merge Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/iterative-merge-sort-algorithm-bottom-up/">Iterative Merge Sort Algorithm (Bottom-up Merge Sort)</a></li><li><a href="https://www.techiedelight.com/quicksort/">QuickSort Algorithm</a></li><li><a href="https://www.techiedelight.com/iterative-implementation-of-quicksort/">Iterative Implementation of QuickSort</a></li><li><a href="https://www.techiedelight.com/hybrid-quicksort/">Hybrid QuickSort</a></li><li><a href="https://www.techiedelight.com/quicksort-using-dutch-national-flag-algorithm/">QuickSort using Dutch National Flag Algorithm</a></li><li><a href="https://www.techiedelight.com/quick-sort-using-hoares-partitioning-scheme/">QuickSort using Hoare’s Partitioning scheme</a></li><li><a href="https://www.techiedelight.com/heap-sort-place-place-implementation-c-c/">Heap Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/introsort-algorithm/">Introsort Algorithm</a></li><li><a href="https://www.techiedelight.com/external-merge-sort/">External Merge Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/counting-sort-algorithm-implementation/">Counting Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/inversion-count-array/">Inversion Count of an array</a></li><li><a href="https://www.techiedelight.com/sort-array-using-young-tableau/">Sort an array using Young tableau</a></li><li><a href="https://www.techiedelight.com/merge-sort-singly-linked-list/">Merge Sort Algorithm for Singly Linked List</a></li><li><a href="https://www.techiedelight.com/problems-solved-using-partitioning-logic-quicksort/">Problems solved using partitioning logic of QuickSort</a></li><li><a href="https://www.techiedelight.com/sort-doubly-linked-list-merge-sort/">Sort a Doubly Linked List using Merge Sort</a></li><li><a href="https://www.techiedelight.com/sort-elements-by-their-frequency-and-index/">Sort elements by their frequency and Index</a></li><li><a href="https://www.techiedelight.com/custom-sort-sort-elements-array-order-elements-defined-second-array/">Sort an array based on order defined by another array</a></li><li><a href="https://www.techiedelight.com/efficiently-sort-array-duplicated-values/">Efficiently sort an array with many duplicated values</a></li><li><a href="https://www.techiedelight.com/find-largest-number-possible-set-given-numbers/">Find largest number possible from set of given numbers</a></li><li><a href="https://www.techiedelight.com/surpasser-count-each-element-array/">Find the surpasser count for each element of an array</a></li><li><a href="https://www.techiedelight.com/segregate-positive-negative-integers-using-mergesort/">Segregate positive and negative integers using Merge Sort</a></li><li><a href="https://www.techiedelight.com/group-anagrams-together-given-list-words/">Group anagrams together from given list of words</a></li></ol><h3>Stack</h3><ol><li>Stack Implementation using Array/List — <a href="https://www.techiedelight.com/stack-implementation/">C</a>, <a href="https://www.techiedelight.com/stack-implementation-in-cpp/">C++</a>, <a href="https://www.techiedelight.com/stack-implementation-in-java/">Java</a>, <a href="https://www.techiedelight.com/stack-implementation-python/">Python</a></li><li><a href="https://www.techiedelight.com/stack-implementation-using-linked-list/">Stack Implementation using Linked List</a></li><li><a href="https://www.techiedelight.com/check-given-expression-balanced-expression-not/">Check if given expression is balanced expression or not</a></li><li><a href="https://www.techiedelight.com/find-duplicate-parenthesis-expression/">Find duplicate parenthesis in an expression</a></li><li><a href="https://www.techiedelight.com/evaluate-given-postfix-expression/">Evaluate given postfix expression</a></li><li><a href="https://www.techiedelight.com/decode-the-given-sequence-construct-minimum-number-without-repeated-digits/">Decode the given sequence to construct minimum number without repeated digits</a></li><li><a href="https://www.techiedelight.com/design-stack-which-returns-minimum-element-constant-time/">Design a stack which returns minimum element in constant time</a></li><li><a href="https://www.techiedelight.com/design-a-stack-which-returns-minimum-element-without-using-auxiliary-stack/">Design a stack which returns minimum element without using auxiliary stack</a></li><li><a href="https://www.techiedelight.com/merging-overlapping-intervals/">Merging Overlapping Intervals</a></li><li><a href="https://www.techiedelight.com/reverse-string-without-using-recursion/">Reverse String without using Recursion</a></li><li><a href="https://www.techiedelight.com/implement-stack-using-queue-data-structure/">Implement Stack using Queue Data Structure</a></li><li><a href="https://www.techiedelight.com/implement-a-queue-using-stack-data-structure/">Implement a Queue using Stack Data Structure</a></li><li><a href="https://www.techiedelight.com/implement-two-stacks-single-array/">Implement two stacks in a single array</a></li><li><a href="https://www.techiedelight.com/recursive-solution-sort-stack/">Recursive solution to sort a stack</a></li><li><a href="https://www.techiedelight.com/find-length-longest-balanced-parenthesis-string/">Find length of the longest balanced parenthesis in a string</a></li><li><a href="https://www.techiedelight.com/reverse-a-string-using-stack-data-structure/">Reverse a string using stack data structure</a></li><li><a href="https://www.techiedelight.com/find-elements-array-greater-than-elements-right/">Find all elements in an array that are greater than all elements present to their right</a></li><li><a href="https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/">Inorder Tree Traversal</a></li><li><a href="https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/">Preorder Tree Traversal</a></li><li><a href="https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/">Postorder Tree Traversal</a></li><li><a href="https://www.techiedelight.com/find-preorder-traversal-binary-tree-from-inorder-postorder/">Find preorder traversal of a binary tree from its inorder and postorder sequence</a></li><li><a href="https://www.techiedelight.com/find-ancestors-of-given-node-binary-tree/">Find ancestors of given node in a Binary Tree</a></li><li><a href="https://www.techiedelight.com/check-if-two-binary-trees-are-identical-not-iterative-recursive/">Check if two given binary trees are identical or not</a></li><li><a href="https://www.techiedelight.com/reverse-level-order-traversal-binary-tree/">Reverse Level Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/reverse-text-without-reversing-individual-words/">Reverse given text without reversing the individual words</a></li><li><a href="https://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/">Find all binary strings that can be formed from given wildcard pattern</a></li><li><a href="https://www.techiedelight.com/iterative-implementation-of-quicksort/">Iterative Implementation of QuickSort</a></li><li><a href="https://www.techiedelight.com/depth-first-search/">Depth First Search (DFS) Algorithm</a></li><li><a href="https://www.techiedelight.com/invert-binary-tree-recursive-iterative/">Invert a Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-leaf-to-root-path-binary-tree/">Print leaf to root path for every leaf node in a binary tree</a></li><li><a href="https://www.techiedelight.com/longest-increasing-subsequence/">Longest Increasing Subsequence</a></li><li><a href="https://www.techiedelight.com/invert-alternate-levels-perfect-binary-tree/">Invert alternate levels of a perfect binary tree</a></li></ol><h3>String</h3><ol><li><a href="https://www.techiedelight.com/check-given-string-rotated-palindrome-not/">Check if given string is a rotated palindrome or not</a></li><li><a href="https://www.techiedelight.com/longest-palindromic-substring-non-dp-space-optimized-solution/">Longest Palindromic Substring (Non-DP Space Optimized Solution)</a></li><li><a href="https://www.techiedelight.com/check-repeated-subsequence-present-string-not/">Check if repeated subsequence is present in the string or not</a></li><li><a href="https://www.techiedelight.com/check-strings-can-derived-circularly-rotating/">Check if strings can be derived from each other by circularly rotating them</a></li><li><a href="https://www.techiedelight.com/check-given-set-moves-circular-not/">Check if given set of moves is circular or not</a></li><li><a href="https://www.techiedelight.com/convert-given-number-corresponding-excel-column-name/">Convert given number into corresponding excel column name</a></li><li><a href="https://www.techiedelight.com/determine-if-two-strings-are-anagram-or-not/">Determine if two strings are anagram or not</a></li><li><a href="https://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/">Find all binary strings that can be formed from given wildcard pattern</a></li><li><a href="https://www.techiedelight.com/find-interleavings-of-given-strings/">Find all interleaving of given strings</a></li><li><a href="https://www.techiedelight.com/isomorphic-strings/">Isomorphic Strings</a></li><li><a href="https://www.techiedelight.com/find-possible-palindromic-substrings-string/">Find all possible palindromic substrings in a string</a></li><li><a href="https://www.techiedelight.com/find-possible-combinations-words-formed-from-mobile-keypad/">Find all possible combinations of words formed from mobile keypad</a></li><li><a href="https://www.techiedelight.com/possible-combinations-replacing-given-digits-corresponding-list/">Find all possible combinations by replacing given digits with characters of the corresponding list</a></li><li><a href="https://www.techiedelight.com/find-words-that-follows-given-pattern/">Find all words from given list that follows same order of characters as given pattern</a></li><li><a href="https://www.techiedelight.com/group-anagrams-together-given-list-words/">Group anagrams together from given list of words</a></li><li><a href="https://www.techiedelight.com/find-minimum-operations-required-transform-string-into-another/">Find minimum operations required to transform a string into another string</a></li><li><a href="https://www.techiedelight.com/determine-string-transformed-into-another-string-single-edit/">Determine if a string can be transformed into another string with a single edit</a></li><li><a href="https://www.techiedelight.com/find-length-longest-balanced-parenthesis-string/">Find length of the longest balanced parenthesis in a string</a></li><li><a href="https://www.techiedelight.com/inplace-remove-all-occurrences-ab-c-string/">In place remove all occurrences of ‘AB’ and ‘C’ from the string</a></li><li><a href="https://www.techiedelight.com/longest-even-length-palidromic-sum-substring/">Longest even length palindromic sum substring</a></li><li><a href="https://www.techiedelight.com/print-string-in-zig-zag-form-k-rows/">Print string in zig-zag form in k rows</a></li><li><a href="https://www.techiedelight.com/reverse-text-without-reversing-individual-words/">Reverse given text without reversing the individual words</a></li><li><a href="https://www.techiedelight.com/run-length-encoding-rle-data-compression-algorithm/">Run Length Encoding (RLE) Data Compression Algorithm</a></li><li><a href="https://www.techiedelight.com/find-longest-substring-containing-k-distinct-characters/">Find the longest substring of given string containing k distinct characters</a></li><li><a href="https://www.techiedelight.com/find-palindromic-permutations-string/">Find all palindromic permutations of a string</a></li><li><a href="https://www.techiedelight.com/find-substrings-string-permutation-given-string/">Find all substrings of a string that are permutation of a given string</a></li><li><a href="https://www.techiedelight.com/find-longest-substring-given-string-containing-distinct-characters/">Find the longest substring of given string containing all distinct characters</a></li><li><a href="https://www.techiedelight.com/find-permutations-string-cpp-java-iterative/">Iterative Approach to find Permutations of a String</a></li><li><a href="https://www.techiedelight.com/generate-permutations-string-java-recursive-iterative/">Generate all Permutations of a String in Java</a></li><li><a href="https://www.techiedelight.com/find-lexicographically-next-permutations-string-sorted-ascending-order/">Find all lexicographically next permutations of a string sorted in ascending order</a></li><li><a href="https://www.techiedelight.com/find-lexicographically-minimal-string-rotation/">Find Lexicographically minimal string rotation</a></li><li><a href="https://www.techiedelight.com/find-strings-given-length-containing-balanced-parentheses/">Find all strings of given length containing balanced parentheses</a></li><li><a href="https://www.techiedelight.com/find-combinations-non-overlapping-substrings-string/">Find all combinations of non-overlapping substrings of a string</a></li><li><a href="https://www.techiedelight.com/determine-given-string-is-palindrome-not/">Determine if a given string is palindrome or not</a></li><li><a href="https://www.techiedelight.com/minimum-number-inversions-expression-balanced/">Find the minimum number of inversions needed to make the given expression balanced</a></li><li><a href="https://www.techiedelight.com/construct-longest-palindrome-string/">Construct the longest palindrome by shuffling or deleting characters from a string</a></li><li><a href="https://www.techiedelight.com/combinations-phrases-formed-picking-words-lists/">Print all combinations of phrases formed by picking words from each of the given lists</a></li><li><a href="https://www.techiedelight.com/break-string-non-overlapping-substrings/">Break a string into all possible combinations of non-overlapping substrings</a></li><li><a href="https://www.techiedelight.com/remove-extra-spaces-string/">Remove all extra spaces from a string</a></li><li><a href="https://www.techiedelight.com/remove-adjacent-duplicates-characters-string/">Remove adjacent duplicate characters from a string</a></li><li><a href="https://www.techiedelight.com/find-first-non-repeating-character-string-one-traversal/">Find first non-repeating character in a string by doing only one traversal of it</a></li><li><a href="https://www.techiedelight.com/find-n-digit-strictly-increasing-numbers-bottom-top-approach/">Find all N-digit strictly increasing numbers (Bottom-Up and Top-Down Approach)</a></li><li><a href="https://www.techiedelight.com/find-n-digit-binary-numbers-having-more-one-than-zero/">Find all N-digit binary numbers having more 1’s than 0’s for any prefix</a></li><li><a href="https://www.techiedelight.com/find-all-n-digit-numbers-given-sum-digits/">Find all N-digit numbers with given sum of digits</a></li><li><a href="https://www.techiedelight.com/find-n-digit-binary-numbers-k-bits-set-k-ranges-1-n/">Find all N-digit binary numbers with k-bits set where k ranges from 1 to N</a></li><li><a href="https://www.techiedelight.com/find-n-digit-binary-numbers-equal-sum-bits-two-halves/">Find all N-digit binary numbers with equal sum of bits in its two halves</a></li><li><a href="https://www.techiedelight.com/find-n-digit-numbers-with-equal-sum-even-odd-digits/">Find all N-digit numbers with equal sum of digits at even and odd index</a></li><li><a href="https://www.techiedelight.com/find-lexicographic-permutations-string/">Find all Lexicographic Permutations of a String</a></li><li><a href="https://www.techiedelight.com/calculate-rank-lexicographically-sorted-permutations/">Lexicographic Rank of a String</a></li><li><a href="https://www.techiedelight.com/find-all-lexicographically-previous-permutations-string/">Find all lexicographically previous permutations of a string sorted in descending order</a></li><li><a href="https://www.techiedelight.com/replace-non-overlapping-occurrences-pattern/">Replace all non-overlapping occurrences of the pattern</a></li><li><a href="https://www.techiedelight.com/introduction-pattern-matching/">Introduction to Pattern Matching</a></li><li><a href="https://www.techiedelight.com/implementation-kmp-algorithm-c-cpp-java/">Implementation of KMP Algorithm</a></li><li><a href="https://www.techiedelight.com/reverse-string-without-using-recursion/">Reverse String without using Recursion</a></li><li><a href="https://www.techiedelight.com/reverse-a-string-using-recursion/">Reverse given string using Recursion</a></li><li><a href="https://www.techiedelight.com/determine-string-follows-specified-order/">Determine if characters of a String follow a specified order or not</a></li><li><a href="https://www.techiedelight.com/in-place-remove-all-adjacent-duplicates-from-string/">In-place remove all adjacent duplicates from the given string</a></li><li><a href="https://www.techiedelight.com/check-given-sentence-syntactically-correct-not/">Check if given sentence is syntactically correct or not</a></li><li><a href="https://www.techiedelight.com/find-permutations-given-string/">Find all Permutations of a given string</a></li><li><a href="https://www.techiedelight.com/first-k-non-repeating-characters-string/">Find first k non-repeating characters in a string in single traversal</a></li><li><a href="https://www.techiedelight.com/check-string-interleaving-two-given-strings/">Check if given string is interleaving of two other given strings</a></li><li><a href="https://www.techiedelight.com/decode-the-given-sequence-construct-minimum-number-without-repeated-digits/">Decode the given sequence to construct minimum number without repeated digits</a></li><li><a href="https://www.techiedelight.com/combinations-of-words-formed-replacing-given-numbers-corresponding-english-alphabet/">Combinations of words formed by replacing given numbers with corresponding alphabets</a></li><li><a href="https://www.techiedelight.com/count-number-times-pattern-appears-given-string-subsequence/">Count number of times a pattern appears in given string as a subsequence</a></li><li><a href="https://www.techiedelight.com/check-string-matches-with-wildcard-pattern/">Check if a string matches with a given wildcard pattern</a></li><li><a href="https://www.techiedelight.com/find-all-words-matching-pattern-dictionary/">Find all words matching a pattern in the given dictionary</a></li><li><a href="https://www.techiedelight.com/levenshtein-distance-edit-distance-problem/">The Levenshtein Distance (Edit Distance) Problem</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence/">Longest Common Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-repeated-subsequence-problem/">Longest Repeated Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-palindromic-subsequence-using-dynamic-programming/">Longest Palindromic Subsequence using Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/longest-common-substring-problem/">Longest Common Substring Problem</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-introduction-scs-length/">Shortest Common Supersequence Problem</a></li><li><a href="https://www.techiedelight.com/word-break-problem/">Word Break Problem</a></li><li><a href="https://www.techiedelight.com/wildcard-pattern-matching/">Wildcard Pattern Matching</a></li><li><a href="https://www.techiedelight.com/find-minimum-cuts-needed-palindromic-partition-string/">Find minimum cuts needed for palindromic partition of a string</a></li><li><a href="https://www.techiedelight.com/check-given-string-k-palindrome-not/">Check if a string is K-Palindrome or not</a></li><li><a href="https://www.techiedelight.com/find-shortest-route-device-construct-given-string/">Find shortest route in a device to construct the given string</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-possible-k-swaps/">Find minimum number possible by doing at-most K swaps</a></li><li><a href="https://www.techiedelight.com/determine-pattern-matches-string-not/">Determine if a pattern matches with a string or not</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-deletions-convert-string-into-palindrome/">Find minimum number of deletions required to convert a string into palindrome</a></li></ol><h3>Trie</h3><ol><li>Trie Implementation — <a href="https://www.techiedelight.com/trie-implementation-insert-search-delete/">C</a>, <a href="https://www.techiedelight.com/cpp-implementation-trie-data-structure/">C++</a>, <a href="https://www.techiedelight.com/implement-trie-data-structure-java/">Java</a>, <a href="https://www.techiedelight.com/trie-implementation-python/">Python</a></li><li><a href="https://www.techiedelight.com/memory-efficient-trie-implementation-using-map-insert-search-delete/">Memory Efficient Implementation of Trie | Insert, Search and Delete</a></li><li><a href="https://www.techiedelight.com/longest-common-prefix-given-set-strings-using-trie/">Longest Common Prefix in given set of strings (using Trie)</a></li><li><a href="https://www.techiedelight.com/lexicographic-sorting-given-set-of-keys/">Lexicographic sorting of given set of keys</a></li><li><a href="https://www.techiedelight.com/find-maximum-occurring-word-given-set-strings/">Find maximum occurring word in given set of strings</a></li><li><a href="https://www.techiedelight.com/find-first-k-maximum-occurring-words-given-set-strings/">Find first k maximum occurring words in given set of strings</a></li><li><a href="https://www.techiedelight.com/find-duplicate-rows-binary-matrix/">Find Duplicate rows in a binary matrix</a></li><li><a href="https://www.techiedelight.com/word-break-problem-using-trie/">Word Break Problem | Using Trie</a></li><li><a href="https://www.techiedelight.com/generate-list-of-possible-words-from-a-character-matrix/">Generate list of possible words from a character matrix</a></li><li><a href="https://www.techiedelight.com/find-all-words-matching-pattern-dictionary/">Find all words matching a pattern in the given dictionary</a></li></ol><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=35afe8a1e222" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techie-delight/500-data-structures-and-algorithms-practice-problems-35afe8a1e222">500+ Data Structures and Algorithms Interview Questions &amp; Practice Problems</a> was originally published in <a href="https://medium.com/techie-delight">Techie Delight</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Top 50 Dynamic Programming Practice Problems]]></title>
            <link>https://medium.com/techie-delight/top-50-dynamic-programming-practice-problems-4208fed71aa3?source=rss----d2ee351b3e1d---4</link>
            <guid isPermaLink="false">https://medium.com/p/4208fed71aa3</guid>
            <category><![CDATA[interview-questions]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[dynamic-programming]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[data-structures]]></category>
            <dc:creator><![CDATA[Vivek Srivastava]]></dc:creator>
            <pubDate>Thu, 26 Aug 2021 18:53:01 GMT</pubDate>
            <atom:updated>2021-08-21T15:56:55.208Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/598/0*m560EKLr1Po-Gcej.png" /></figure><p><a href="https://www.techiedelight.com/introduction-dynamic-programming/">Dynamic Programming</a> is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions using a memory-based data structure (array, map,etc). Each of the subproblem solutions is indexed in some way, typically based on the values of its input parameters, so as to facilitate its lookup. So the next time the same subproblem occurs, instead of recomputing its solution, one simply looks up the previously computed solution, thereby saving computation time. This technique of storing solutions to subproblems instead of recomputing them is called memoization.</p><p>Here’s brilliant explanation on concept of Dynamic Programming on Quora <a href="https://www.quora.com/How-should-I-explain-dynamic-programming-to-a-4-year-old/answer/Jonathan-Paulson">Jonathan Paulson’s answer to How should I explain dynamic programming to a 4-year-old?</a></p><p>Please find below top 50 common data structure problems that can be solved using Dynamic programming -</p><ol><li><a href="https://www.techiedelight.com/longest-common-subsequence/">Longest Common Subsequence | Introduction &amp; LCS Length</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence-finding-lcs/">Longest Common Subsequence | Finding all LCS</a></li><li><a href="https://www.techiedelight.com/longest-common-substring-problem/">Longest Common Substring problem</a></li><li><a href="https://www.techiedelight.com/longest-palindromic-subsequence-using-dynamic-programming/">Longest Palindromic Subsequence using Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/longest-repeated-subsequence-problem/">Longest Repeated Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/implement-diff-utility/">Implement Diff Utility</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-introduction-scs-length/">Shortest Common Supersequence | Introduction &amp; SCS Length</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-finding-scs/">Shortest Common Supersequence | Finding all SCS</a></li><li><a href="https://www.techiedelight.com/longest-increasing-subsequence-using-dynamic-programming/">Longest Increasing Subsequence using Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/longest-bitonic-subsequence/">Longest Bitonic Subsequence</a></li><li><a href="https://www.techiedelight.com/increasing-subsequence-with-maximum-sum/">Increasing Subsequence with Maximum Sum</a></li><li><a href="https://www.techiedelight.com/levenshtein-distance-edit-distance-problem/">The Levenshtein distance (Edit distance) problem</a></li><li><a href="https://www.techiedelight.com/find-size-largest-square-sub-matrix-1s-present-given-binary-matrix/">Find size of largest square sub-matrix of 1’s present in given binary matrix</a></li><li><a href="https://www.techiedelight.com/matrix-chain-multiplication/">Matrix Chain Multiplication using Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/find-minimum-cost-reach-last-cell-matrix-first-cell/">Find the minimum cost to reach last cell of the matrix from its first cell</a></li><li><a href="https://www.techiedelight.com/find-longest-sequence-formed-adjacent-numbers-matrix/">Find longest sequence formed by adjacent numbers in the matrix</a></li><li><a href="https://www.techiedelight.com/counting-paths-on-grid-to-reach-destination-cell/">Count number of paths in a matrix with given cost to reach destination cell</a></li><li><a href="https://www.techiedelight.com/0-1-knapsack-problem/">0–1 Knapsack problem</a></li><li><a href="https://www.techiedelight.com/maximize-value-of-the-expression/">Maximize the Value of an Expression</a></li><li><a href="https://www.techiedelight.com/partition-problem/">Partition problem | Dynamic Programming Solution</a></li><li><a href="https://www.techiedelight.com/subset-sum-problem/">Subset Sum Problem</a></li><li><a href="https://www.techiedelight.com/minimum-sum-partition-problem/">Minimum Sum Partition Problem</a></li><li><a href="https://www.techiedelight.com/find-n-digit-binary-strings-without-consecutive-1s/">Find all N-digit binary strings without any consecutive 1’s</a></li><li><a href="https://www.techiedelight.com/rot-cutting/">Rod Cutting Problem</a></li><li><a href="https://www.techiedelight.com/maximum-product-rod-cutting/">Maximum Product Rod Cutting</a></li><li><a href="https://www.techiedelight.com/coin-change-making-problem-unlimited-supply-coins/">Coin change-making problem (unlimited supply of coins)</a></li><li><a href="https://www.techiedelight.com/coin-change-problem-find-total-number-ways-get-denomination-coins/">Coin Change Problem (Total number of ways to get the denomination of coins)</a></li><li><a href="https://www.techiedelight.com/longest-alternating-subsequence/">Longest Alternating Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/count-number-times-pattern-appears-given-string-subsequence/">Count number of times a pattern appears in given string as a subsequence</a></li><li><a href="https://www.techiedelight.com/collect-maximum-points-matrix-satisfying-given-constraints/">Collect maximum points in a matrix by satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/count-total-possible-combinations-n-digit-numbers-mobile-keypad/">Count total possible combinations of N-digit numbers in a mobile keypad</a></li><li><a href="https://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/">Find Optimal Cost to Construct Binary Search Tree</a></li><li><a href="https://www.techiedelight.com/word-break-problem/">Word Break Problem | Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/word-break-problem-using-trie/">Word Break Problem | Using Trie Data Structure</a></li><li><a href="https://www.techiedelight.com/total-possible-solutions-linear-equation-k-variables/">Total possible solutions to linear equation of k variables</a></li><li><a href="https://www.techiedelight.com/wildcard-pattern-matching/">Wildcard Pattern Matching</a></li><li><a href="https://www.techiedelight.com/probability-alive-after-taking-n-steps-island/">Find Probability that a Person is Alive after Taking N steps on an Island</a></li><li><a href="https://www.techiedelight.com/calculate-sum-elements-sub-matrix-constant-time/">Calculate sum of all elements in a sub-matrix in constant time</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-submatrix-in-given-matrix/">Find Maximum Sum Submatrix in a given matrix</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-submatrix-present-given-matrix/">Find Maximum Sum Submatrix present in a given matrix</a></li><li><a href="https://www.techiedelight.com/maximum-sum-of-subsequence-with-no-adjacent-elements">Find maximum sum of subsequence with no adjacent elements</a></li><li><a href="https://www.techiedelight.com/maximum-subarray-problem-kadanes-algorithm/">Maximum Subarray Problem (Kadane’s algorithm)</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-bellman-ford-algorithm/">Single-Source Shortest Paths — Bellman Ford Algorithm</a></li><li><a href="https://www.techiedelight.com/pairs-shortest-paths-floyd-warshall-algorithm/">All-Pairs Shortest Paths — Floyd Warshall Algorithm</a></li><li><a href="https://www.techiedelight.com/pots-gold-game-dynamic-programming/">Pots of Gold Game using Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/find-minimum-cuts-needed-palindromic-partition-string/">Find minimum cuts needed for palindromic partition of a string</a></li><li><a href="https://www.techiedelight.com/maximum-length-snake-sequence/">Maximum Length Snake Sequence</a></li><li><a href="https://www.techiedelight.com/3-partition-problem/">3-Partition Problem</a></li><li><a href="https://www.techiedelight.com/calculate-size-largest-plus-1s-binary-matrix/">Calculate size of the largest plus of 1’s in binary matrix</a></li><li><a href="https://www.techiedelight.com/check-string-interleaving-two-given-strings/">Check if given string is interleaving of two other given strings</a></li></ol><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=4208fed71aa3" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techie-delight/top-50-dynamic-programming-practice-problems-4208fed71aa3">Top 50 Dynamic Programming Practice Problems</a> was originally published in <a href="https://medium.com/techie-delight">Techie Delight</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[500+ Data Structures and Algorithms Practice Problems]]></title>
            <link>https://medium.com/techie-delight/500-data-structures-and-algorithms-practice-problems-c1bab47a42a0?source=rss----d2ee351b3e1d---4</link>
            <guid isPermaLink="false">https://medium.com/p/c1bab47a42a0</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[coding-interviews]]></category>
            <dc:creator><![CDATA[Vivek Srivastava]]></dc:creator>
            <pubDate>Mon, 12 Apr 2021 15:53:22 GMT</pubDate>
            <atom:updated>2021-04-12T15:52:08.018Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/640/1*Chc70A0hTLGm-yzgT2am5g.png" /></figure><h3>Array</h3><ol><li><a href="https://www.techiedelight.com/find-pair-with-given-sum-array/">Find pair with given sum in the array</a></li><li><a href="https://www.techiedelight.com/check-subarray-with-0-sum-exists-not/">Check if subarray with 0 sum is exists or not</a></li><li><a href="https://www.techiedelight.com/find-sub-array-with-0-sum/">Print all sub-arrays with 0 sum</a></li><li><a href="https://www.techiedelight.com/sort-binary-array-linear-time/">Sort binary array in linear time</a></li><li><a href="https://www.techiedelight.com/find-duplicate-element-limited-range-array/">Find a duplicate element in a limited range array</a></li><li><a href="https://www.techiedelight.com/find-maximum-length-sub-array-having-given-sum/">Find maximum length sub-array having given sum</a></li><li><a href="https://www.techiedelight.com/find-maximum-length-sub-array-equal-number-0s-1s/">Find maximum length sub-array having equal number of 0’s and 1’s</a></li><li><a href="https://www.techiedelight.com/find-maximum-product-two-integers-array/">Find maximum product of two integers in an array</a></li><li><a href="https://www.techiedelight.com/sort-array-containing-0s-1s-2s-dutch-national-flag-problem/">Sort an array containing 0’s, 1’s and 2’s (Dutch National Flag Problem)</a></li><li><a href="https://www.techiedelight.com/inplace-merge-two-sorted-arrays/">In place merge two sorted arrays</a></li><li><a href="https://www.techiedelight.com/merge-two-arrays-satisfying-given-constraints/">Merge two arrays by satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/find-index-0-replaced-get-maximum-length-sequence-of-continuous-ones/">Find index of 0 to replace to get maximum length sequence of continuous ones</a></li><li><a href="https://www.techiedelight.com/shuffle-given-array-elements-fisher-yates-shuffle/">Shuffle a given array of elements (Fisher–Yates shuffle)</a></li><li><a href="https://www.techiedelight.com/rearrange-the-array-with-alternate-high-and-low-elements/">Rearrange the array with alternate high and low elements</a></li><li><a href="https://www.techiedelight.com/find-equilibrium-index-array/">Find equilibrium index of an array</a></li><li><a href="https://www.techiedelight.com/find-largest-sub-array-formed-by-consecutive-integers/">Find largest sub-array formed by consecutive integers</a></li><li><a href="https://www.techiedelight.com/find-majority-element-in-an-array-boyer-moore-majority-vote-algorithm/">Find majority element (Boyer–Moore Majority Vote Algorithm)</a></li><li><a href="https://www.techiedelight.com/move-zeros-present-array-end/">Move all zeros present in the array to the end</a></li><li><a href="https://www.techiedelight.com/replace-element-array-product-every-element-without-using-division-operator/">Replace each element of array with product of every other element without using / operator</a></li><li><a href="https://www.techiedelight.com/find-longest-bitonic-subarray-array/">Find Longest Bitonic Subarray in an array</a></li><li><a href="https://www.techiedelight.com/longest-increasing-subsequence/">Longest Increasing Subsequence</a></li><li><a href="https://www.techiedelight.com/find-maximum-difference-between-two-elements-array/">Find maximum difference between two elements in the array by satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/maximum-subarray-problem-kadanes-algorithm/">Maximum Sum Subarray Problem (Kadane’s Algorithm)</a></li><li><a href="https://www.techiedelight.com/print-continuous-subarray-with-maximum-sum/">Print continuous subarray with maximum sum</a></li><li><a href="https://www.techiedelight.com/maximum-sum-circular-subarray/">Maximum Sum Circular Subarray</a></li><li><a href="https://www.techiedelight.com/find-distinct-combinations-of-given-length/">Find all distinct combinations of given length — I</a></li><li><a href="https://www.techiedelight.com/find-distinct-combinations-given-length-repetition-allowed/">Find all distinct combinations of given length with repetition allowed</a></li><li><a href="https://www.techiedelight.com/find-maximum-sequence-of-continuous-1s-can-formed-replacing-k-zeroes-ones/">Find maximum sequence of continuous 1’s formed by replacing at-most k zeroes by ones</a></li><li><a href="https://www.techiedelight.com/find-minimum-sum-subarray-given-size-k/">Find minimum sum subarray of given size k</a></li><li><a href="https://www.techiedelight.com/find-maximum-product-subarray-given-array/">Find maximum product subarray in a given array</a></li><li><a href="https://www.techiedelight.com/find-subarray-having-given-sum-given-array/">Find subarray having given sum in given array of integers</a></li><li><a href="https://www.techiedelight.com/length-of-smallest-subarray-with-sum-greater-number/">Find the length of smallest subarray whose sum of elements is greater than the given number</a></li><li><a href="https://www.techiedelight.com/find-largest-number-possible-set-given-numbers/">Find largest number possible from set of given numbers</a></li><li><a href="https://www.techiedelight.com/smallest-window-sorting-which-make-array-sorted/">Find the smallest window in array sorting which will make the entire array sorted</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-path-involving-elements-given-arrays/">Find maximum sum path involving elements of given arrays</a></li><li><a href="https://www.techiedelight.com/maximum-profit-earned-buying-and-selling-shares/">Maximum profit earned by buying and selling shares any number of times</a></li><li><a href="https://www.techiedelight.com/trapping-rain-water-within-given-set-bars/">Trapping Rain Water within given set of bars</a></li><li><a href="https://www.techiedelight.com/minimum-number-of-platforms-needed-avoid-delay-arrival-train/">Find minimum platforms needed in the station so to avoid any delay in arrival of any train</a></li><li><a href="https://www.techiedelight.com/decode-the-array-constructed-another-array/">Decode the array constructed from another array</a></li><li><a href="https://www.techiedelight.com/sort-array-using-one-swap/">Sort an array using one swap</a></li><li><a href="https://www.techiedelight.com/find-triplet-given-with-given-sum/">Find Triplet with given sum in an array</a></li><li><a href="https://www.techiedelight.com/length-longest-continuous-sequence-same-sum-binary-arrays/">Length of longest continuous sequence with same sum in given binary arrays</a></li><li><a href="https://www.techiedelight.com/reverse-every-consecutive-m-elements-given-subarray/">Reverse every consecutive m elements of the given subarray</a></li><li><a href="https://www.techiedelight.com/maximum-product-subset-problem/">Maximum Product Subset Problem</a></li><li><a href="https://www.techiedelight.com/find-pairs-with-given-difference-array/">Find pairs with given difference k in the array</a></li><li><a href="https://www.techiedelight.com/find-pairs-given-difference-k-array-constant-space-solution/">Find pairs with given difference k in the array | Constant space solution</a></li><li><a href="https://www.techiedelight.com/4-sum-problem/">4 sum problem | Quadruplets with given sum</a></li><li><a href="https://www.techiedelight.com/print-all-quadruplets-with-given-sum-4-sum-problem-extended/">Print all quadruplets with given sum | 4-sum problem extended</a></li><li><a href="https://www.techiedelight.com/quickselect-algorithm/">Quickselect Algorithm</a></li><li><a href="https://www.techiedelight.com/rearrange-array-such-that-array-index-is-set-to-i/">Rearrange array such that A[A[i]] is set to i for every element A[i]</a></li><li><a href="https://www.techiedelight.com/print-triplets-forms-arithmetic-progression/">Print all Triplets that forms Arithmetic Progression</a></li><li><a href="https://www.techiedelight.com/print-triplets-forms-geometric-progression/">Print all Triplets that forms Geometric Progression</a></li><li><a href="https://www.techiedelight.com/print-all-combination-numbers-from-1-to-n/">Print all combination of numbers from 1 to n having sum n</a></li><li><a href="https://www.techiedelight.com/replace-each-element-corresponding-rank-array/">Replace each element of the array by its corresponding rank in the array</a></li><li><a href="https://www.techiedelight.com/print-triplets-array-sum-less-equal-given-number/">Print all Triplets in an array with sum less than or equal to given number</a></li><li><a href="https://www.techiedelight.com/group-elements-array-based-first-occurrence/">Group elements of an array based on their first occurrence</a></li><li><a href="https://www.techiedelight.com/find-minimum-difference-index-two-given-elements-present-array/">Find minimum difference between index of two given elements present in the array</a></li><li><a href="https://www.techiedelight.com/find-maximum-absolute-difference-subarrays/">Find maximum absolute difference between sum of two non-overlapping sub-arrays</a></li><li><a href="https://www.techiedelight.com/find-symmetric-pairs-array-pairs/">Find all Symmetric Pairs in an Array of Pairs</a></li><li><a href="https://www.techiedelight.com/partition-array-into-two-sub-arrays-with-same-sum/">Partition an array into two sub-arrays with the same sum</a></li><li><a href="https://www.techiedelight.com/count-distinct-elements-every-sub-array-size-k-array/">Find count of distinct elements in every sub-array of size k</a></li><li><a href="https://www.techiedelight.com/find-two-numbers-maximum-sum-array-digits/">Find two numbers with maximum sum formed by array digits</a></li><li><a href="https://www.techiedelight.com/print-sub-arrays-array-distinct-elements/">Print all sub-arrays of an array having distinct elements</a></li><li><a href="https://www.techiedelight.com/find-triplet-maximum-product-array/">Find a Triplet having Maximum Product in an Array</a></li><li><a href="https://www.techiedelight.com/find-minimum-index-repeating-element-array/">Find Minimum Index of Repeating Element in an Array</a></li><li><a href="https://www.techiedelight.com/generate-random-input-array-according-given-probabilities/">Generate random input from an array according to given probabilities</a></li><li><a href="https://www.techiedelight.com/find-pair-array-minimum-absolute-sum/">Find pair in an array having minimum absolute sum</a></li><li><a href="https://www.techiedelight.com/find-index-maximum-occurring-element-equal-probability/">Find Index of Maximum Occurring Element with Equal Probability</a></li><li><a href="https://www.techiedelight.com/check-array-formed-consecutive-integers/">Check if an Array is Formed by Consecutive Integers</a></li><li><a href="https://www.techiedelight.com/find-two-non-overlapping-pairs-sum-array/">Find two non-overlapping pairs having same sum in an array</a></li><li><a href="https://www.techiedelight.com/add-elements-two-arrays/">Add elements of two arrays into a new array</a></li><li><a href="https://www.techiedelight.com/find-minimum-product-triplets-array/">Find Minimum Product among all Combinations of Triplets in an Array</a></li><li><a href="https://www.techiedelight.com/replace-every-element-array-least-greater-element-right/">Replace every element of an array with the least greater element on its right</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-elements-array/">Find all odd occurring elements in an array having limited range of elements</a></li><li><a href="https://www.techiedelight.com/count-distinct-absolute-values-sorted-array/">Count the distinct absolute values in the sorted array</a></li><li><a href="https://www.techiedelight.com/print-combinations-integers-sum-given-number/">Print all combinations of positive integers in increasing order that sum to a given number</a></li><li><a href="https://www.techiedelight.com/find-distinct-combinations-given-length-2/">Find all distinct combinations of given length — II</a></li><li><a href="https://www.techiedelight.com/find-subarrays-given-sum-array/">Find subarrays with given sum in an array</a></li><li><a href="https://www.techiedelight.com/surpasser-count-each-element-array/">Find the surpasser count for each element of an array</a></li><li><a href="https://www.techiedelight.com/find-maximum-length-sequence-continuous-ones-sliding-window/">Find maximum length sequence of continuous ones (Using Sliding Window)</a></li><li><a href="https://www.techiedelight.com/find-maximum-length-sequence-continuous-ones/">Find maximum length sequence of continuous ones</a></li><li><a href="https://www.techiedelight.com/find-index-that-divides-array-non-empty-subarrays-equal-sum/">Find index that divides an array into two non-empty subarrays of equal sum</a></li><li><a href="https://www.techiedelight.com/calculate-frequency-elements-present-array-specified-range/">Calculate frequency of all elements present in an array of specified range</a></li><li><a href="https://www.techiedelight.com/rearrange-array-positive-negative-numbers-alternate-positions/">Rearrange the array such that it contains positive and negative numbers at alternate positions</a></li><li><a href="https://www.techiedelight.com/find-sorted-triplet-array/">Find a sorted triplet in the given array</a></li><li><a href="https://www.techiedelight.com/shuffle-array-according-to-given-order/">Shuffle an array according to the given order of elements</a></li><li><a href="https://www.techiedelight.com/count-strictly-increasing-sub-arrays/">Count number of strictly increasing sub-arrays in an array</a></li><li><a href="https://www.techiedelight.com/find-duplicates-within-given-range-array/">Find duplicates within given range k in an array</a></li><li><a href="https://www.techiedelight.com/longest-alternating-subarray-problem/">Longest Alternating Subarray Problem</a></li><li><a href="https://www.techiedelight.com/find-minimum-range-given-arrays/">Find minimum range with at-least one element from each of the given arrays</a></li><li><a href="https://www.techiedelight.com/find-longest-subsequence-formed-by-consecutive-integers/">Find longest subsequence formed by consecutive integers</a></li><li><a href="https://www.techiedelight.com/find-elements-array-greater-than-elements-right/">Find all elements in an array that are greater than all elements present to their right</a></li><li><a href="https://www.techiedelight.com/find-missing-number-array-without-extra-space/">Find missing number in array without using extra space</a></li><li><a href="https://www.techiedelight.com/determine-index-element-array/">Determine index of an element in given array which satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/find-minimum-moves-required-converting-array/">Find minimum moves required for converting a given array to an array of zeroes</a></li><li><a href="https://www.techiedelight.com/left-rotate-array-c/">Left rotate an array</a></li><li><a href="https://www.techiedelight.com/right-rotate-an-array-k-times/">Right rotate an array k times</a></li><li><a href="https://www.techiedelight.com/find-maximum-profit-earned-from-at-most-two-stock-transactions/">Find maximum profit earned from at most two stock transactions</a></li><li><a href="https://www.techiedelight.com/find-frequency-element-sorted-array-containing-duplicates/">Find Frequency of each element in a sorted array containing duplicates</a></li><li><a href="https://www.techiedelight.com/find-minimum-maximum-element-array-using-minimum-comparisons/">Find Minimum and Maximum element in an array using minimum comparisons</a></li><li><a href="https://www.techiedelight.com/difference-between-subarray-subsequence-subset/">Difference between Subarray, Subsequence and Subset</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-element-array-single-traversal/">Find odd occurring element in an array in single traversal</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-element-logn-time/">Find odd occurring element in logarithmic time</a></li><li><a href="https://www.techiedelight.com/find-two-odd-occurring-element-array-without-extra-space/">Find two odd occurring elements in an array without using any extra space</a></li><li><a href="https://www.techiedelight.com/check-given-array-represents-min-heap-not/">Check if given array represents min heap or not</a></li><li><a href="https://www.techiedelight.com/find-kth-smallest-element-array/">Find K’th smallest element in an array</a></li><li><a href="https://www.techiedelight.com/find-kth-largest-element-array/">Find K’th largest element in an array</a></li><li><a href="https://www.techiedelight.com/sort-k-sorted-array/">Sort a K-Sorted Array</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-variable-length/">Merge M sorted lists of variable length</a></li><li><a href="https://www.techiedelight.com/find-smallest-range-least-one-element-given-lists/">Find smallest range with at-least one element from each of the given lists</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/">Merge M sorted lists each containing N elements</a></li><li><a href="https://www.techiedelight.com/maximum-sum-of-subsequence-with-no-adjacent-elements/">Find maximum sum of subsequence with no adjacent elements</a></li><li><a href="https://www.techiedelight.com/find-ways-calculate-target-elements-array/">Find ways to calculate a target from elements of specified array</a></li><li><a href="https://www.techiedelight.com/sort-elements-by-their-frequency-and-index/">Sort elements by their frequency and Index</a></li><li><a href="https://www.techiedelight.com/custom-sort-sort-elements-array-order-elements-defined-second-array/">Sort an array based on order defined by another array</a></li><li><a href="https://www.techiedelight.com/inversion-count-array/">Inversion Count of an array</a></li><li><a href="https://www.techiedelight.com/positive-and-negative-integers-segregate/">Segregate positive and negative integers in linear time</a></li><li><a href="https://www.techiedelight.com/find-number-rotations-circularly-sorted-array/">Find number of rotations in a circularly sorted array</a></li><li><a href="https://www.techiedelight.com/search-element-circular-sorted-array/">Search an element in a circular sorted array</a></li><li><a href="https://www.techiedelight.com/find-first-or-last-occurrence-of-a-given-number-sorted-array/">Find first or last occurrence of a given number in a sorted array</a></li><li><a href="https://www.techiedelight.com/count-occurrences-number-sorted-array-duplicates/">Count occurrences of a number in a sorted array with duplicates</a></li><li><a href="https://www.techiedelight.com/find-smallest-missing-element-sorted-array/">Find smallest missing element from a sorted array</a></li><li><a href="https://www.techiedelight.com/find-floor-ceil-number-sorted-array/">Find Floor and Ceil of a number in a sorted array</a></li><li><a href="https://www.techiedelight.com/search-nearly-sorted-array-ologn-time/">Search in a nearly sorted array in logarithmic time</a></li><li><a href="https://www.techiedelight.com/find-number-1s-sorted-binary-array/">Find number of 1’s in a sorted binary array</a></li><li><a href="https://www.techiedelight.com/find-missing-term-sequence-ologn-time/">Find Missing Term in a Sequence in Logarithmic time</a></li><li><a href="https://www.techiedelight.com/find-missing-number-duplicate-elements-array/">Find missing number and duplicate elements in an array</a></li><li><a href="https://www.techiedelight.com/find-peak-element-array/">Find the peak element in an array</a></li><li><a href="https://www.techiedelight.com/find-floor-ceil-number-sorted-array-recursive/">Find Floor and Ceil of a number in a sorted array (Recursive solution)</a></li><li><a href="https://www.techiedelight.com/print-distinct-subsets-given-set/">Print all distinct subsets of a given set</a></li><li><a href="https://www.techiedelight.com/find-two-duplicate-elements-limited-range-array-using-xor/">Find two duplicate elements in a limited range array (using XOR)</a></li><li><a href="https://www.techiedelight.com/combinations-of-words-formed-replacing-given-numbers-corresponding-english-alphabet/">Combinations of words formed by replacing given numbers with corresponding alphabets</a></li><li><a href="https://www.techiedelight.com/0-1-knapsack-problem/">0–1 Knapsack Problem</a></li><li><a href="https://www.techiedelight.com/subset-sum-problem/">Subset sum Problem</a></li><li><a href="https://www.techiedelight.com/partition-problem/">Partition Problem</a></li><li><a href="https://www.techiedelight.com/3-partition-problem/">3-Partition Problem</a></li><li><a href="https://www.techiedelight.com/3-partition-problem-extended-print-all-partitions/">3-partition problem extended | Print all partitions</a></li><li><a href="https://www.techiedelight.com/k-partition-problem-print-all-subsets/">K-Partition Problem | Printing all Partitions</a></li><li><a href="https://www.techiedelight.com/minimum-sum-partition-problem/">Minimum Sum Partition Problem</a></li><li><a href="https://www.techiedelight.com/rot-cutting/">Rod Cutting</a></li><li><a href="https://www.techiedelight.com/longest-alternating-subsequence/">Longest Alternating Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/coin-change-making-problem-unlimited-supply-coins/">Coin change-making problem (unlimited supply of coins)</a></li><li><a href="https://www.techiedelight.com/coin-change-problem-find-total-number-ways-get-denomination-coins/">Coin Change Problem — Find total number of ways to get the denomination of coins</a></li><li><a href="https://www.techiedelight.com/find-maximum-profit-earned-at-most-k-stock-transactions/">Find maximum profit earned from at most K stock transactions</a></li></ol><h3>Backtracking</h3><ol><li><a href="https://www.techiedelight.com/print-possible-solutions-n-queens-problem/">Print all possible solutions to N Queens Problem</a></li><li><a href="https://www.techiedelight.com/print-possible-knights-tours-chessboard/">Print all Possible Knight’s Tours in a chessboard</a></li><li><a href="https://www.techiedelight.com/find-shortest-path-in-maze/">Find Shortest Path in Maze</a></li><li><a href="https://www.techiedelight.com/find-longest-possible-route-matrix/">Find Longest Possible Route in a Matrix</a></li><li><a href="https://www.techiedelight.com/find-path-source-destination-matrix-satisfies-given-constraints/">Find path from source to destination in a matrix that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/find-total-number-unique-paths-maze-source-destination/">Find total number of unique paths in a maze from source to destination</a></li><li><a href="https://www.techiedelight.com/print-all-hamiltonian-path-present-in-a-graph/">Print All Hamiltonian Path present in a graph</a></li><li><a href="https://www.techiedelight.com/print-k-colorable-configurations-graph-vertex-coloring-graph/">Print all k-colorable configurations of the graph (Vertex coloring of graph)</a></li><li><a href="https://www.techiedelight.com/find-permutations-given-string/">Find all Permutations of a given string</a></li><li><a href="https://www.techiedelight.com/find-combinations-of-elements-satisfies-given-constraints/">All combinations of elements satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/">Find all binary strings that can be formed from given wildcard pattern</a></li><li><a href="https://www.techiedelight.com/k-partition-problem-print-all-subsets/">K-Partition Problem | Printing all Partitions</a></li><li><a href="https://www.techiedelight.com/magnet-puzzle/">Magnet Puzzle</a></li><li><a href="https://www.techiedelight.com/find-ways-calculate-target-elements-array/">Find ways to calculate a target from elements of specified array</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-possible-k-swaps/">Find minimum number possible by doing at-most K swaps</a></li><li><a href="https://www.techiedelight.com/determine-pattern-matches-string-not/">Determine if a pattern matches with a string or not</a></li><li><a href="https://www.techiedelight.com/generate-list-of-possible-words-from-a-character-matrix/">Generate list of possible words from a character matrix</a></li><li><a href="https://www.techiedelight.com/find-path-between-vertices-directed-graph/">Find the path between given vertices in a directed graph</a></li><li><a href="https://www.techiedelight.com/find-all-possible-topological-orderings-of-dag/">Find all Possible Topological Orderings of a DAG</a></li><li><a href="https://www.techiedelight.com/print-all-shortest-routes-rectangular-grid/">Print all shortest routes in a rectangular grid</a></li></ol><h3>Binary</h3><ol><li><a href="https://www.techiedelight.com/bit-hacks-part-1-basic/">Bit Hacks — Part 1 (Basic)</a></li><li><a href="https://www.techiedelight.com/bit-hacks-part-2-playing-kth-bit/">Bit Hacks — Part 2 (Playing with k’th bit)</a></li><li><a href="https://www.techiedelight.com/bit-hacks-part-3-playing-rightmost-set-bit-number/">Bit Hacks — Part 3 (Playing with rightmost set bit of a number)</a></li><li><a href="https://www.techiedelight.com/bit-hacks-part-4-playing-letters-english-alphabet/">Bit Hacks — Part 4 (Playing with letters of English alphabet)</a></li><li><a href="https://www.techiedelight.com/bit-hacks-part-5-find-absolute-value-integer-without-branching/">Bit Hacks — Part 5 (Find absolute value of an integer without branching)</a></li><li><a href="https://www.techiedelight.com/bit-hacks-part-6-random-problems/">Bit Hacks — Part 6 (Random Problems)</a></li><li><a href="https://www.techiedelight.com/brian-kernighans-algorithm-count-set-bits-integer/">Brian Kernighan’s Algorithm to count set bits in an integer</a></li><li><a href="https://www.techiedelight.com/round-next-highest-power-2/">Round up to the next highest power of 2</a></li><li><a href="https://www.techiedelight.com/round-previous-power-2/">Round up to the previous power of 2</a></li><li><a href="https://www.techiedelight.com/compute-parity-number-using-lookup-table/">Compute parity of a number using lookup table</a></li><li><a href="https://www.techiedelight.com/count-set-bits-using-lookup-table/">Count set bits using lookup table</a></li><li><a href="https://www.techiedelight.com/find-minimum-maximum-two-integers-without-using-branching/">Find the minimum or maximum of two integers without using branching</a></li><li><a href="https://www.techiedelight.com/multiply-16-bit-integers-using-8-bit-multiplier/">Multiply 16-bit integers using 8-bit multiplier</a></li><li><a href="https://www.techiedelight.com/swap-individual-bits-given-position-integer/">Swap individual bits at given position in an integer</a></li><li><a href="https://www.techiedelight.com/check-given-number-power-of-4/">Check if given number is power of 4 or not</a></li><li><a href="https://www.techiedelight.com/check-given-number-power-8-not/">Check if given number is power of 8 or not</a></li><li><a href="https://www.techiedelight.com/reverse-bits-of-given-integer/">Reverse Bits of a given Integer</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-element-array-single-traversal/">Find odd occurring element in an array in single traversal</a></li><li><a href="https://www.techiedelight.com/find-two-odd-occurring-element-array-without-extra-space/">Find two odd occurring elements in an array without using any extra space</a></li><li><a href="https://www.techiedelight.com/swap-two-bits-given-position-integer/">Swap two bits at given position in an integer</a></li><li><a href="https://www.techiedelight.com/add-binary-representation-two-integers/">Add binary representation of two integers</a></li><li><a href="https://www.techiedelight.com/swap-adjacent-bits-number/">Swap Adjacent Bits of a Number</a></li><li><a href="https://www.techiedelight.com/print-distinct-subsets-given-set/">Print all distinct subsets of a given set</a></li><li><a href="https://www.techiedelight.com/perform-division-two-numbers-without-using-division-operator/">Perform Division of two numbers without using division operator (/)</a></li><li><a href="https://www.techiedelight.com/check-adjacent-bits-set-binary-representation-number/">Check if adjacent bits are set in binary representation of a given number</a></li><li><a href="https://www.techiedelight.com/conditionally-negate-value-without-branching/">Conditionally negate a value without branching</a></li><li><a href="https://www.techiedelight.com/find-two-duplicate-elements-limited-range-array-using-xor/">Find two duplicate elements in a limited range array (using XOR)</a></li><li><a href="https://www.techiedelight.com/reverse-bits-integer-using-lookup-table/">Reverse Bits of an integer using lookup table</a></li><li><a href="https://www.techiedelight.com/find-missing-number-duplicate-elements-array/">Find missing number and duplicate elements in an array</a></li><li><a href="https://www.techiedelight.com/circular-shift-integer-k-positions/">Circular shift on binary representation of an integer by k positions</a></li><li><a href="https://www.techiedelight.com/compute-modulus-division-without-division-modulo-operator/">Compute modulus division without division and modulo operator</a></li><li><a href="https://www.techiedelight.com/solve-problems-without-using-multiplication-division-operators/">Solve given set of problems without using multiplication or division operators</a></li><li><a href="https://www.techiedelight.com/find-xor-two-numbers-without-using-xor-operator/">Find XOR of two numbers without using XOR operator</a></li><li><a href="https://www.techiedelight.com/generate-power-set-given-set/">Generate power set of a given set</a></li><li><a href="https://www.techiedelight.com/huffman-coding/">Huffman Coding</a></li><li><a href="https://www.techiedelight.com/find-missing-number-array-without-extra-space/">Find missing number in array without using extra space</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-element-logn-time/">Find odd occurring element in logarithmic time</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-elements-array/">Find all odd occurring elements in an array having limited range of elements</a></li></ol><h3>Binary Tree</h3><ol><li><a href="https://www.techiedelight.com/check-if-two-binary-trees-are-identical-not-iterative-recursive/">Check if two given binary trees are identical or not</a></li><li><a href="https://www.techiedelight.com/calculate-height-binary-tree-iterative-recursive/">Calculate height of a binary tree</a></li><li><a href="https://www.techiedelight.com/delete-given-binary-tree-iterative-recursive/">Delete given Binary Tree</a></li><li><a href="https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/">Inorder Tree Traversal (Iterative &amp; Recursive Implementation)</a></li><li><a href="https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/">Preorder Tree Traversal (Iterative &amp; Recursive Implementation)</a></li><li><a href="https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/">Postorder Tree Traversal (Iterative &amp; Recursive Implementation)</a></li><li><a href="https://www.techiedelight.com/level-order-traversal-binary-tree/">Level Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/spiral-order-traversal-binary-tree/">Spiral Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/reverse-level-order-traversal-binary-tree/">Reverse Level Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-nodes-binary-tree-specific-order/">Print all nodes of a given binary tree in specific order</a></li><li><a href="https://www.techiedelight.com/print-left-view-of-binary-tree/">Print left view of binary tree</a></li><li><a href="https://www.techiedelight.com/print-bottom-view-of-binary-tree/">Print Bottom View of Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-top-view-binary-tree/">Print Top View of Binary Tree</a></li><li><a href="https://www.techiedelight.com/find-next-node-in-same-level-binary-tree/">Find next node in same level for given node in a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-complete-binary-tree-not/">Check if given binary tree is complete binary tree or not</a></li><li><a href="https://www.techiedelight.com/inplace-convert-a-tree-sum-tree/">In-place convert given binary tree to its sum tree</a></li><li><a href="https://www.techiedelight.com/determine-two-nodes-are-cousins/">Determine if given two nodes are cousins of each other</a></li><li><a href="https://www.techiedelight.com/print-cousins-of-given-node-binary-tree/">Print cousins of given node in a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-sum-tree-not/">Check if given binary tree is a sum tree or not</a></li><li><a href="https://www.techiedelight.com/combinations-of-words-formed-replacing-given-numbers-corresponding-english-alphabet/">Combinations of words formed by replacing given numbers with corresponding alphabets</a></li><li><a href="https://www.techiedelight.com/determine-given-binary-tree-is-subtree-of-another-binary-tree-not/">Determine if given binary tree is a subtree of another binary tree or not</a></li><li><a href="https://www.techiedelight.com/find-diameter-of-a-binary-tree/">Find diameter of a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-symmetric-structure-not/">Check if given binary Tree has symmetric structure or not</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-to-its-mirror/">Convert binary tree to its mirror</a></li><li><a href="https://www.techiedelight.com/determine-binary-tree-can-converted-another-number-swaps-left-right-child/">Check if binary tree can be converted to another by doing any no. of swaps of left &amp; right child</a></li><li><a href="https://www.techiedelight.com/find-lowest-common-ancestor-lca-two-nodes-binary-tree/">Find Lowest Common Ancestor (LCA) of two nodes in a binary tree</a></li><li><a href="https://www.techiedelight.com/print-all-paths-from-root-to-leaf-nodes-binary-tree/">Print all paths from root to leaf nodes in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-ancestors-of-given-node-binary-tree/">Find ancestors of given node in a Binary Tree</a></li><li><a href="https://www.techiedelight.com/distance-between-given-pairs-of-nodes-binary-tree/">Find the distance between given pairs of nodes in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-vertical-sum-given-binary-tree/">Find Vertical Sum in a given Binary Tree</a></li><li><a href="https://www.techiedelight.com/vertical-traversal-binary-tree/">Perform vertical traversal of a binary tree — I</a></li><li><a href="https://www.techiedelight.com/print-nodes-binary-tree-vertical-order/">Perform vertical traversal of a binary tree — II</a></li><li><a href="https://www.techiedelight.com/print-corner-nodes-every-level-binary-tree/">Print corner nodes of every level in binary tree</a></li><li><a href="https://www.techiedelight.com/find-diagonal-sum-given-binary-tree/">Find the diagonal sum of given binary tree</a></li><li><a href="https://www.techiedelight.com/print-diagonal-traversal-binary-tree/">Print Diagonal Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/place-convert-given-binary-tree-to-doubly-linked-list/">In-place convert Binary Tree to Doubly Linked List</a></li><li><a href="https://www.techiedelight.com/sink-nodes-containing-zero-bottom-binary-tree/">Sink nodes containing zero to the bottom of the binary tree</a></li><li><a href="https://www.techiedelight.com/convert-given-binary-tree-to-full-tree-removing-half-nodes/">Convert given binary tree to full tree by removing half nodes</a></li><li><a href="https://www.techiedelight.com/truncate-given-binary-tree-remove-nodes-lie-path-sum-less-k/">Truncate given binary tree to remove nodes which lie on a path having sum less than K</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-root-to-leaf-path-binary-tree/">Find maximum sum root-to-leaf path in a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-is-height-balanced-not/">Check if given binary tree is height balanced or not</a></li><li><a href="https://www.techiedelight.com/find-maximum-width-given-binary-tree/">Find maximum width of given binary tree</a></li><li><a href="https://www.techiedelight.com/convert-normal-binary-tree-left-child-right-sibling-binary-tree/">Convert normal binary tree to Left-child right-sibling binary tree</a></li><li><a href="https://www.techiedelight.com/determine-given-binary-tree-is-a-bst-or-not/">Determine if given Binary Tree is a BST or not</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-to-bst-maintaining-original-structure/">Convert a Binary Tree to BST by maintaining its original structure</a></li><li><a href="https://www.techiedelight.com/invert-binary-tree-recursive-iterative/">Invert a Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-right-view-binary-tree/">Print Right View of a Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-all-paths-from-leaf-to-root-binary-tree/">Print all paths from leaf to root node in given binary tree</a></li><li><a href="https://www.techiedelight.com/print-leaf-to-root-path-binary-tree/">Iteratively print leaf to root path for every leaf node in a binary tree</a></li><li><a href="https://www.techiedelight.com/build-binary-tree-given-parent-array/">Build Binary Tree from given Parent array</a></li><li><a href="https://www.techiedelight.com/find-all-nodes-at-given-distance-from-leaf-nodes-in-a-binary-tree/">Find all nodes at given distance from leaf nodes in a binary tree</a></li><li><a href="https://www.techiedelight.com/count-subtrees-value-nodes-binary-tree/">Count all subtrees having same value of nodes in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-maximum-difference-node-descendants/">Find Maximum Difference Between a Node and its Descendants in a Binary Tree</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-ancestor-matrix/">Construct a Binary Tree from Ancestor Matrix</a></li><li><a href="https://www.techiedelight.com/calculate-height-binary-tree-leaf-nodes-forming-circular-doubly-linked-list/">Calculate height of a binary tree with leaf nodes forming a circular doubly linked list</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-path-between-two-leaves-in-a-binary-tree/">Find maximum sum path between two leaves in a binary tree</a></li><li><a href="https://www.techiedelight.com/fix-binary-tree-one-swap-bst/">Fix a binary tree that is only one swap away from becoming a BST</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-from-inorder-preorder-traversal/">Construct a binary tree from inorder and preorder traversal</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-from-inorder-postorder-traversals/">Construct a binary tree from inorder and postorder traversals</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-from-inorder-level-order-traversals/">Construct a binary tree from inorder and level order sequence</a></li><li><a href="https://www.techiedelight.com/construct-full-binary-tree-from-preorder-sequence-with-leaf-information/">Construct a full binary tree from preorder sequence with leaf node information</a></li><li><a href="https://www.techiedelight.com/construct-full-binary-tree-from-preorder-postorder-sequence/">Construct a full binary tree from a preorder and postorder sequence</a></li><li><a href="https://www.techiedelight.com/set-next-pointer-inorder-successor-binary-tree/">Set next pointer to inorder successor of all nodes in binary tree</a></li><li><a href="https://www.techiedelight.com/print-nodes-between-two-levels-binary-tree/">Efficiently print all nodes between two given levels in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-preorder-traversal-binary-tree-from-inorder-postorder/">Find preorder traversal of a binary tree from its inorder and postorder sequence</a></li><li><a href="https://www.techiedelight.com/difference-between-sum-nodes-odd-even-levels/">Find the difference between sum of all nodes present at odd and even levels in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-size-largest-bst-in-binary-tree/">Find the size of the largest BST in a Binary Tree</a></li><li><a href="https://www.techiedelight.com/link-nodes-each-level-binary-tree/">Link nodes present in each level of a binary tree in the form of a linked list</a></li><li><a href="https://www.techiedelight.com/construct-cartesian-tree-from-inorder-traversal/">Construct a Cartesian Tree from In-order Traversal</a></li><li><a href="https://www.techiedelight.com/implementation-treap-data-structure-cpp-java-insert-search-delete/">Implementation of Treap Data Structure (Insert, Search and Delete)</a></li><li><a href="https://www.techiedelight.com/clone-a-binary-tree-with-random-pointers/">Clone a binary tree with random pointers</a></li><li><a href="https://www.techiedelight.com/threaded-binary-tree-overview-implementation/">Threaded Binary Tree: Overview and Implementation</a></li><li><a href="https://www.techiedelight.com/invert-alternate-levels-perfect-binary-tree/">Invert alternate levels of a perfect binary tree</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-into-doubly-linked-list/">Convert a Binary Tree into a Doubly Linked List in Spiral Order</a></li><li><a href="https://www.techiedelight.com/check-binary-tree-is-min-heap/">Check if a binary tree is a min-heap or not</a></li><li><a href="https://www.techiedelight.com/determine-binary-tree-satisfy-height-balanced-property-red-black-tree/">Determine if a binary tree satisfy the height-balanced property of red–black tree</a></li><li><a href="https://www.techiedelight.com/depth-first-search-dfs-vs-breadth-first-search-bfs/">Depth first search (DFS) vs Breadth first search (BFS)</a></li></ol><h3>BST</h3><ol><li><a href="https://www.techiedelight.com/insertion-in-bst/">Insertion in BST</a></li><li><a href="https://www.techiedelight.com/search-given-key-in-bst/">Search given key in BST</a></li><li><a href="https://www.techiedelight.com/deletion-from-bst/">Deletion from BST</a></li><li><a href="https://www.techiedelight.com/construct-balanced-bst-given-keys/">Construct balanced BST from given keys</a></li><li><a href="https://www.techiedelight.com/determine-given-binary-tree-is-a-bst-or-not/">Determine if given Binary Tree is a BST or not</a></li><li><a href="https://www.techiedelight.com/check-given-keys-represents-same-bsts-not-without-building-bst/">Check if given keys represents same BSTs or not without building the BST</a></li><li><a href="https://www.techiedelight.com/find-inorder-predecessor-given-key-bst/">Find inorder predecessor for given key in a BST</a></li><li><a href="https://www.techiedelight.com/find-lowest-common-ancestor-lca-two-nodes-bst/">Find Lowest Common Ancestor (LCA) of two nodes in a Binary Search Tree</a></li><li><a href="https://www.techiedelight.com/find-kth-smallest-largest-element-bst/">Find K’th smallest and K’th largest element in BST</a></li><li><a href="https://www.techiedelight.com/floor-ceil-bst-iterative-recursive/">Floor and Ceil in a Binary Search Tree</a></li><li><a href="https://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/">Find optimal cost to construct binary search tree</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-to-bst-maintaining-original-structure/">Convert a Binary Tree to BST by maintaining its original structure</a></li><li><a href="https://www.techiedelight.com/remove-nodes-bst-keys-outside-valid-range/">Remove nodes from BST that have keys outside the valid range</a></li><li><a href="https://www.techiedelight.com/find-pair-with-given-sum-bst/">Find a pair with given sum in a BST</a></li><li><a href="https://www.techiedelight.com/find-inorder-successor-given-key-bst/">Find inorder successor for given key in a BST</a></li><li><a href="https://www.techiedelight.com/replace-every-element-array-least-greater-element-right/">Replace every element of an array with the least greater element on its right</a></li><li><a href="https://www.techiedelight.com/fix-binary-tree-one-swap-bst/">Fix a binary tree that is only one swap away from becoming a BST</a></li><li><a href="https://www.techiedelight.com/update-every-key-bst-contain-sum-greater-keys/">Update every key in BST to contain sum of all greater keys</a></li><li><a href="https://www.techiedelight.com/check-sequence-represents-preorder-traversal-bst/">Check if a given sequence represents preorder traversal of a BST</a></li><li><a href="https://www.techiedelight.com/build-binary-search-tree-from-postorder-sequence/">Build a Binary Search Tree from a Postorder Sequence</a></li><li><a href="https://www.techiedelight.com/build-binary-search-tree-from-preorder-sequence/">Build a Binary Search Tree from a Preorder Sequence</a></li><li><a href="https://www.techiedelight.com/find-triplet-with-given-sum-bst/">Find a triplet with given sum in a BST</a></li><li><a href="https://www.techiedelight.com/count-subtrees-bst-whose-nodes-within-range/">Count subtrees in a BST whose nodes lies within a given range</a></li><li><a href="https://www.techiedelight.com/merge-two-bsts-into-doubly-linked-list-sorted-order/">Merge two BSTs into a doubly linked list in sorted order</a></li><li><a href="https://www.techiedelight.com/construct-height-balanced-bst-from-unbalanced-bst/">Construct a height-balanced BST from an unbalanced BST</a></li><li><a href="https://www.techiedelight.com/find-size-largest-bst-in-binary-tree/">Find the size of the largest BST in a Binary Tree</a></li><li><a href="https://www.techiedelight.com/convert-binary-search-tree-into-min-heap/">Convert a Binary Search Tree into a Min Heap</a></li><li><a href="https://www.techiedelight.com/construct-height-balanced-bst-from-sorted-doubly-linked-list/">Construct a Height-Balanced BST from a Sorted Doubly Linked List</a></li></ol><h3>Divide &amp; Conquer</h3><ol><li><a href="https://www.techiedelight.com/binary-search/">Binary Search Algorithm</a></li><li><a href="https://www.techiedelight.com/find-number-rotations-circularly-sorted-array/">Find number of rotations in a circularly sorted array</a></li><li><a href="https://www.techiedelight.com/search-element-circular-sorted-array/">Search an element in a circular sorted array</a></li><li><a href="https://www.techiedelight.com/find-first-or-last-occurrence-of-a-given-number-sorted-array/">Find first or last occurrence of a given number in a sorted array</a></li><li><a href="https://www.techiedelight.com/count-occurrences-number-sorted-array-duplicates/">Count occurrences of a number in a sorted array with duplicates</a></li><li><a href="https://www.techiedelight.com/find-smallest-missing-element-sorted-array/">Find smallest missing element from a sorted array</a></li><li><a href="https://www.techiedelight.com/find-floor-ceil-number-sorted-array/">Find Floor and Ceil of a number in a sorted array</a></li><li><a href="https://www.techiedelight.com/search-nearly-sorted-array-ologn-time/">Search in a nearly sorted array in logarithmic time</a></li><li><a href="https://www.techiedelight.com/find-number-1s-sorted-binary-array/">Find number of 1’s in a sorted binary array</a></li><li><a href="https://www.techiedelight.com/find-peak-element-array/">Find the peak element in an array</a></li><li><a href="https://www.techiedelight.com/maximum-sum-subarray-using-divide-conquer/">Maximum Sum Subarray using Divide &amp; Conquer</a></li><li><a href="https://www.techiedelight.com/power-function-implementation-recursive-iterative/">Efficiently implement a power function</a></li><li><a href="https://www.techiedelight.com/find-missing-term-sequence-ologn-time/">Find Missing Term in a Sequence in Logarithmic time</a></li><li><a href="https://www.techiedelight.com/division-two-numbers-using-binary-search-algorithm/">Division of Two Numbers using Binary Search Algorithm</a></li><li><a href="https://www.techiedelight.com/find-floor-ceil-number-sorted-array-recursive/">Find Floor and Ceil of a number in a sorted array (Recursive solution)</a></li><li><a href="https://www.techiedelight.com/find-frequency-element-sorted-array-containing-duplicates/">Find Frequency of each element in a sorted array containing duplicates</a></li><li><a href="https://www.techiedelight.com/find-odd-occurring-element-logn-time/">Find odd occurring element in logarithmic time</a></li><li><a href="https://www.techiedelight.com/ternary-search-vs-binary-search/">Ternary Search vs Binary search</a></li><li><a href="https://www.techiedelight.com/exponential-search/">Exponential search</a></li><li><a href="https://www.techiedelight.com/unbounded-binary-search/">Unbounded Binary Search</a></li><li><a href="https://www.techiedelight.com/interpolation-search/">Interpolation search</a></li><li><a href="https://www.techiedelight.com/merge-sort/">Merge Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/quicksort/">QuickSort Algorithm</a></li></ol><h3>Dynamic Programming</h3><ol><li><a href="https://www.techiedelight.com/introduction-dynamic-programming/">Introduction to Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence/">Longest Common Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence-lcs-space-optimized-version/">Longest Common Subsequence | Space optimized version</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence-of-k-sequences/">Longest Common Subsequence of K-sequences</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence-finding-lcs/">Longest Common Subsequence | Finding all LCS</a></li><li><a href="https://www.techiedelight.com/longest-common-substring-problem/">Longest Common Substring Problem</a></li><li><a href="https://www.techiedelight.com/longest-palindromic-subsequence-using-dynamic-programming/">Longest Palindromic Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-repeated-subsequence-problem/">Longest Repeated Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/implement-diff-utility/">Implement Diff Utility</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-introduction-scs-length/">Shortest Common Supersequence Problem</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-finding-scs/">Shortest Common Supersequence | Finding all SCS</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-using-lcs/">Shortest Common Supersequence Problem using LCS</a></li><li><a href="https://www.techiedelight.com/longest-increasing-subsequence-using-dynamic-programming/">Longest Increasing Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-decreasing-subsequence-problem/">Longest Decreasing Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-bitonic-subsequence/">Longest Bitonic Subsequence</a></li><li><a href="https://www.techiedelight.com/increasing-subsequence-with-maximum-sum/">Increasing Subsequence with Maximum Sum</a></li><li><a href="https://www.techiedelight.com/levenshtein-distance-edit-distance-problem/">The Levenshtein Distance (Edit Distance) Problem</a></li><li><a href="https://www.techiedelight.com/find-size-largest-square-sub-matrix-1s-present-given-binary-matrix/">Find size of largest square sub-matrix of 1’s present in given binary matrix</a></li><li><a href="https://www.techiedelight.com/matrix-chain-multiplication/">Matrix Chain Multiplication</a></li><li><a href="https://www.techiedelight.com/find-minimum-cost-reach-last-cell-matrix-first-cell/">Find the minimum cost to reach last cell of the matrix from its first cell</a></li><li><a href="https://www.techiedelight.com/find-longest-sequence-formed-adjacent-numbers-matrix/">Find longest sequence formed by adjacent numbers in the matrix</a></li><li><a href="https://www.techiedelight.com/counting-paths-on-grid-to-reach-destination-cell/">Count number of paths in a matrix with given cost to reach destination cell</a></li><li><a href="https://www.techiedelight.com/0-1-knapsack-problem/">0–1 Knapsack Problem</a></li><li><a href="https://www.techiedelight.com/maximize-value-of-the-expression/">Maximize value of the expression</a></li><li><a href="https://www.techiedelight.com/partition-problem/">Partition Problem</a></li><li><a href="https://www.techiedelight.com/subset-sum-problem/">Subset sum Problem</a></li><li><a href="https://www.techiedelight.com/3-partition-problem/">3-Partition Problem</a></li><li><a href="https://www.techiedelight.com/minimum-sum-partition-problem/">Minimum Sum Partition Problem</a></li><li><a href="https://www.techiedelight.com/rot-cutting/">Rod Cutting</a></li><li><a href="https://www.techiedelight.com/maximum-product-rod-cutting/">Maximum Product Rod Cutting</a></li><li><a href="https://www.techiedelight.com/coin-change-making-problem-unlimited-supply-coins/">Coin change-making problem (unlimited supply of coins)</a></li><li><a href="https://www.techiedelight.com/coin-change-problem-find-total-number-ways-get-denomination-coins/">Coin Change Problem — Find total number of ways to get the denomination of coins</a></li><li><a href="https://www.techiedelight.com/total-possible-solutions-linear-equation-k-variables/">Total possible solutions to linear equation of k variables</a></li><li><a href="https://www.techiedelight.com/longest-alternating-subsequence/">Longest Alternating Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/count-number-times-pattern-appears-given-string-subsequence/">Count number of times a pattern appears in given string as a subsequence</a></li><li><a href="https://www.techiedelight.com/collect-maximum-points-matrix-satisfying-given-constraints/">Collect maximum points in a matrix by satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/find-n-digit-binary-strings-without-consecutive-1s/">Find all N-digit binary strings without any consecutive 1’s</a></li><li><a href="https://www.techiedelight.com/count-total-possible-combinations-n-digit-numbers-mobile-keypad/">Count total possible combinations of N-digit numbers in a mobile keypad</a></li><li><a href="https://www.techiedelight.com/word-break-problem/">Word Break Problem</a></li><li><a href="https://www.techiedelight.com/determine-minimal-adjustment-cost-array/">Determine Minimal Adjustment Cost of an Array</a></li><li><a href="https://www.techiedelight.com/check-given-string-k-palindrome-not/">Check if a string is K-Palindrome or not</a></li><li><a href="https://www.techiedelight.com/total-ways-sum-with-n-throws-dice-having-k-faces/">Find total ways to achieve given sum with n throws of dice having k faces</a></li><li><a href="https://www.techiedelight.com/wildcard-pattern-matching/">Wildcard Pattern Matching</a></li><li><a href="https://www.techiedelight.com/find-ways-fill-n-x-4-matrix-with-1-x-4-tiles/">Find number of ways to fill a N x 4 matrix with 1 x 4 tiles</a></li><li><a href="https://www.techiedelight.com/reach-bottom-right-corner-matrix-exactly-k-turns/">Ways to reach the bottom-right corner of a matrix with exactly k turns allowed</a></li><li><a href="https://www.techiedelight.com/weighted-interval-scheduling-problem/">Weighted Interval Scheduling Problem</a></li><li><a href="https://www.techiedelight.com/box-stacking-problem/">Box Stacking Problem</a></li><li><a href="https://www.techiedelight.com/find-total-ways-reach-nth-stair-with-atmost-m-steps/">Find total ways to reach the n’th stair with at-most m steps</a></li><li><a href="https://www.techiedelight.com/find-total-ways-to-reach-nth-stair/">Find total ways to reach the n’th stair from the bottom</a></li><li><a href="https://www.techiedelight.com/activity-selection-problem-using-dynamic-programming/">Activity Selection Problem</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-deletions-convert-string-into-palindrome/">Find minimum number of deletions required to convert a string into palindrome</a></li><li><a href="https://www.techiedelight.com/calculate-minimum-cost-to-reach-destination-city-from-source-city/">Calculate minimum cost to reach destination city from source city</a></li><li><a href="https://www.techiedelight.com/pots-gold-game-dynamic-programming/">Pots of Gold Game Problem</a></li><li><a href="https://www.techiedelight.com/find-minimum-cuts-needed-palindromic-partition-string/">Find minimum cuts needed for palindromic partition of a string</a></li><li><a href="https://www.techiedelight.com/weighted-interval-scheduling-problem-using-lis/">Weighted Interval Scheduling using LIS algorithm</a></li><li><a href="https://www.techiedelight.com/find-minimum-jumps-required-reach-destination/">Find minimum jumps required to reach the destination</a></li><li><a href="https://www.techiedelight.com/probability-alive-after-taking-n-steps-island/">Find probability that a person is alive after taking N steps on the island</a></li><li><a href="https://www.techiedelight.com/maximum-sum-of-subsequence-with-no-adjacent-elements/">Find maximum sum of subsequence with no adjacent elements</a></li><li><a href="https://www.techiedelight.com/maximum-length-snake-sequence/">Maximum Length Snake Sequence</a></li><li><a href="https://www.techiedelight.com/calculate-size-largest-plus-1s-binary-matrix/">Calculate size of the largest plus of 1’s in binary matrix</a></li><li><a href="https://www.techiedelight.com/longest-increasing-subsequence-using-lcs/">Longest Increasing Subsequence using LCS</a></li><li><a href="https://www.techiedelight.com/find-maximum-profit-earned-at-most-k-stock-transactions/">Find maximum profit earned from at most K stock transactions</a></li><li><a href="https://www.techiedelight.com/count-all-paths-matrix-from-first-cell-to-last-cell/">Count all paths in a matrix from first cell to last cell</a></li><li><a href="https://www.techiedelight.com/check-string-matches-with-wildcard-pattern/">Check if a string matches with a given wildcard pattern</a></li><li><a href="https://www.techiedelight.com/check-string-interleaving-two-given-strings/">Check if given string is interleaving of two other given strings</a></li><li><a href="https://www.techiedelight.com/find-employees-who-reports-to-manager/">Find all employees who directly or indirectly reports to a manager</a></li><li><a href="https://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/">Find optimal cost to construct binary search tree</a></li><li><a href="https://www.techiedelight.com/maximum-sum-of-subsequence-with-no-adjacent-elements/">Find maximum sum of subsequence with no adjacent elements</a></li><li><a href="https://www.techiedelight.com/maximum-subarray-problem-kadanes-algorithm/">Maximum Sum Subarray Problem (Kadane’s Algorithm)</a></li><li><a href="https://www.techiedelight.com/longest-alternating-subarray-problem/">Longest Alternating Subarray Problem</a></li><li><a href="https://www.techiedelight.com/collect-maximum-value-coins-matrix/">Collect maximum value of coins in a matrix</a></li><li><a href="https://www.techiedelight.com/find-length-longest-path-matrix-consecutive-characters/">Find length of longest path in the matrix with consecutive characters</a></li><li><a href="https://www.techiedelight.com/find-ways-calculate-target-elements-array/">Find ways to calculate a target from elements of specified array</a></li><li><a href="https://www.techiedelight.com/calculate-sum-elements-sub-matrix-constant-time/">Calculate sum of all elements in a sub-matrix in constant time</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-submatrix-in-given-matrix/">Find maximum sum K x K sub-matrix in a given M x N matrix</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-submatrix-present-given-matrix/">Find maximum sum submatrix present in a given matrix</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-bellman-ford-algorithm/">Single-Source Shortest Paths — Bellman Ford Algorithm</a></li><li><a href="https://www.techiedelight.com/pairs-shortest-paths-floyd-warshall-algorithm/">All-Pairs Shortest Paths — Floyd Warshall Algorithm</a></li></ol><h3>Graph</h3><ol><li><a href="https://www.techiedelight.com/terminology-and-representations-of-graphs/">Terminology and Representations of Graphs</a></li><li>Graph Implementation — <a href="https://www.techiedelight.com/implement-graph-data-structure-c/">C</a>, <a href="https://www.techiedelight.com/graph-implementation-c-without-using-stl/">C++</a>, <a href="https://www.techiedelight.com/graph-implementation-using-stl/">C++ (STL)</a>, <a href="https://www.techiedelight.com/graph-implementation-java-using-collections/">Java (Collections)</a>, <a href="https://www.techiedelight.com/graph-implementation-python/">Python</a></li><li><a href="https://www.techiedelight.com/breadth-first-search/">Breadth First Search (BFS) Algorithm</a></li><li><a href="https://www.techiedelight.com/depth-first-search/">Depth First Search (DFS) Algorithm</a></li><li><a href="https://www.techiedelight.com/depth-first-search-dfs-vs-breadth-first-search-bfs/">Depth first search (DFS) vs Breadth first search (BFS)</a></li><li><a href="https://www.techiedelight.com/arrival-departure-time-vertices-dfs/">Arrival and Departure Time of Vertices in DFS</a></li><li><a href="https://www.techiedelight.com/types-edges-involved-dfs-relation/">Types of edges involved in DFS and relation between them</a></li><li><a href="https://www.techiedelight.com/bipartite-graph/">Bipartite Graph</a></li><li><a href="https://www.techiedelight.com/determine-given-graph-bipartite-graph-using-dfs/">Determine if a given graph is Bipartite Graph using DFS</a></li><li><a href="https://www.techiedelight.com/min-throws-required-to-win-snake-and-ladder-game/">Snake and Ladder Problem</a></li><li><a href="https://www.techiedelight.com/topological-sorting-dag/">Topological Sorting in a DAG</a></li><li><a href="https://www.techiedelight.com/kahn-topological-sort-algorithm/">Kahn’s Topological Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/transitive-closure-graph/">Transitive Closure of a Graph</a></li><li><a href="https://www.techiedelight.com/check-undirected-graph-contains-cycle-not/">Check if an undirected graph contains cycle or not</a></li><li><a href="https://www.techiedelight.com/total-paths-in-digraph-from-source-to-destination-m-edges/">Total paths in given digraph from given source to destination having exactly m edges</a></li><li><a href="https://www.techiedelight.com/determine-undirected-graph-tree-acyclic-connected-graph/">Determine if an undirected graph is a Tree (Acyclic Connected Graph)</a></li><li><a href="https://www.techiedelight.com/2-edge-connectivity-graph/">2-Edge Connectivity in the graph</a></li><li><a href="https://www.techiedelight.com/2-vertex-connectivity-graph/">2-Vertex Connectivity in the graph</a></li><li><a href="https://www.techiedelight.com/check-given-digraph-dag-directed-acyclic-graph-not/">Check if given digraph is a DAG (Directed Acyclic Graph) or not</a></li><li><a href="https://www.techiedelight.com/disjoint-set-data-structure-union-find-algorithm/">Disjoint-Set Data Structure (Union-Find Algorithm)</a></li><li><a href="https://www.techiedelight.com/chess-knight-problem-find-shortest-path-source-destination/">Chess Knight Problem — Find Shortest path from source to destination</a></li><li><a href="https://www.techiedelight.com/check-given-graph-strongly-connected-not/">Check if given Graph is Strongly Connected or not</a></li><li><a href="https://www.techiedelight.com/check-graph-strongly-connected-one-dfs-traversal/">Check if given Graph is Strongly Connected or not using one DFS Traversal</a></li><li><a href="https://www.techiedelight.com/union-find-algorithm-cycle-detection-graph/">Union-Find Algorithm for Cycle Detection in undirected graph</a></li><li><a href="https://www.techiedelight.com/kruskals-algorithm-for-finding-minimum-spanning-tree/">Kruskal’s Algorithm for finding Minimum Spanning Tree</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-dijkstras-algorithm/">Single-Source Shortest Paths — Dijkstra’s Algorithm</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-bellman-ford-algorithm/">Single-Source Shortest Paths — Bellman Ford Algorithm</a></li><li><a href="https://www.techiedelight.com/pairs-shortest-paths-floyd-warshall-algorithm/">All-Pairs Shortest Paths — Floyd Warshall Algorithm</a></li><li><a href="https://www.techiedelight.com/cost-of-shortest-path-in-dag-using-one-pass-of-bellman-ford/">Find Cost of Shortest Path in DAG using one pass of Bellman-Ford</a></li><li><a href="https://www.techiedelight.com/least-cost-path-weighted-digraph-using-bfs/">Least Cost Path in Weighted Digraph using BFS</a></li><li><a href="https://www.techiedelight.com/maximum-cost-path-graph-source-destination/">Find maximum cost path in graph from given source to destination</a></li><li><a href="https://www.techiedelight.com/determine-negative-weight-cycle-graph/">Determine negative-weight cycle in a graph</a></li><li><a href="https://www.techiedelight.com/least-cost-path-digraph-source-destination-m-edges/">Least cost path in given digraph from given source to destination having exactly m edges</a></li><li><a href="https://www.techiedelight.com/find-path-between-vertices-directed-graph/">Find the path between given vertices in a directed graph</a></li><li><a href="https://www.techiedelight.com/find-all-possible-topological-orderings-of-dag/">Find all Possible Topological Orderings of a DAG</a></li><li><a href="https://www.techiedelight.com/find-correct-order-alphabets-dictionary-ancient-origin/">Find the correct order of alphabets in a given dictionary of ancient origin</a></li><li><a href="https://www.techiedelight.com/find-cost-longest-path-dag/">Find longest path in a Directed Acyclic Graph (DAG)</a></li><li><a href="https://www.techiedelight.com/construct-directed-graph-from-undirected-graph/">Construct a directed graph from undirected graph that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/print-k-colorable-configurations-graph-vertex-coloring-graph/">Print all k-colorable configurations of the graph (Vertex coloring of graph)</a></li><li><a href="https://www.techiedelight.com/print-all-hamiltonian-path-present-in-a-graph/">Print All Hamiltonian Path present in a graph</a></li><li><a href="https://www.techiedelight.com/greedy-coloring-graph/">Graph Coloring Problem</a></li></ol><h3>Greedy</h3><ol><li><a href="https://www.techiedelight.com/activity-selection-problem/">Activity Selection Problem</a></li><li><a href="https://www.techiedelight.com/huffman-coding/">Huffman Coding</a></li><li><a href="https://www.techiedelight.com/job-sequencing-problem-deadlines/">Job Sequencing Problem with Deadlines</a></li><li><a href="https://www.techiedelight.com/greedy-coloring-graph/">Graph Coloring Problem</a></li><li><a href="https://www.techiedelight.com/kruskals-algorithm-for-finding-minimum-spanning-tree/">Kruskal’s Algorithm for finding Minimum Spanning Tree</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-dijkstras-algorithm/">Single-Source Shortest Paths — Dijkstra’s Algorithm</a></li><li><a href="https://www.techiedelight.com/shortest-superstring-problem/">Shortest Superstring Problem</a></li></ol><h3>Heap</h3><ol><li><a href="https://www.techiedelight.com/introduction-priority-queues-using-binary-heaps/">Introduction to Priority Queues using Binary Heaps</a></li><li>Min Heap and Max Heap Implementation — <a href="https://www.techiedelight.com/min-heap-max-heap-implementation-c/">C++</a>, <a href="https://www.techiedelight.com/min-heap-max-heap-implementation-in-java/">Java</a></li><li><a href="https://www.techiedelight.com/heap-sort-place-place-implementation-c-c/">Heap Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/check-given-array-represents-min-heap-not/">Check if given array represents min heap or not</a></li><li><a href="https://www.techiedelight.com/convert-max-heap-min-heap-linear-time/">Convert Max Heap to Min Heap in linear time</a></li><li><a href="https://www.techiedelight.com/find-kth-largest-element-array/">Find K’th largest element in an array</a></li><li><a href="https://www.techiedelight.com/sort-k-sorted-array/">Sort a K-Sorted Array</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-variable-length/">Merge M sorted lists of variable length</a></li><li><a href="https://www.techiedelight.com/efficiently-merge-k-sorted-linked-lists/">Merge K sorted linked lists</a></li><li><a href="https://www.techiedelight.com/find-kth-smallest-element-array/">Find K’th smallest element in an array</a></li><li><a href="https://www.techiedelight.com/find-smallest-range-least-one-element-given-lists/">Find smallest range with at-least one element from each of the given lists</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/">Merge M sorted lists each containing N elements</a></li><li><a href="https://www.techiedelight.com/first-k-non-repeating-characters-string/">Find first k non-repeating characters in a string in single traversal</a></li><li><a href="https://www.techiedelight.com/find-first-k-maximum-occurring-words-given-set-strings/">Find first k maximum occurring words in given set of strings</a></li><li><a href="https://www.techiedelight.com/implementation-treap-data-structure-cpp-java-insert-search-delete/">Implementation of Treap Data Structure (Insert, Search and Delete)</a></li><li><a href="https://www.techiedelight.com/convert-binary-search-tree-into-min-heap/">Convert a Binary Search Tree into a Min Heap</a></li><li><a href="https://www.techiedelight.com/check-binary-tree-is-min-heap/">Check if a binary tree is a min-heap or not</a></li><li><a href="https://www.techiedelight.com/huffman-coding/">Huffman Coding</a></li><li><a href="https://www.techiedelight.com/external-merge-sort/">External Merge Sort Algorithm</a></li></ol><h3>Linked List</h3><ol><li><a href="https://www.techiedelight.com/introduction-linked-lists/">Introduction to Linked Lists</a></li><li>Linked List Implementation — <a href="https://www.techiedelight.com/linked-list-implementation-part-1/">C</a>, <a href="https://www.techiedelight.com/linked-list-implementation-cpp/">C++</a>, <a href="https://www.techiedelight.com/linked-list-implementation-java/">Java</a>, <a href="https://www.techiedelight.com/linked-list-implementation-python/">Python</a></li><li><a href="https://www.techiedelight.com/linked-list-implementation-part-2/">Linked List | Insertion at Tail</a></li><li><a href="https://www.techiedelight.com/static-linked-list-c/">Static Linked List</a></li><li><a href="https://www.techiedelight.com/clone-given-linked-list/">Clone given Linked List</a></li><li><a href="https://www.techiedelight.com/delete-linked-list/">Delete Linked List</a></li><li><a href="https://www.techiedelight.com/pop-operation-in-linked-list/">Pop operation in linked list</a></li><li><a href="https://www.techiedelight.com/sorted-insert-in-linked-list/">Insert given node into the correct sorted position in the given sorted linked list</a></li><li><a href="https://www.techiedelight.com/given-linked-list-change-sorted-order/">Rearrange linked list in increasing order (Sort linked list)</a></li><li><a href="https://www.techiedelight.com/split-nodes-given-linked-list-front-back-halves/">Split the nodes of the given linked list into front and back halves</a></li><li><a href="https://www.techiedelight.com/remove-duplicates-sorted-linked-list/">Remove duplicates from a sorted linked list</a></li><li><a href="https://www.techiedelight.com/move-front-node-given-list-front-another-list/">Move front node of the given list to the front of the another list</a></li><li><a href="https://www.techiedelight.com/move-even-nodes-to-end-of-list-in-reverse-order/">Move even nodes to the end of the list in reverse order</a></li><li><a href="https://www.techiedelight.com/split-linked-list-into-two-lists-list-containing-alternating-elements/">Split given linked list into two lists where each list containing alternating elements from it</a></li><li><a href="https://www.techiedelight.com/merge-alternate-nodes-two-linked-lists/">Construct a linked list by merging alternate nodes of two given lists</a></li><li><a href="https://www.techiedelight.com/merge-sort-singly-linked-list/">Merge Sort Algorithm for Singly Linked List</a></li><li><a href="https://www.techiedelight.com/merge-given-sorted-linked-lists/">Merge two sorted linked lists into one</a></li><li><a href="https://www.techiedelight.com/efficiently-merge-k-sorted-linked-lists/">Merge K sorted linked lists</a></li><li><a href="https://www.techiedelight.com/intersection-two-given-sorted-linked-lists/">Intersection of two given sorted linked lists</a></li><li><a href="https://www.techiedelight.com/reverse-linked-list-part-1-iterative-solution/">Reverse Linked List (Iterative Solution)</a></li><li><a href="https://www.techiedelight.com/reverse-linked-list-part-2-recursive-solution/">Reverse Linked List (Recursive Solution)</a></li><li><a href="https://www.techiedelight.com/reverse-every-k-nodes-of-a-linked-list/">Reverse every group of k nodes in given linked list</a></li><li><a href="https://www.techiedelight.com/find-kth-node-from-the-end-linked-list/">Find K’th node from the end in a linked list</a></li><li><a href="https://www.techiedelight.com/merge-alternate-nodes-two-linked-lists-first-list/">Merge alternate nodes of two linked lists into the first list</a></li><li><a href="https://www.techiedelight.com/merge-two-sorted-linked-lists-end/">Merge two sorted linked lists from their end</a></li><li><a href="https://www.techiedelight.com/delete-every-n-nodes-linked-list-skipping-m-nodes/">Delete every N nodes in a linked list after skipping M nodes</a></li><li><a href="https://www.techiedelight.com/rearrange-linked-list-specific-manner-linear-time/">Rearrange linked list in specific manner in linear time</a></li><li><a href="https://www.techiedelight.com/check-if-linked-list-is-palindrome/">Check if linked list is palindrome or not</a></li><li><a href="https://www.techiedelight.com/move-last-node-to-front-linked-list/">Move last node to front in a given Linked List</a></li><li><a href="https://www.techiedelight.com/rearrange-the-linked-list-specific-manner/">Rearrange the linked list in specific manner</a></li><li><a href="https://www.techiedelight.com/detect-cycle-linked-list-floyds-cycle-detection-algorithm/">Detect Cycle in a linked list (Floyd’s Cycle Detection Algorithm)</a></li><li><a href="https://www.techiedelight.com/sort-linked-list-containing-0s-1s-2s/">Sort linked list containing 0’s, 1’s and 2’s</a></li><li><a href="https://www.techiedelight.com/stack-implementation-using-linked-list/">Implement Stack using Linked List</a></li><li><a href="https://www.techiedelight.com/queue-implementation-using-linked-list/">Implement Queue using Linked List</a></li><li><a href="https://www.techiedelight.com/remove-duplicates-linked-list/">Remove duplicates from a linked list</a></li><li><a href="https://www.techiedelight.com/rearrange-linked-list-alternating-high-low-values/">Rearrange the linked list so that it has alternating high, low values</a></li><li><a href="https://www.techiedelight.com/rearrange-linked-list-separating-odd-nodes-even/">Rearrange a Linked List by Separating Odd Nodes from the Even Ones</a></li><li><a href="https://www.techiedelight.com/calculate-height-binary-tree-leaf-nodes-forming-circular-doubly-linked-list/">Calculate height of a binary tree with leaf nodes forming a circular doubly linked list</a></li><li><a href="https://www.techiedelight.com/xor-linked-list-overview-implementation-c-cpp/">XOR Linked List: Overview and Implementation</a></li><li><a href="https://www.techiedelight.com/convert-multilevel-linked-list-singly/">Convert a multilevel linked list to a singly linked list</a></li><li><a href="https://www.techiedelight.com/recursively-check-linked-list-characters-palindrome-or-not/">Recursively check if linked list of characters is palindrome or not</a></li><li><a href="https://www.techiedelight.com/merge-two-bsts-into-doubly-linked-list-sorted-order/">Merge two BSTs into a doubly linked list in sorted order</a></li><li><a href="https://www.techiedelight.com/remove-redundant-nodes-path-formed-linked-list/">Remove redundant nodes from a path formed by a linked list</a></li><li><a href="https://www.techiedelight.com/add-single-digit-number-linked-list-representing-number/">Add a single-digit number to a linked list representing a number</a></li><li><a href="https://www.techiedelight.com/reverse-alternate-group-k-nodes-linked-list/">Reverse every alternate group of k nodes in a linked list</a></li><li><a href="https://www.techiedelight.com/determine-linked-list-palindrome-or-not/">Determine if a given linked list is a palindrome or not</a></li><li><a href="https://www.techiedelight.com/sort-doubly-linked-list-merge-sort/">Sort a Doubly Linked List using Merge Sort</a></li><li><a href="https://www.techiedelight.com/reverse-doubly-linked-list/">Reverse a Doubly Linked List</a></li><li><a href="https://www.techiedelight.com/pairwise-swap-adjacent-nodes-linked-list/">Pairwise swap adjacent nodes of a linked list</a></li><li><a href="https://www.techiedelight.com/flatten-linked-list/">Flatten a linked list</a></li><li><a href="https://www.techiedelight.com/check-linked-list-strings-palindromic/">Check if a Linked List of String is Palindromic</a></li><li><a href="https://www.techiedelight.com/flatten-multilevel-linked-list/">Flatten a multilevel linked list</a></li><li><a href="https://www.techiedelight.com/construct-height-balanced-bst-from-unbalanced-bst/">Construct a height-balanced BST from an unbalanced BST</a></li><li><a href="https://www.techiedelight.com/swap-kth-node-beginning-with-kth-node-end/">Swap K’th node from beginning with K’th node from end in a Linked List</a></li><li><a href="https://www.techiedelight.com/add-two-linked-lists-without-using-extra-space/">Add two linked lists without using any extra space</a></li><li><a href="https://www.techiedelight.com/clone-a-linked-list-with-random-pointers/">Clone a Linked List with Random Pointers</a></li><li><a href="https://www.techiedelight.com/update-random-pointer-linked-list-node-maximum-node/">Update random pointer for each linked list node to point to the maximum node</a></li><li><a href="https://www.techiedelight.com/link-nodes-each-level-binary-tree/">Link nodes present in each level of a binary tree in the form of a linked list</a></li><li><a href="https://www.techiedelight.com/convert-ternary-tree-doubly-linked-list/">Convert a Ternary Tree to a Doubly Linked List</a></li><li><a href="https://www.techiedelight.com/print-nodes-binary-tree-vertical-order/">Print nodes of a given binary tree in vertical order</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-into-doubly-linked-list/">Convert a Binary Tree into a Doubly Linked List in Spiral Order</a></li><li><a href="https://www.techiedelight.com/construct-height-balanced-bst-from-sorted-doubly-linked-list/">Construct a Height-Balanced BST from a Sorted Doubly Linked List</a></li><li><a href="https://www.techiedelight.com/in-place-merge-two-sorted-linked-lists/">In-place merge two sorted linked lists without modifying links of the first list</a></li><li><a href="https://www.techiedelight.com/reverse-specified-portion-linked-list/">Reverse specified portion of a Linked List</a></li></ol><h3>Matrix</h3><ol><li><a href="https://www.techiedelight.com/print-matrix-spiral-order/">Print Matrix in Spiral Order</a></li><li><a href="https://www.techiedelight.com/create-spiral-matrix-given-array/">Create Spiral Matrix from given array</a></li><li><a href="https://www.techiedelight.com/shift-matrix-elements-1-spiral-order/">Shift all matrix elements by 1 in Spiral Order</a></li><li><a href="https://www.techiedelight.com/find-shortest-path-source-destination-matrix-satisfies-given-constraints/">Find Shortest path from source to destination in a matrix that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/change-elements-row-column-j-matrix-0-cell-j-value-0/">Change all elements of row i and column j in a matrix to 0 if cell (i, j) has value 0</a></li><li><a href="https://www.techiedelight.com/print-matrix-diagonally-positive-slope/">Print diagonal elements of the matrix having positive slope</a></li><li><a href="https://www.techiedelight.com/find-all-paths-from-source-to-destination-in-matrix/">Find all paths from first cell to last cell of a matrix</a></li><li><a href="https://www.techiedelight.com/replace-occurrences-0-not-surrounded-1-binary-matrix/">Replace all occurrences of 0 that are not surrounded by 1 in a binary matrix</a></li><li><a href="https://www.techiedelight.com/place-rotate-matrix-90-degrees-clock-wise-direction/">In-place rotate the matrix by 90 degrees in clock-wise direction</a></li><li><a href="https://www.techiedelight.com/count-negative-elements-present-sorted-matrix/">Count negative elements present in sorted matrix in linear time</a></li><li><a href="https://www.techiedelight.com/report-all-occurrences-of-an-element-in-sorted-matrix/">Report all occurrences of an element in row wise and column wise sorted matrix in linear time</a></li><li><a href="https://www.techiedelight.com/calculate-sum-elements-sub-matrix-constant-time/">Calculate sum of all elements in a sub-matrix in constant time</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-submatrix-in-given-matrix/">Find maximum sum K x K sub-matrix in a given M x N matrix</a></li><li><a href="https://www.techiedelight.com/find-maximum-sum-submatrix-present-given-matrix/">Find maximum sum submatrix present in a given matrix</a></li><li><a href="https://www.techiedelight.com/count-the-number-of-islands/">Count the number of islands</a></li><li><a href="https://www.techiedelight.com/flood-fill-algorithm/">Flood Fill Algorithm</a></li><li><a href="https://www.techiedelight.com/find-shortest-safe-route-field-sensors-present/">Find shortest safe route in a field with sensors present</a></li><li><a href="https://www.techiedelight.com/find-occurrences-given-string-character-matrix/">Find all occurrences of given string in a character matrix</a></li><li><a href="https://www.techiedelight.com/lee-algorithm-shortest-path-in-a-maze/">Shortest path in a Maze | Lee Algorithm</a></li><li><a href="https://www.techiedelight.com/check-given-matrix-toeplitz-matrix-not/">Check if given matrix is Toeplitz matrix or not</a></li><li><a href="https://www.techiedelight.com/inplace-rotate-matrix-180-degrees/">In-place rotate the matrix by 180 degrees</a></li><li><a href="https://www.techiedelight.com/fill-binary-matrix-alternating-rectangles-0-1/">Fill Binary Matrix with Alternating Rectangles of 0 and 1</a></li><li><a href="https://www.techiedelight.com/find-common-elements-present-every-row-given-matrix/">Find all common elements present in every row of given matrix</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-ancestor-matrix/">Construct a Binary Tree from Ancestor Matrix</a></li><li><a href="https://www.techiedelight.com/find-common-elements-present-rows-matrix/">Find common elements present in all rows of a matrix</a></li><li><a href="https://www.techiedelight.com/find-index-row-containing-maximum-number-1s-matrix/">Find index of the row containing maximum number of 1’s in a binary matrix</a></li><li><a href="https://www.techiedelight.com/largest-square-sub-matrix-surrounded-by-1s/">Find the largest square sub-matrix which is surrounded by all 1&#39;s</a></li><li><a href="https://www.techiedelight.com/find-minimum-passes-required-convert-negative-values-matrix/">Find minimum passes required to convert all negative values in the matrix</a></li><li><a href="https://www.techiedelight.com/print-spiral-square-matrix-without-extra-space/">Print a spiral square matrix without using any extra space</a></li><li><a href="https://www.techiedelight.com/print-all-shortest-routes-rectangular-grid/">Print all shortest routes in a rectangular grid</a></li><li><a href="https://www.techiedelight.com/find-length-longest-path-matrix-consecutive-characters/">Find length of longest path in the matrix with consecutive characters</a></li><li><a href="https://www.techiedelight.com/collect-maximum-value-coins-matrix/">Collect maximum value of coins in a matrix</a></li><li><a href="https://www.techiedelight.com/young-tableau-insert-search-extract-min-delete-replace/">Young Tableau | Insert, Search, Extract-Min, Delete, Replace</a></li><li><a href="https://www.techiedelight.com/sort-array-using-young-tableau/">Sort an array using Young tableau</a></li><li><a href="https://www.techiedelight.com/find-path-source-destination-matrix-satisfies-given-constraints/">Find path from source to destination in a matrix that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/generate-list-of-possible-words-from-a-character-matrix/">Generate list of possible words from a character matrix</a></li><li><a href="https://www.techiedelight.com/probability-alive-after-taking-n-steps-island/">Find probability that a person is alive after taking N steps on the island</a></li><li><a href="https://www.techiedelight.com/collect-maximum-points-matrix-satisfying-given-constraints/">Collect maximum points in a matrix by satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/counting-paths-on-grid-to-reach-destination-cell/">Count number of paths in a matrix with given cost to reach destination cell</a></li><li><a href="https://www.techiedelight.com/find-longest-sequence-formed-adjacent-numbers-matrix/">Find longest sequence formed by adjacent numbers in the matrix</a></li><li><a href="https://www.techiedelight.com/find-minimum-cost-reach-last-cell-matrix-first-cell/">Find the minimum cost to reach last cell of the matrix from its first cell</a></li><li><a href="https://www.techiedelight.com/reach-bottom-right-corner-matrix-exactly-k-turns/">Ways to reach the bottom-right corner of a matrix with exactly k turns allowed</a></li><li><a href="https://www.techiedelight.com/matrix-chain-multiplication/">Matrix Chain Multiplication</a></li><li><a href="https://www.techiedelight.com/find-size-largest-square-sub-matrix-1s-present-given-binary-matrix/">Find size of largest square sub-matrix of 1’s present in given binary matrix</a></li><li><a href="https://www.techiedelight.com/chess-knight-problem-find-shortest-path-source-destination/">Chess Knight Problem — Find Shortest path from source to destination</a></li><li><a href="https://www.techiedelight.com/find-duplicate-rows-binary-matrix/">Find Duplicate rows in a binary matrix</a></li><li><a href="https://www.techiedelight.com/print-possible-solutions-n-queens-problem/">Print all possible solutions to N Queens Problem</a></li><li><a href="https://www.techiedelight.com/print-possible-knights-tours-chessboard/">Print all Possible Knight’s Tours in a chessboard</a></li><li><a href="https://www.techiedelight.com/find-shortest-path-in-maze/">Find Shortest Path in Maze</a></li><li><a href="https://www.techiedelight.com/find-longest-possible-route-matrix/">Find Longest Possible Route in a Matrix</a></li><li><a href="https://www.techiedelight.com/find-total-number-unique-paths-maze-source-destination/">Find total number of unique paths in a maze from source to destination</a></li><li><a href="https://www.techiedelight.com/calculate-size-largest-plus-1s-binary-matrix/">Calculate size of the largest plus of 1’s in binary matrix</a></li><li><a href="https://www.techiedelight.com/find-maximum-value-choices-indexes/">Find the maximum value of M[c][d] — M[a][b] over all choices of indexes</a></li><li><a href="https://www.techiedelight.com/find-shortest-distance-every-cell-landmine-maze/">Find shortest distance of every cell from landmine in a Maze</a></li><li><a href="https://www.techiedelight.com/find-shortest-route-device-construct-given-string/">Find shortest route in a device to construct the given string</a></li><li><a href="https://www.techiedelight.com/calculate-minimum-cost-to-reach-destination-city-from-source-city/">Calculate minimum cost to reach destination city from source city</a></li><li><a href="https://www.techiedelight.com/count-all-paths-matrix-from-first-cell-to-last-cell/">Count all paths in a matrix from first cell to last cell</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/">Merge M sorted lists each containing N elements</a></li><li><a href="https://www.techiedelight.com/travelling-salesman-problem-using-branch-and-bound/">Travelling Salesman Problem using Branch and Bound</a></li></ol><h3>Puzzles</h3><ol><li><a href="https://www.techiedelight.com/angle-between-hour-minute-hand/">Clock Angle Problem — Find angle between hour and minute hand</a></li><li><a href="https://www.techiedelight.com/add-two-numbers-without-using-addition-operator/">Add two numbers without using addition operator</a></li><li><a href="https://www.techiedelight.com/generate-power-set-given-set/">Generate power set of a given set</a></li><li><a href="https://www.techiedelight.com/implement-power-function-without-using-multiplication-division-operators/">Implement power function without using multiplication and division operators</a></li><li><a href="https://www.techiedelight.com/print-numbers-1-n-without-using-semicolon/">Print all numbers between 1 to N without using semicolon</a></li><li><a href="https://www.techiedelight.com/swap-two-numbers-without-using-third-variable/">Swap two numbers without using third variable</a></li><li><a href="https://www.techiedelight.com/determine-condition-to-print-specific-output/">Determine the if condition to print specific output</a></li><li><a href="https://www.techiedelight.com/maximum-minimum-three-numbers-without-using-conditional-statement-ternary-operator/">Find maximum &amp; minimum of triplet without using conditional statement and ternary operator</a></li><li><a href="https://www.techiedelight.com/numbers-represented-as-sum-of-two-cubes/">Find numbers represented as sum of two cubes for two different pairs</a></li><li><a href="https://www.techiedelight.com/print-hello-world-empty-main-function/">Print “Hello World” with empty main() function</a></li><li><a href="https://www.techiedelight.com/tower-of-hanoi-problem/">Tower of Hanoi Problem</a></li><li><a href="https://www.techiedelight.com/print-numbers-1-n-without-using-loop-4-methods/">Print all numbers between 1 to N without using any loop</a></li><li><a href="https://www.techiedelight.com/print-a-semicolon-without-using-semicolon-anywhere-program/">Print a semicolon without using semicolon anywhere in the program</a></li><li><a href="https://www.techiedelight.com/multiply-two-numbers-without-using-multiplication-operator-loops/">Multiply two numbers without using multiplication operator or loops</a></li><li><a href="https://www.techiedelight.com/find-square-number-without-using-multiplication-division-operator/">Find square of a number without using multiplication and division operator</a></li><li><a href="https://www.techiedelight.com/find-number-even-odd-without-using-conditional-statement/">Find if a number is even or odd without using any conditional statement</a></li><li><a href="https://www.techiedelight.com/set-elements-binary-array-0-single-line/">Set both elements of a binary array to 0 in single line</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-without-using-conditional-statement-ternary-operator/">Find minimum number without using conditional statement or ternary operator</a></li><li><a href="https://www.techiedelight.com/perform-division-two-numbers-without-using-division-operator/">Perform Division of two numbers without using division operator (/)</a></li><li><a href="https://www.techiedelight.com/generate-0-1-75-25-probability/">Generate 0 and 1 with 75% and 25% Probability</a></li><li><a href="https://www.techiedelight.com/generate-random-numbers-equal-probability/">Generate Desired Random Numbers With Equal Probability</a></li><li><a href="https://www.techiedelight.com/return-0-1-2-equal-probability-using-specified-function/">Return 0, 1 and 2 with equal Probability using the specified function</a></li><li><a href="https://www.techiedelight.com/generate-fair-results-biased-coin/">Generate Fair Results from a Biased Coin</a></li><li><a href="https://www.techiedelight.com/generate-numbers-1-7-equal-probability/">Generate numbers from 1 to 7 with equal probability using specified function</a></li><li><a href="https://www.techiedelight.com/implement-ternary-operator-without-using-conditional-statements/">Implement Ternary Operator Without Using Conditional Expressions</a></li><li><a href="https://www.techiedelight.com/determine-two-integers-equal-without-using-comparison-arithmetic-operators/">Determine if two integers are equal without using comparison and arithmetic operators</a></li><li><a href="https://www.techiedelight.com/get-0-1-equal-probability-using-specified-function/">Return 0 and 1 with equal Probability using the specified function</a></li><li><a href="https://www.techiedelight.com/generate-random-input-array-according-given-probabilities/">Generate random input from an array according to given probabilities</a></li><li><a href="https://www.techiedelight.com/compute-modulus-division-without-division-modulo-operator/">Compute modulus division without division and modulo operator</a></li></ol><h3>Queue</h3><ol><li>Queue Implementation using Array/List — <a href="https://www.techiedelight.com/circular-queue-implementation-c/">C</a>, <a href="https://www.techiedelight.com/queue-implementation-cpp/">C++</a>, <a href="https://www.techiedelight.com/queue-implementation-in-java/">Java</a>, <a href="https://www.techiedelight.com/queue-implementation-python/">Python</a></li><li><a href="https://www.techiedelight.com/queue-implementation-using-linked-list/">Queue Implementation using Linked List</a></li><li><a href="https://www.techiedelight.com/implement-stack-using-queue-data-structure/">Implement Stack using Queue Data Structure</a></li><li><a href="https://www.techiedelight.com/implement-a-queue-using-stack-data-structure/">Implement a Queue using Stack Data Structure</a></li><li><a href="https://www.techiedelight.com/print-nodes-between-two-levels-binary-tree/">Efficiently print all nodes between two given levels in a binary tree</a></li><li><a href="https://www.techiedelight.com/chess-knight-problem-find-shortest-path-source-destination/">Chess Knight Problem — Find Shortest path from source to destination</a></li><li><a href="https://www.techiedelight.com/lee-algorithm-shortest-path-in-a-maze/">Shortest path in a Maze | Lee Algorithm</a></li><li><a href="https://www.techiedelight.com/find-shortest-safe-route-field-sensors-present/">Find shortest safe route in a field with sensors present</a></li><li><a href="https://www.techiedelight.com/flood-fill-algorithm/">Flood Fill Algorithm</a></li><li><a href="https://www.techiedelight.com/count-the-number-of-islands/">Count the number of islands</a></li><li><a href="https://www.techiedelight.com/find-shortest-path-source-destination-matrix-satisfies-given-constraints/">Find Shortest path from source to destination in a matrix that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/generate-binary-numbers-1-n/">Generate binary numbers between 1 to N</a></li><li><a href="https://www.techiedelight.com/calculate-height-binary-tree-iterative-recursive/">Calculate height of a binary tree</a></li><li><a href="https://www.techiedelight.com/delete-given-binary-tree-iterative-recursive/">Delete given Binary Tree</a></li><li><a href="https://www.techiedelight.com/level-order-traversal-binary-tree/">Level Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/spiral-order-traversal-binary-tree/">Spiral Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/reverse-level-order-traversal-binary-tree/">Reverse Level Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-nodes-binary-tree-specific-order/">Print all nodes of a given binary tree in specific order</a></li><li><a href="https://www.techiedelight.com/print-left-view-of-binary-tree/">Print left view of binary tree</a></li><li><a href="https://www.techiedelight.com/find-next-node-in-same-level-binary-tree/">Find next node in same level for given node in a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-complete-binary-tree-not/">Check if given binary tree is complete binary tree or not</a></li><li><a href="https://www.techiedelight.com/print-diagonal-traversal-binary-tree/">Print Diagonal Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-corner-nodes-every-level-binary-tree/">Print corner nodes of every level in binary tree</a></li><li><a href="https://www.techiedelight.com/invert-binary-tree-recursive-iterative/">Invert a Binary Tree</a></li><li><a href="https://www.techiedelight.com/find-minimum-passes-required-convert-negative-values-matrix/">Find minimum passes required to convert all negative values in the matrix</a></li><li><a href="https://www.techiedelight.com/convert-binary-tree-into-doubly-linked-list/">Convert a Binary Tree into a Doubly Linked List in Spiral Order</a></li><li><a href="https://www.techiedelight.com/check-binary-tree-is-min-heap/">Check if a binary tree is a min-heap or not</a></li><li><a href="https://www.techiedelight.com/invert-alternate-levels-perfect-binary-tree/">Invert alternate levels of a perfect binary tree</a></li><li><a href="https://www.techiedelight.com/convert-binary-search-tree-into-min-heap/">Convert a Binary Search Tree into a Min Heap</a></li><li><a href="https://www.techiedelight.com/min-throws-required-to-win-snake-and-ladder-game/">Snake and Ladder Problem</a></li><li><a href="https://www.techiedelight.com/find-shortest-distance-every-cell-landmine-maze/">Find shortest distance of every cell from landmine in a Maze</a></li><li><a href="https://www.techiedelight.com/convert-multilevel-linked-list-singly/">Convert a multilevel linked list to a singly linked list</a></li><li><a href="https://www.techiedelight.com/breadth-first-search/">Breadth First Search (BFS) Algorithm</a></li><li><a href="https://www.techiedelight.com/check-undirected-graph-contains-cycle-not/">Check if an undirected graph contains cycle or not</a></li><li><a href="https://www.techiedelight.com/maximum-cost-path-graph-source-destination/">Find maximum cost path in graph from given source to destination</a></li><li><a href="https://www.techiedelight.com/total-paths-in-digraph-from-source-to-destination-m-edges/">Total paths in given digraph from given source to destination having exactly m edges</a></li><li><a href="https://www.techiedelight.com/least-cost-path-digraph-source-destination-m-edges/">Least cost path in given digraph from given source to destination having exactly m edges</a></li></ol><h3>Sorting</h3><ol><li><a href="https://www.techiedelight.com/insertion-sort-iterative-recursive/">Insertion Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/selection-sort-iterative-recursive/">Selection Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/bubble-sort-iterative-recursive/">Bubble Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/merge-sort/">Merge Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/iterative-merge-sort-algorithm-bottom-up/">Iterative Merge Sort Algorithm (Bottom-up Merge Sort)</a></li><li><a href="https://www.techiedelight.com/quicksort/">QuickSort Algorithm</a></li><li><a href="https://www.techiedelight.com/iterative-implementation-of-quicksort/">Iterative Implementation of QuickSort</a></li><li><a href="https://www.techiedelight.com/hybrid-quicksort/">Hybrid QuickSort</a></li><li><a href="https://www.techiedelight.com/quicksort-using-dutch-national-flag-algorithm/">QuickSort using Dutch National Flag Algorithm</a></li><li><a href="https://www.techiedelight.com/quick-sort-using-hoares-partitioning-scheme/">QuickSort using Hoare’s Partitioning scheme</a></li><li><a href="https://www.techiedelight.com/heap-sort-place-place-implementation-c-c/">Heap Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/introsort-algorithm/">Introsort Algorithm</a></li><li><a href="https://www.techiedelight.com/external-merge-sort/">External Merge Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/counting-sort-algorithm-implementation/">Counting Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/inversion-count-array/">Inversion Count of an array</a></li><li><a href="https://www.techiedelight.com/sort-array-using-young-tableau/">Sort an array using Young tableau</a></li><li><a href="https://www.techiedelight.com/merge-sort-singly-linked-list/">Merge Sort Algorithm for Singly Linked List</a></li><li><a href="https://www.techiedelight.com/problems-solved-using-partitioning-logic-quicksort/">Problems solved using partitioning logic of QuickSort</a></li><li><a href="https://www.techiedelight.com/sort-doubly-linked-list-merge-sort/">Sort a Doubly Linked List using Merge Sort</a></li><li><a href="https://www.techiedelight.com/sort-elements-by-their-frequency-and-index/">Sort elements by their frequency and Index</a></li><li><a href="https://www.techiedelight.com/custom-sort-sort-elements-array-order-elements-defined-second-array/">Sort an array based on order defined by another array</a></li><li><a href="https://www.techiedelight.com/efficiently-sort-array-duplicated-values/">Efficiently sort an array with many duplicated values</a></li><li><a href="https://www.techiedelight.com/find-largest-number-possible-set-given-numbers/">Find largest number possible from set of given numbers</a></li><li><a href="https://www.techiedelight.com/surpasser-count-each-element-array/">Find the surpasser count for each element of an array</a></li><li><a href="https://www.techiedelight.com/segregate-positive-negative-integers-using-mergesort/">Segregate positive and negative integers using Merge Sort</a></li><li><a href="https://www.techiedelight.com/group-anagrams-together-given-list-words/">Group anagrams together from given list of words</a></li></ol><h3>Stack</h3><ol><li>Stack Implementation using Array/List — <a href="https://www.techiedelight.com/stack-implementation/">C</a>, <a href="https://www.techiedelight.com/stack-implementation-in-cpp/">C++</a>, <a href="https://www.techiedelight.com/stack-implementation-in-java/">Java</a>, <a href="https://www.techiedelight.com/stack-implementation-python/">Python</a></li><li><a href="https://www.techiedelight.com/stack-implementation-using-linked-list/">Stack Implementation using Linked List</a></li><li><a href="https://www.techiedelight.com/check-given-expression-balanced-expression-not/">Check if given expression is balanced expression or not</a></li><li><a href="https://www.techiedelight.com/find-duplicate-parenthesis-expression/">Find duplicate parenthesis in an expression</a></li><li><a href="https://www.techiedelight.com/evaluate-given-postfix-expression/">Evaluate given postfix expression</a></li><li><a href="https://www.techiedelight.com/decode-the-given-sequence-construct-minimum-number-without-repeated-digits/">Decode the given sequence to construct minimum number without repeated digits</a></li><li><a href="https://www.techiedelight.com/design-stack-which-returns-minimum-element-constant-time/">Design a stack which returns minimum element in constant time</a></li><li><a href="https://www.techiedelight.com/design-a-stack-which-returns-minimum-element-without-using-auxiliary-stack/">Design a stack which returns minimum element without using auxiliary stack</a></li><li><a href="https://www.techiedelight.com/merging-overlapping-intervals/">Merging Overlapping Intervals</a></li><li><a href="https://www.techiedelight.com/reverse-string-without-using-recursion/">Reverse String without using Recursion</a></li><li><a href="https://www.techiedelight.com/implement-stack-using-queue-data-structure/">Implement Stack using Queue Data Structure</a></li><li><a href="https://www.techiedelight.com/implement-a-queue-using-stack-data-structure/">Implement a Queue using Stack Data Structure</a></li><li><a href="https://www.techiedelight.com/implement-two-stacks-single-array/">Implement two stacks in a single array</a></li><li><a href="https://www.techiedelight.com/recursive-solution-sort-stack/">Recursive solution to sort a stack</a></li><li><a href="https://www.techiedelight.com/find-length-longest-balanced-parenthesis-string/">Find length of the longest balanced parenthesis in a string</a></li><li><a href="https://www.techiedelight.com/reverse-a-string-using-stack-data-structure/">Reverse a string using stack data structure</a></li><li><a href="https://www.techiedelight.com/find-elements-array-greater-than-elements-right/">Find all elements in an array that are greater than all elements present to their right</a></li><li><a href="https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/">Inorder Tree Traversal</a></li><li><a href="https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/">Preorder Tree Traversal</a></li><li><a href="https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/">Postorder Tree Traversal</a></li><li><a href="https://www.techiedelight.com/find-preorder-traversal-binary-tree-from-inorder-postorder/">Find preorder traversal of a binary tree from its inorder and postorder sequence</a></li><li><a href="https://www.techiedelight.com/find-ancestors-of-given-node-binary-tree/">Find ancestors of given node in a Binary Tree</a></li><li><a href="https://www.techiedelight.com/check-if-two-binary-trees-are-identical-not-iterative-recursive/">Check if two given binary trees are identical or not</a></li><li><a href="https://www.techiedelight.com/reverse-level-order-traversal-binary-tree/">Reverse Level Order Traversal of Binary Tree</a></li><li><a href="https://www.techiedelight.com/reverse-text-without-reversing-individual-words/">Reverse given text without reversing the individual words</a></li><li><a href="https://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/">Find all binary strings that can be formed from given wildcard pattern</a></li><li><a href="https://www.techiedelight.com/iterative-implementation-of-quicksort/">Iterative Implementation of QuickSort</a></li><li><a href="https://www.techiedelight.com/depth-first-search/">Depth First Search (DFS) Algorithm</a></li><li><a href="https://www.techiedelight.com/invert-binary-tree-recursive-iterative/">Invert a Binary Tree</a></li><li><a href="https://www.techiedelight.com/print-leaf-to-root-path-binary-tree/">Print leaf to root path for every leaf node in a binary tree</a></li><li><a href="https://www.techiedelight.com/longest-increasing-subsequence/">Longest Increasing Subsequence</a></li><li><a href="https://www.techiedelight.com/invert-alternate-levels-perfect-binary-tree/">Invert alternate levels of a perfect binary tree</a></li></ol><h3>String</h3><ol><li><a href="https://www.techiedelight.com/check-given-string-rotated-palindrome-not/">Check if given string is a rotated palindrome or not</a></li><li><a href="https://www.techiedelight.com/longest-palindromic-substring-non-dp-space-optimized-solution/">Longest Palindromic Substring (Non-DP Space Optimized Solution)</a></li><li><a href="https://www.techiedelight.com/check-repeated-subsequence-present-string-not/">Check if repeated subsequence is present in the string or not</a></li><li><a href="https://www.techiedelight.com/check-strings-can-derived-circularly-rotating/">Check if strings can be derived from each other by circularly rotating them</a></li><li><a href="https://www.techiedelight.com/check-given-set-moves-circular-not/">Check if given set of moves is circular or not</a></li><li><a href="https://www.techiedelight.com/convert-given-number-corresponding-excel-column-name/">Convert given number into corresponding excel column name</a></li><li><a href="https://www.techiedelight.com/determine-if-two-strings-are-anagram-or-not/">Determine if two strings are anagram or not</a></li><li><a href="https://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/">Find all binary strings that can be formed from given wildcard pattern</a></li><li><a href="https://www.techiedelight.com/find-interleavings-of-given-strings/">Find all interleaving of given strings</a></li><li><a href="https://www.techiedelight.com/isomorphic-strings/">Isomorphic Strings</a></li><li><a href="https://www.techiedelight.com/find-possible-palindromic-substrings-string/">Find all possible palindromic substrings in a string</a></li><li><a href="https://www.techiedelight.com/find-possible-combinations-words-formed-from-mobile-keypad/">Find all possible combinations of words formed from mobile keypad</a></li><li><a href="https://www.techiedelight.com/possible-combinations-replacing-given-digits-corresponding-list/">Find all possible combinations by replacing given digits with characters of the corresponding list</a></li><li><a href="https://www.techiedelight.com/find-words-that-follows-given-pattern/">Find all words from given list that follows same order of characters as given pattern</a></li><li><a href="https://www.techiedelight.com/group-anagrams-together-given-list-words/">Group anagrams together from given list of words</a></li><li><a href="https://www.techiedelight.com/find-minimum-operations-required-transform-string-into-another/">Find minimum operations required to transform a string into another string</a></li><li><a href="https://www.techiedelight.com/determine-string-transformed-into-another-string-single-edit/">Determine if a string can be transformed into another string with a single edit</a></li><li><a href="https://www.techiedelight.com/find-length-longest-balanced-parenthesis-string/">Find length of the longest balanced parenthesis in a string</a></li><li><a href="https://www.techiedelight.com/inplace-remove-all-occurrences-ab-c-string/">In place remove all occurrences of ‘AB’ and ‘C’ from the string</a></li><li><a href="https://www.techiedelight.com/longest-even-length-palidromic-sum-substring/">Longest even length palindromic sum substring</a></li><li><a href="https://www.techiedelight.com/print-string-in-zig-zag-form-k-rows/">Print string in zig-zag form in k rows</a></li><li><a href="https://www.techiedelight.com/reverse-text-without-reversing-individual-words/">Reverse given text without reversing the individual words</a></li><li><a href="https://www.techiedelight.com/run-length-encoding-rle-data-compression-algorithm/">Run Length Encoding (RLE) Data Compression Algorithm</a></li><li><a href="https://www.techiedelight.com/find-longest-substring-containing-k-distinct-characters/">Find the longest substring of given string containing k distinct characters</a></li><li><a href="https://www.techiedelight.com/find-palindromic-permutations-string/">Find all palindromic permutations of a string</a></li><li><a href="https://www.techiedelight.com/find-substrings-string-permutation-given-string/">Find all substrings of a string that are permutation of a given string</a></li><li><a href="https://www.techiedelight.com/find-longest-substring-given-string-containing-distinct-characters/">Find the longest substring of given string containing all distinct characters</a></li><li><a href="https://www.techiedelight.com/find-permutations-string-cpp-java-iterative/">Iterative Approach to find Permutations of a String</a></li><li><a href="https://www.techiedelight.com/generate-permutations-string-java-recursive-iterative/">Generate all Permutations of a String in Java</a></li><li><a href="https://www.techiedelight.com/find-lexicographically-next-permutations-string-sorted-ascending-order/">Find all lexicographically next permutations of a string sorted in ascending order</a></li><li><a href="https://www.techiedelight.com/find-lexicographically-minimal-string-rotation/">Find Lexicographically minimal string rotation</a></li><li><a href="https://www.techiedelight.com/find-strings-given-length-containing-balanced-parentheses/">Find all strings of given length containing balanced parentheses</a></li><li><a href="https://www.techiedelight.com/find-combinations-non-overlapping-substrings-string/">Find all combinations of non-overlapping substrings of a string</a></li><li><a href="https://www.techiedelight.com/determine-given-string-is-palindrome-not/">Determine if a given string is palindrome or not</a></li><li><a href="https://www.techiedelight.com/minimum-number-inversions-expression-balanced/">Find the minimum number of inversions needed to make the given expression balanced</a></li><li><a href="https://www.techiedelight.com/construct-longest-palindrome-string/">Construct the longest palindrome by shuffling or deleting characters from a string</a></li><li><a href="https://www.techiedelight.com/combinations-phrases-formed-picking-words-lists/">Print all combinations of phrases formed by picking words from each of the given lists</a></li><li><a href="https://www.techiedelight.com/break-string-non-overlapping-substrings/">Break a string into all possible combinations of non-overlapping substrings</a></li><li><a href="https://www.techiedelight.com/remove-extra-spaces-string/">Remove all extra spaces from a string</a></li><li><a href="https://www.techiedelight.com/remove-adjacent-duplicates-characters-string/">Remove adjacent duplicate characters from a string</a></li><li><a href="https://www.techiedelight.com/find-first-non-repeating-character-string-one-traversal/">Find first non-repeating character in a string by doing only one traversal of it</a></li><li><a href="https://www.techiedelight.com/find-n-digit-strictly-increasing-numbers-bottom-top-approach/">Find all N-digit strictly increasing numbers (Bottom-Up and Top-Down Approach)</a></li><li><a href="https://www.techiedelight.com/find-n-digit-binary-numbers-having-more-one-than-zero/">Find all N-digit binary numbers having more 1’s than 0’s for any prefix</a></li><li><a href="https://www.techiedelight.com/find-all-n-digit-numbers-given-sum-digits/">Find all N-digit numbers with given sum of digits</a></li><li><a href="https://www.techiedelight.com/find-n-digit-binary-numbers-k-bits-set-k-ranges-1-n/">Find all N-digit binary numbers with k-bits set where k ranges from 1 to N</a></li><li><a href="https://www.techiedelight.com/find-n-digit-binary-numbers-equal-sum-bits-two-halves/">Find all N-digit binary numbers with equal sum of bits in its two halves</a></li><li><a href="https://www.techiedelight.com/find-n-digit-numbers-with-equal-sum-even-odd-digits/">Find all N-digit numbers with equal sum of digits at even and odd index</a></li><li><a href="https://www.techiedelight.com/find-lexicographic-permutations-string/">Find all Lexicographic Permutations of a String</a></li><li><a href="https://www.techiedelight.com/calculate-rank-lexicographically-sorted-permutations/">Lexicographic Rank of a String</a></li><li><a href="https://www.techiedelight.com/find-all-lexicographically-previous-permutations-string/">Find all lexicographically previous permutations of a string sorted in descending order</a></li><li><a href="https://www.techiedelight.com/replace-non-overlapping-occurrences-pattern/">Replace all non-overlapping occurrences of the pattern</a></li><li><a href="https://www.techiedelight.com/introduction-pattern-matching/">Introduction to Pattern Matching</a></li><li><a href="https://www.techiedelight.com/implementation-kmp-algorithm-c-cpp-java/">Implementation of KMP Algorithm</a></li><li><a href="https://www.techiedelight.com/reverse-string-without-using-recursion/">Reverse String without using Recursion</a></li><li><a href="https://www.techiedelight.com/reverse-a-string-using-recursion/">Reverse given string using Recursion</a></li><li><a href="https://www.techiedelight.com/determine-string-follows-specified-order/">Determine if characters of a String follow a specified order or not</a></li><li><a href="https://www.techiedelight.com/in-place-remove-all-adjacent-duplicates-from-string/">In-place remove all adjacent duplicates from the given string</a></li><li><a href="https://www.techiedelight.com/check-given-sentence-syntactically-correct-not/">Check if given sentence is syntactically correct or not</a></li><li><a href="https://www.techiedelight.com/find-permutations-given-string/">Find all Permutations of a given string</a></li><li><a href="https://www.techiedelight.com/first-k-non-repeating-characters-string/">Find first k non-repeating characters in a string in single traversal</a></li><li><a href="https://www.techiedelight.com/check-string-interleaving-two-given-strings/">Check if given string is interleaving of two other given strings</a></li><li><a href="https://www.techiedelight.com/decode-the-given-sequence-construct-minimum-number-without-repeated-digits/">Decode the given sequence to construct minimum number without repeated digits</a></li><li><a href="https://www.techiedelight.com/combinations-of-words-formed-replacing-given-numbers-corresponding-english-alphabet/">Combinations of words formed by replacing given numbers with corresponding alphabets</a></li><li><a href="https://www.techiedelight.com/count-number-times-pattern-appears-given-string-subsequence/">Count number of times a pattern appears in given string as a subsequence</a></li><li><a href="https://www.techiedelight.com/check-string-matches-with-wildcard-pattern/">Check if a string matches with a given wildcard pattern</a></li><li><a href="https://www.techiedelight.com/find-all-words-matching-pattern-dictionary/">Find all words matching a pattern in the given dictionary</a></li><li><a href="https://www.techiedelight.com/levenshtein-distance-edit-distance-problem/">The Levenshtein Distance (Edit Distance) Problem</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence/">Longest Common Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-repeated-subsequence-problem/">Longest Repeated Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-palindromic-subsequence-using-dynamic-programming/">Longest Palindromic Subsequence using Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/longest-common-substring-problem/">Longest Common Substring Problem</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-introduction-scs-length/">Shortest Common Supersequence Problem</a></li><li><a href="https://www.techiedelight.com/word-break-problem/">Word Break Problem</a></li><li><a href="https://www.techiedelight.com/wildcard-pattern-matching/">Wildcard Pattern Matching</a></li><li><a href="https://www.techiedelight.com/find-minimum-cuts-needed-palindromic-partition-string/">Find minimum cuts needed for palindromic partition of a string</a></li><li><a href="https://www.techiedelight.com/check-given-string-k-palindrome-not/">Check if a string is K-Palindrome or not</a></li><li><a href="https://www.techiedelight.com/find-shortest-route-device-construct-given-string/">Find shortest route in a device to construct the given string</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-possible-k-swaps/">Find minimum number possible by doing at-most K swaps</a></li><li><a href="https://www.techiedelight.com/determine-pattern-matches-string-not/">Determine if a pattern matches with a string or not</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-deletions-convert-string-into-palindrome/">Find minimum number of deletions required to convert a string into palindrome</a></li></ol><h3>Trie</h3><ol><li>Trie Implementation — <a href="https://www.techiedelight.com/trie-implementation-insert-search-delete/">C</a>, <a href="https://www.techiedelight.com/cpp-implementation-trie-data-structure/">C++</a>, <a href="https://www.techiedelight.com/implement-trie-data-structure-java/">Java</a>, <a href="https://www.techiedelight.com/trie-implementation-python/">Python</a></li><li><a href="https://www.techiedelight.com/memory-efficient-trie-implementation-using-map-insert-search-delete/">Memory Efficient Implementation of Trie | Insert, Search and Delete</a></li><li><a href="https://www.techiedelight.com/longest-common-prefix-given-set-strings-using-trie/">Longest Common Prefix in given set of strings (using Trie)</a></li><li><a href="https://www.techiedelight.com/lexicographic-sorting-given-set-of-keys/">Lexicographic sorting of given set of keys</a></li><li><a href="https://www.techiedelight.com/find-maximum-occurring-word-given-set-strings/">Find maximum occurring word in given set of strings</a></li><li><a href="https://www.techiedelight.com/find-first-k-maximum-occurring-words-given-set-strings/">Find first k maximum occurring words in given set of strings</a></li><li><a href="https://www.techiedelight.com/find-duplicate-rows-binary-matrix/">Find Duplicate rows in a binary matrix</a></li><li><a href="https://www.techiedelight.com/word-break-problem-using-trie/">Word Break Problem | Using Trie</a></li><li><a href="https://www.techiedelight.com/generate-list-of-possible-words-from-a-character-matrix/">Generate list of possible words from a character matrix</a></li><li><a href="https://www.techiedelight.com/find-all-words-matching-pattern-dictionary/">Find all words matching a pattern in the given dictionary</a></li></ol><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c1bab47a42a0" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techie-delight/500-data-structures-and-algorithms-practice-problems-c1bab47a42a0">500+ Data Structures and Algorithms Practice Problems</a> was originally published in <a href="https://medium.com/techie-delight">Techie Delight</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Data Structure: Sliding Window Technique]]></title>
            <link>https://medium.com/techie-delight/data-structure-sliding-window-technique-problems-7c7f1f32597?source=rss----d2ee351b3e1d---4</link>
            <guid isPermaLink="false">https://medium.com/p/7c7f1f32597</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[interview-questions]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Vivek Srivastava]]></dc:creator>
            <pubDate>Mon, 13 Jul 2020 18:29:15 GMT</pubDate>
            <atom:updated>2021-03-06T19:02:11.624Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/332/1*202N86YExc2Y3JupOZZptQ.png" /></figure><p>In the <strong>sliding window technique</strong>, we maintain a window that satisfies the problem constraints. The window is unstable if it violates the problem constraints, and it tries to stabilize by increasing or decreasing its size.</p><p>Following are some of the commonly asked interview questions that use the sliding window technique:</p><h4>1. <a href="https://www.techiedelight.com/find-longest-substring-containing-k-distinct-characters/">Find the longest substring of a string containing `k` distinct characters</a></h4><p><em>Given a string and a positive number `k`, find the longest substring of the string containing `k` distinct characters. If `k` is more than the total number of distinct characters in the string, return the whole string.</em></p><h4>2. <a href="https://www.techiedelight.com/find-substrings-string-permutation-given-string/">Find all substrings of a string that are a permutation of another string</a></h4><p><em>Find all substrings of a string that contains all characters of another string. In other words, find all substrings of the first string that are anagrams of the second string.</em></p><h4>3. <a href="https://www.techiedelight.com/find-longest-substring-given-string-containing-distinct-characters/">Find the longest substring of a string containing distinct characters</a></h4><p><em>Given a string, find the longest substring containing distinct characters.</em></p><h4>4. <a href="https://www.techiedelight.com/find-maximum-length-sequence-continuous-ones-sliding-window/">Find maximum length sequence of continuous ones (Using Sliding Window)</a></h4><p><em>Given a binary array, find the index of 0 to be replaced with 1 to get a maximum length sequence of continuous ones.</em></p><h4>5. <a href="https://www.techiedelight.com/find-maximum-sequence-of-continuous-1s-can-formed-replacing-k-zeroes-ones/">Find the maximum sequence of continuous 1’s formed by replacing at-most `k` zeroes by ones</a></h4><p><em>Given a binary array, find the maximum sequence of continuous 1’s that can be formed by replacing at most `k` zeroes by ones.</em></p><h4>6. <a href="https://www.techiedelight.com/find-minimum-sum-subarray-given-size-k/">Find minimum sum subarray of size `k`</a></h4><p><em>Given an integer array, find the minimum sum subarray of size `k`, where `k` is a positive integer.</em></p><h4>7. <a href="https://www.techiedelight.com/find-subarray-having-given-sum-given-array/">Find a subarray having the given sum in an integer array</a></h4><p><em>Given an integer array, find a subarray having a given sum in it.</em></p><h4>8. <a href="https://www.techiedelight.com/length-of-smallest-subarray-with-sum-greater-number/">Find the smallest subarray length whose sum of elements is greater than `k`</a></h4><p><em>Given an array of positive integers, find the smallest subarray’s length whose sum of elements is greater than a given number `k`.</em></p><h4>9. <a href="https://www.techiedelight.com/count-distinct-elements-every-sub-array-size-k-array/">Find the count of distinct elements in every subarray of size `k`</a></h4><p><em>Given an array and an integer `k`, find the count of distinct elements in every subarray of size `k`.</em></p><h4>10. <a href="https://www.techiedelight.com/print-sub-arrays-array-distinct-elements/">Print all subarrays of an array having distinct elements</a></h4><p><em>Given an integer array, print all maximum size subarrays having all distinct elements in them.</em></p><h4>11. <a href="https://www.techiedelight.com/count-distinct-absolute-values-sorted-array/">Count distinct absolute values in a sorted array</a></h4><p><em>Given an array of sorted integers that may contain several duplicate elements, count the total number of distinct absolute values in it.</em></p><h4>12. <a href="https://www.techiedelight.com/find-duplicates-within-given-range-array/">Find duplicates within a range `k` in an array</a></h4><p><em>Given an array and a positive number `k`, check whether the array contains any duplicate elements within the range `k`. If `k` is more than the array’s size, the solution should check for duplicates in the complete array.</em></p><p><strong>Thanks for reading.</strong></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7c7f1f32597" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techie-delight/data-structure-sliding-window-technique-problems-7c7f1f32597">Data Structure: Sliding Window Technique</a> was originally published in <a href="https://medium.com/techie-delight">Techie Delight</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Maze Problems in Data Structure]]></title>
            <link>https://medium.com/techie-delight/maze-problems-in-data-structures-8530af4d6c8?source=rss----d2ee351b3e1d---4</link>
            <guid isPermaLink="false">https://medium.com/p/8530af4d6c8</guid>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[interview]]></category>
            <dc:creator><![CDATA[Vivek Srivastava]]></dc:creator>
            <pubDate>Mon, 13 Jul 2020 18:29:06 GMT</pubDate>
            <atom:updated>2021-03-06T19:01:48.845Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*KCPu-wj9UCrm5pmi.jpg" /></figure><p>A maze is a path or collection of paths, typically from a source to a destination. This article lists out some of the commonly asked maze problems in technical interviews.</p><h4><a href="https://www.techiedelight.com/find-total-number-unique-paths-maze-source-destination/">Find the total number of unique paths in a maze from source to destination</a></h4><p><em>Find the total number of unique paths that the robot can take in a given maze to reach a given destination from a given source.</em></p><h4>Find the shortest path in a maze — <a href="https://www.techiedelight.com/find-shortest-path-in-maze/">Using Backtracking</a>, <a href="https://www.techiedelight.com/lee-algorithm-shortest-path-in-a-maze/">Lee Algorithm</a></h4><p><em>Given a maze in the form of a binary rectangular matrix, find the shortest path’s length in the maze from a given source to a given destination. The path can only be constructed out of cells having value 1, and at any moment, we can only move one step in one of the four directions.</em></p><h4><a href="https://www.techiedelight.com/find-shortest-safe-route-field-sensors-present/">Find the shortest safe route in a field with sensors present</a></h4><p><em>Given a rectangular field with few sensors present, cross it by taking the shortest safe route without activating the sensors.</em></p><h4><a href="https://www.techiedelight.com/find-path-source-destination-matrix-satisfies-given-constraints/">Find the path from source to destination in a matrix that satisfies given constraints</a></h4><p><em>Given an `N × N` matrix of positive integers, find a path from the first cell of the matrix to its last cell.</em></p><h4><a href="https://www.techiedelight.com/find-shortest-path-source-destination-matrix-satisfies-given-constraints/">Find the shortest path from source to destination in a matrix that satisfies given constraints</a></h4><p><em>Given an `N × N` matrix of positive integers, find the shortest path from the first cell of the matrix to its last cell that satisfies given constraints.</em></p><h4><a href="https://www.techiedelight.com/find-longest-possible-route-matrix/">Find the longest possible route in a matrix</a></h4><p><em>Given a rectangular path in the form of a binary matrix, find the length of the longest possible route from source to destination by moving to only non-zero adjacent positions, i.e., We can form the route from positions having their value as 1. Note there should not be any cycles in the output path.</em></p><h4><a href="https://www.techiedelight.com/find-shortest-distance-every-cell-landmine-maze/">Find the shortest distance of every cell from a landmine inside a maze</a></h4><p><em>Given a maze in the form of a rectangular matrix, filled with either `O`, `X`, or `M`, where `O` represents an open cell, `X` represents a blocked cell, and `M` represents landmines in the maze, find the shortest distance of every open cell in the maze from its nearest mine.</em></p><p><strong>Thanks for reading.</strong></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=8530af4d6c8" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techie-delight/maze-problems-in-data-structures-8530af4d6c8">Maze Problems in Data Structure</a> was originally published in <a href="https://medium.com/techie-delight">Techie Delight</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Backtracking Practice Problems and Interview Questions]]></title>
            <link>https://medium.com/techie-delight/backtracking-practice-problems-and-interview-questions-6a17cb6d08a7?source=rss----d2ee351b3e1d---4</link>
            <guid isPermaLink="false">https://medium.com/p/6a17cb6d08a7</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[backtracking]]></category>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Vivek Srivastava]]></dc:creator>
            <pubDate>Mon, 13 Jul 2020 18:28:58 GMT</pubDate>
            <atom:updated>2021-03-06T13:14:47.770Z</atom:updated>
            <content:encoded><![CDATA[<h3>Backtracking: Practice Problems and Interview Questions</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/785/0*vuA8uW0sqyX9who6" /></figure><p><a href="https://en.wikipedia.org/wiki/Backtracking">Backtracking</a> is a general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons each partial candidate `c` (“backtracks”) as soon as it determines that `c` cannot possibly be completed to a valid solution.</p><p>Backtracking can be applied only for problems that admit the concept of a “partial candidate solution” and a relatively quick test of whether it can be completed to a valid solution. Backtracking is often much faster than brute force enumeration of all candidates since it can eliminate a large number of candidates with a single test.</p><p>In this post, we have listed out common problems that can be solved using the backtracking technique:</p><ol><li><a href="https://www.techiedelight.com/print-possible-solutions-n-queens-problem/">Print all possible solutions to N–Queens problem</a></li><li><a href="https://www.techiedelight.com/print-possible-knights-tours-chessboard/">Print all possible Knight’s tours on a chessboard</a></li><li><a href="https://www.techiedelight.com/find-shortest-path-in-maze/">Find the shortest path in a maze</a></li><li><a href="https://www.techiedelight.com/find-longest-possible-route-matrix/">Find the longest possible route in a matrix</a></li><li><a href="https://www.techiedelight.com/find-path-source-destination-matrix-satisfies-given-constraints/">Find the path from source to destination in a matrix that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/find-total-number-unique-paths-maze-source-destination/">Find the total number of unique paths in a maze from source to destination</a></li><li><a href="https://www.techiedelight.com/find-combinations-of-elements-satisfies-given-constraints/">Find all combinations of elements satisfying given constraints</a></li><li><a href="https://www.techiedelight.com/k-partition-problem-print-all-subsets/">K–Partition Problem | Printing all partitions</a></li><li><a href="https://www.techiedelight.com/magnet-puzzle/">Magnet Puzzle</a></li><li><a href="https://www.techiedelight.com/print-k-colorable-configurations-graph-vertex-coloring-graph/">Print all k–colorable configurations of a graph (Vertex coloring of a graph)</a></li><li><a href="https://www.techiedelight.com/find-minimum-number-possible-k-swaps/">Find the minimum number possible by doing at-most `k` swaps</a></li><li>Find all permutations of a string — <a href="https://www.techiedelight.com/find-permutations-given-string/">C++</a>, <a href="https://www.techiedelight.com/generate-permutations-string-java-recursive-iterative/">Java</a>, <a href="https://www.techiedelight.com/find-all-permutations-string-python/">Python</a></li><li><a href="https://www.techiedelight.com/determine-pattern-matches-string-not/">Determine whether a string matches with a given pattern</a></li><li><a href="https://www.techiedelight.com/find-all-paths-from-source-to-destination-in-matrix/">Find all paths from the first cell to the last cell of a matrix</a></li><li><a href="https://www.techiedelight.com/print-all-shortest-routes-rectangular-grid/">Print all shortest routes in a rectangular grid</a></li><li><a href="https://www.techiedelight.com/find-distinct-combinations-given-length-repetition-allowed/">Find all distinct combinations of a given length with repetition allowed</a></li><li><a href="https://www.techiedelight.com/print-all-combination-numbers-from-1-to-n/">Print all combinations of numbers from 1 to `n` having sum `n`</a></li><li><a href="https://www.techiedelight.com/print-triplets-array-sum-less-equal-given-number/">Print all triplets in an array with a sum less than or equal to a given number</a></li><li><a href="https://www.techiedelight.com/possible-combinations-replacing-given-digits-corresponding-list/">Find all possible combinations by replacing given digits with characters of the corresponding list</a></li><li><a href="https://www.techiedelight.com/find-combinations-non-overlapping-substrings-string/">Find all combinations of non-overlapping substrings of a string</a></li><li><a href="https://www.techiedelight.com/find-n-digit-numbers-with-equal-sum-even-odd-digits/">Find all n-digit numbers with equal sum of digits at even and odd indices</a></li><li><a href="https://www.techiedelight.com/find-occurrences-given-string-character-matrix/">Find all occurrences of the given string in a character matrix</a></li><li><a href="https://www.techiedelight.com/print-distinct-subsets-given-set/">Print all distinct subsets of a given set</a></li><li><a href="https://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/">Find all binary strings that can be formed from a wildcard pattern</a></li><li><a href="https://www.techiedelight.com/find-ways-calculate-target-elements-array/">Find ways to calculate a target from elements of the specified array</a></li><li><a href="https://www.techiedelight.com/find-all-possible-topological-orderings-of-dag/">Find all Possible Topological Orderings of a DAG</a></li><li><a href="https://www.techiedelight.com/print-all-hamiltonian-path-present-in-a-graph/">Print all Hamiltonian paths present in a graph</a></li><li><a href="https://www.techiedelight.com/find-path-between-vertices-directed-graph/">Find the path between given vertices in a directed graph</a></li><li><a href="https://www.techiedelight.com/generate-list-of-possible-words-from-a-character-matrix/">Generate a list of possible words from a character matrix</a></li><li><a href="https://www.techiedelight.com/print-all-paths-from-root-to-leaf-nodes-binary-tree/">Print all paths from the root to leaf nodes of a binary tree</a></li><li><a href="https://www.techiedelight.com/print-all-paths-from-leaf-to-root-binary-tree/">Print all paths from leaf to root node of a binary tree</a></li><li><a href="https://www.techiedelight.com/generate-power-set-given-set/">Generate the power set of a given set</a></li></ol><p><strong>Thank You.</strong></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6a17cb6d08a7" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techie-delight/backtracking-practice-problems-and-interview-questions-6a17cb6d08a7">Backtracking Practice Problems and Interview Questions</a> was originally published in <a href="https://medium.com/techie-delight">Techie Delight</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Heap Practice Problems and Interview Questions]]></title>
            <link>https://medium.com/techie-delight/heap-practice-problems-and-interview-questions-b678ff3b694c?source=rss----d2ee351b3e1d---4</link>
            <guid isPermaLink="false">https://medium.com/p/b678ff3b694c</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[queue]]></category>
            <dc:creator><![CDATA[Vivek Srivastava]]></dc:creator>
            <pubDate>Mon, 13 Jul 2020 18:28:50 GMT</pubDate>
            <atom:updated>2021-03-06T13:38:59.934Z</atom:updated>
            <content:encoded><![CDATA[<h3>Heap: Practice Problems and Interview Questions</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/665/0*zcVbYPDgX_br8ayR.png" /><figcaption>Heap Data Structure</figcaption></figure><p>A <a href="https://en.wikipedia.org/wiki/Heap_(data_structure)">heap</a> is a specialized tree-based data structure that satisfies the heap property: If `A` is a parent node of `B`, then the key (the value) of a node `A` is ordered with respect to the key of node `B` with the same ordering applying across the heap. A heap can be classified further as either a “max-heap” or a “min-heap”. In a max-heap, the keys of parent nodes are always greater than or equal to those of the children and the highest key is in the root node. In a min-heap, the keys of parent nodes are less than or equal to those of the children and the lowest key is in the root node.</p><p>The heap is one maximally efficient implementation of an abstract data type called a <a href="https://www.techiedelight.com/introduction-priority-queues-using-binary-heaps/">priority queue</a>, and in fact, priority queues are often referred to as “heaps”, regardless of how they may be implemented. A common implementation of a heap is the binary heap, in which the tree is a complete binary tree.</p><p>The heap data structure, specifically the binary heap, was introduced as a data structure for the <a href="https://www.techiedelight.com/heap-sort-place-place-implementation-c-c/">heapsort</a> sorting algorithm. Heaps are also crucial in several efficient graph algorithms such as <a href="https://www.techiedelight.com/single-source-shortest-paths-dijkstras-algorithm/">Dijkstra’s algorithm</a>. In a heap, the highest (or lowest) priority element is always stored at the root. A heap is not a sorted structure and can be regarded as partially ordered. There is no particular relationship among nodes on any given level, even among the siblings. When a heap is a complete binary tree, it has the smallest possible height — a heap with `N` nodes always has `log N` height. A heap is a useful data structure when you need to remove the object with the highest (or lowest) priority.</p><p>In this post, we have listed out commonly asked interview questions that use heap data structure:</p><ol><li><a href="https://www.techiedelight.com/introduction-priority-queues-using-binary-heaps/">Introduction to Priority Queues using Binary Heaps</a></li><li>Min Heap and Max Heap Implementation — <a href="https://www.techiedelight.com/min-heap-max-heap-implementation-c/">C++</a>, <a href="https://www.techiedelight.com/min-heap-max-heap-implementation-in-java/">Java</a></li><li><a href="https://www.techiedelight.com/check-given-array-represents-min-heap-not/">Check if an array represents a min-heap or not</a></li><li><a href="https://www.techiedelight.com/convert-max-heap-min-heap-linear-time/">Convert max heap to min heap in linear time</a></li><li><a href="https://www.techiedelight.com/find-kth-largest-element-array/">Find k’th largest element in an array</a></li><li><a href="https://www.techiedelight.com/sort-k-sorted-array/">Sort a k-sorted array</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-variable-length/">Merge `M` sorted lists of variable length</a></li><li><a href="https://www.techiedelight.com/find-kth-smallest-element-array/">Find k’th smallest element in an array</a></li><li><a href="https://www.techiedelight.com/find-smallest-range-least-one-element-given-lists/">Find the smallest range with at least one element from each of the given lists</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/">Merge `M` sorted lists each containing `N` elements</a></li><li><a href="https://www.techiedelight.com/first-k-non-repeating-characters-string/">Find first `k` non-repeating characters in a string in a single traversal</a></li><li><a href="https://www.techiedelight.com/connect-n-ropes-with-minimal-cost/">Connect `n` ropes with minimal cost</a></li><li><a href="https://www.techiedelight.com/return-kth-largest-element-stream/">Return k’th largest element in a stream</a></li><li><a href="https://www.techiedelight.com/huffman-coding/">Huffman Coding Compression Algorithm</a></li><li><a href="https://www.techiedelight.com/replace-each-element-corresponding-rank-array/">Replace each array element by its corresponding rank</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-dijkstras-algorithm/">Single-Source Shortest Paths — Dijkstra’s Algorithm</a></li><li><a href="https://www.techiedelight.com/construct-cartesian-tree-from-inorder-traversal/">Construct a Cartesian tree from an inorder traversal</a></li><li><a href="https://www.techiedelight.com/treap-data-structure/">Treap Data Structure</a></li><li><a href="https://www.techiedelight.com/implementation-treap-data-structure-cpp-java-insert-search-delete/">Implementation of Treap Data Structure (Insert, Search, and Delete)</a></li><li><a href="https://www.techiedelight.com/heap-sort-place-place-implementation-c-c/">Heap Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/introsort-algorithm/">Introsort Algorithm — Overview and C++ Implementation</a></li><li><a href="https://www.techiedelight.com/external-merge-sort/">External Merge Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/efficiently-merge-k-sorted-linked-lists/">Efficiently merge `k` sorted linked lists</a></li><li><a href="https://www.techiedelight.com/check-binary-tree-is-min-heap/">Check if a binary tree is a min-heap or not</a></li><li><a href="https://www.techiedelight.com/convert-binary-search-tree-into-min-heap/">Convert a Binary Search Tree into a Min Heap</a></li><li><a href="https://www.techiedelight.com/find-first-k-maximum-occurring-words-given-set-strings/">Find first `k` maximum occurring words in a given set of strings</a></li></ol><p><strong>Thank you.</strong></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=b678ff3b694c" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techie-delight/heap-practice-problems-and-interview-questions-b678ff3b694c">Heap Practice Problems and Interview Questions</a> was originally published in <a href="https://medium.com/techie-delight">Techie Delight</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Data structures and algorithms problems in C++ using STL]]></title>
            <link>https://medium.com/techie-delight/data-structures-and-algorithms-problems-in-c-using-stl-7900a6ddb1d4?source=rss----d2ee351b3e1d---4</link>
            <guid isPermaLink="false">https://medium.com/p/7900a6ddb1d4</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[cpp]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[stl]]></category>
            <dc:creator><![CDATA[Vivek Srivastava]]></dc:creator>
            <pubDate>Mon, 13 Jul 2020 18:22:50 GMT</pubDate>
            <atom:updated>2021-03-06T13:47:49.889Z</atom:updated>
            <content:encoded><![CDATA[<h3>Data Structures and Algorithms Problems in C++ using STL</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/777/0*K08dm4SJuhsG0wTB.png" /></figure><p>The <a href="https://en.wikipedia.org/wiki/Standard_Template_Library">Standard Template Library (STL)</a> is a library for the C++ programming language. The STL provides many useful <a href="http://www.cplusplus.com/reference/algorithm/">algorithms</a> and containers. The Containers are objects that store data. We have taken the help of the following containers to solve mentioned problems:</p><p><a href="http://www.cplusplus.com/reference/vector/vector/">vector</a>, <a href="http://www.cplusplus.com/reference/list/list/">list</a>, <a href="http://www.cplusplus.com/reference/queue/queue/">queue</a>, <a href="http://www.cplusplus.com/reference/queue/priority_queue/">priority_queue</a>, <a href="http://www.cplusplus.com/reference/stack/stack/">stack</a>, <a href="http://www.cplusplus.com/reference/set/set/">set</a>, <a href="http://www.cplusplus.com/reference/map/map/">map</a>, <a href="http://www.cplusplus.com/reference/map/multimap/">multimap</a>, <a href="http://www.cplusplus.com/reference/unordered_set/unordered_set/">unordered_set</a>, <a href="http://www.cplusplus.com/reference/unordered_set/unordered_multiset/">unordered_multiset</a>, <a href="http://www.cplusplus.com/reference/unordered_map/unordered_map/">unordered_map</a>, <a href="http://www.cplusplus.com/reference/unordered_map/unordered_multimap/">unordered_multimap</a></p><p>We have avoided using STL algorithms as the main purpose of these problems is to improve your coding skills and using in-built algorithms will do no good. Nevertheless, we have still used the following common algorithms at several places:</p><p><a href="http://www.cplusplus.com/reference/algorithm/min/"><strong>min</strong></a><strong>, </strong><a href="http://www.cplusplus.com/reference/algorithm/max/"><strong>max</strong></a><strong>, </strong><a href="http://www.cplusplus.com/reference/algorithm/swap/"><strong>swap</strong></a><strong>, </strong><a href="http://www.cplusplus.com/reference/algorithm/sort/"><strong>sort</strong></a><strong>, </strong><a href="http://www.cplusplus.com/reference/algorithm/next_permutation/"><strong>next_permutation</strong></a><strong>, </strong><a href="http://www.cplusplus.com/reference/algorithm/binary_search/"><strong>binary_search</strong></a><strong>, </strong><a href="http://www.cplusplus.com/reference/algorithm/rotate/"><strong>rotate</strong></a><strong>, </strong><a href="http://www.cplusplus.com/reference/algorithm/reverse/"><strong>reverse</strong></a></p><h3>Priority Queue (Heap):</h3><ul><li><a href="https://www.techiedelight.com/min-heap-max-heap-implementation-c/">Min Heap and Max Heap Implementation in C++</a></li><li><a href="https://www.techiedelight.com/find-kth-largest-element-array/">Find k’th largest element in an array</a></li><li><a href="https://www.techiedelight.com/sort-k-sorted-array/">Sort a k-sorted array</a></li><li><a href="https://www.techiedelight.com/find-kth-smallest-element-array/">Find k’th smallest element in an array</a></li><li><a href="https://www.techiedelight.com/find-smallest-range-least-one-element-given-lists/">Find the smallest range with at least one element from each of the given lists</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/">Merge `M` sorted lists each containing `N` elements</a></li><li><a href="https://www.techiedelight.com/merge-m-sorted-lists-variable-length/">Merge `M` sorted lists of variable length</a></li><li><a href="https://www.techiedelight.com/huffman-coding/">Huffman Coding Compression Algorithm</a></li><li><a href="https://www.techiedelight.com/external-merge-sort/">External Merge Sort Algorithm</a></li></ul><h3>Graphs:</h3><ul><li><a href="https://www.techiedelight.com/graph-implementation-using-stl/">Graph Implementation in C++ using STL</a></li><li><a href="https://www.techiedelight.com/breadth-first-search/">Breadth-First Search (BFS) — Iterative and Recursive Implementation</a></li><li><a href="https://www.techiedelight.com/depth-first-search/">Depth First Search (DFS) — Iterative and Recursive Implementation</a></li><li><a href="https://www.techiedelight.com/disjoint-set-data-structure-union-find-algorithm/">Disjoint–Set Data Structure (Union–Find Algorithm)</a></li><li><a href="https://www.techiedelight.com/kruskals-algorithm-for-finding-minimum-spanning-tree/">Kruskal’s Algorithm for finding Minimum Spanning Tree</a></li><li><a href="https://www.techiedelight.com/single-source-shortest-paths-dijkstras-algorithm/">Single-Source Shortest Paths — Dijkstra’s Algorithm</a></li><li><a href="https://www.techiedelight.com/greedy-coloring-graph/">Graph Coloring Problem</a></li><li><a href="https://www.techiedelight.com/print-all-hamiltonian-path-present-in-a-graph/">Print all Hamiltonian paths present in a graph</a></li><li><a href="https://www.techiedelight.com/kahn-topological-sort-algorithm/">Kahn’s Topological Sort Algorithm</a></li><li><a href="https://www.techiedelight.com/least-cost-path-weighted-digraph-using-bfs/">Compute the least cost path in a weighted digraph using BFS</a></li></ul><h3>Array:</h3><ul><li><a href="https://www.techiedelight.com/rearrange-the-array-with-alternate-high-and-low-elements/">Rearrange an array with alternate high and low elements</a></li><li><a href="https://www.techiedelight.com/find-pair-with-given-sum-array/">Find a pair with the given sum in an array</a></li><li><a href="https://www.techiedelight.com/find-equilibrium-index-array/">Find equilibrium index of an array</a></li><li><a href="https://www.techiedelight.com/find-majority-element-in-an-array-boyer-moore-majority-vote-algorithm/">Find majority element (Boyer–Moore Majority Vote Algorithm)</a></li><li><a href="https://www.techiedelight.com/find-sub-array-with-0-sum/">Print all subarrays with 0 sum</a></li><li><a href="https://www.techiedelight.com/find-maximum-length-sub-array-having-given-sum/">Find maximum length subarray having a given sum</a></li><li><a href="https://www.techiedelight.com/find-maximum-length-sub-array-equal-number-0s-1s/">Find maximum length subarray having an equal number of 0’s and 1’s</a></li><li><a href="https://www.techiedelight.com/find-distinct-combinations-of-given-length/">Find all distinct combinations of a given length — I</a></li><li><a href="https://www.techiedelight.com/find-distinct-combinations-given-length-2/">Find all distinct combinations of a given length — II</a></li><li><a href="https://www.techiedelight.com/find-distinct-combinations-given-length-repetition-allowed/">Find all distinct combinations of a given length with repetition allowed</a></li><li><a href="https://www.techiedelight.com/merging-overlapping-intervals/">Merging Overlapping Intervals</a></li><li><a href="https://www.techiedelight.com/minimum-number-of-platforms-needed-avoid-delay-arrival-train/">Find minimum platforms needed to avoid delay in the train arrival</a></li><li><a href="https://www.techiedelight.com/longest-increasing-subsequence/">Longest Increasing Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/iterative-implementation-of-quicksort/">Iterative Implementation of Quicksort</a></li><li><a href="https://www.techiedelight.com/sort-elements-by-their-frequency-and-index/">Sort elements by their frequency and index</a></li><li><a href="https://www.techiedelight.com/custom-sort-sort-elements-array-order-elements-defined-second-array/">Sort an array based on order defined by another array</a></li><li><a href="https://www.techiedelight.com/find-triplet-given-with-given-sum/">Find a triplet with the given sum in an array</a></li><li><a href="https://www.techiedelight.com/4-sum-problem/">4–Sum Problem | Quadruplets with a given sum</a></li><li><a href="https://www.techiedelight.com/binary-search/">Binary Search Algorithm — Iterative and Recursive Implementation</a></li><li><a href="https://www.techiedelight.com/find-peak-element-array/">Find the peak element in an array</a></li><li><a href="https://www.techiedelight.com/activity-selection-problem/">Activity Selection Problem</a></li><li><a href="https://www.techiedelight.com/job-sequencing-problem-deadlines/">Job Sequencing Problem with Deadlines</a></li><li><a href="https://www.techiedelight.com/maximum-product-subset-problem/">Maximum Product Subset Problem</a></li><li><a href="https://www.techiedelight.com/find-pairs-given-difference-k-array-constant-space-solution/">Find pairs with difference `k` in an array | Constant Space Solution</a></li><li><a href="https://www.techiedelight.com/find-pairs-with-given-difference-array/">Find pairs with difference `k` in an array</a></li><li><a href="https://www.techiedelight.com/quickselect-algorithm/">Quickselect Algorithm</a></li><li><a href="https://www.techiedelight.com/check-subarray-with-0-sum-exists-not/">Check if a subarray with 0 sum exists or not</a></li><li><a href="https://www.techiedelight.com/4-sum-problem/">4–Sum Problem | Quadruplets with a given sum</a></li><li><a href="https://www.techiedelight.com/print-distinct-subsets-given-set/">Print all distinct subsets of a given set</a></li><li><a href="https://www.techiedelight.com/k-partition-problem-print-all-subsets/">K–Partition Problem | Printing all partitions</a></li><li><a href="https://www.techiedelight.com/3-partition-problem/">3–Partition Problem</a></li><li><a href="https://www.techiedelight.com/3-partition-problem-extended-print-all-partitions/">3–partition problem extended | Printing all partitions</a></li><li><a href="https://www.techiedelight.com/find-frequency-element-sorted-array-containing-duplicates/">Find the frequency of each element in a sorted array containing duplicates</a></li><li><a href="https://www.techiedelight.com/replace-each-element-corresponding-rank-array/">Replace each array element by its corresponding rank</a></li><li><a href="https://www.techiedelight.com/group-elements-array-based-first-occurrence/">Group elements of an array based on their first occurrence</a></li><li><a href="https://www.techiedelight.com/find-symmetric-pairs-array-pairs/">Find all symmetric pairs in an array of pairs</a></li><li><a href="https://www.techiedelight.com/count-distinct-elements-every-sub-array-size-k-array/">Find the count of distinct elements in every subarray of size `k`</a></li><li><a href="https://www.techiedelight.com/print-sub-arrays-array-distinct-elements/">Print all subarrays of an array having distinct elements</a></li><li><a href="https://www.techiedelight.com/find-ways-calculate-target-elements-array/">Find ways to calculate a target from elements of the specified array</a></li><li><a href="https://www.techiedelight.com/find-minimum-index-repeating-element-array/">Find the minimum index of a repeating element in an array</a></li><li><a href="https://www.techiedelight.com/check-array-formed-consecutive-integers/">Check if an array is formed by consecutive integers</a></li><li><a href="https://www.techiedelight.com/find-two-non-overlapping-pairs-sum-array/">Find two non-overlapping pairs having the same sum in an array</a></li><li><a href="https://www.techiedelight.com/find-two-numbers-maximum-sum-array-digits/">Find two numbers with maximum sum formed by array digits</a></li><li><a href="https://www.techiedelight.com/count-distinct-absolute-values-sorted-array/">Count distinct absolute values in a sorted array</a></li><li><a href="https://www.techiedelight.com/find-subarrays-given-sum-array/">Find subarrays with a given sum in an array</a></li><li><a href="https://www.techiedelight.com/surpasser-count-each-element-array/">Find surpasser count for each array element</a></li><li><a href="https://www.techiedelight.com/find-maximum-absolute-difference-subarrays/">Find the maximum absolute difference between the sum of two non-overlapping subarrays</a></li><li><a href="https://www.techiedelight.com/print-all-combination-numbers-from-1-to-n/">Print all combinations of numbers from 1 to `n` having sum `n`</a></li><li><a href="https://www.techiedelight.com/find-index-maximum-occurring-element-equal-probability/">Find an index of the maximum occurring element with equal probability</a></li></ul><h3>Matrix:</h3><ul><li><a href="https://www.techiedelight.com/find-occurrences-given-string-character-matrix/">Find all occurrences of the given string in a character matrix</a></li><li><a href="https://www.techiedelight.com/flood-fill-algorithm/">Flood Fill Algorithm</a></li><li><a href="https://www.techiedelight.com/count-the-number-of-islands/">Count number of islands</a></li><li><a href="https://www.techiedelight.com/find-all-paths-from-source-to-destination-in-matrix/">Find all paths from the first cell to the last cell of a matrix</a></li><li><a href="https://www.techiedelight.com/probability-alive-after-taking-n-steps-island/">Find the probability that a person is alive after taking `n` steps on an island</a></li><li><a href="https://www.techiedelight.com/find-path-source-destination-matrix-satisfies-given-constraints/">Find the path from source to destination in a matrix that satisfies given constraints</a></li><li><a href="https://www.techiedelight.com/find-common-elements-present-every-row-given-matrix/">Find all common elements present in each row of a matrix</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-ancestor-matrix/">Construct a binary tree from an ancestor matrix</a></li><li><a href="https://www.techiedelight.com/find-common-elements-present-rows-matrix/">Find common elements present in all rows of a matrix</a></li><li><a href="https://www.techiedelight.com/find-shortest-distance-every-cell-landmine-maze/">Find the shortest distance of every cell from a landmine inside a maze</a></li><li><a href="https://www.techiedelight.com/find-duplicate-rows-binary-matrix/">Find duplicate rows in a binary matrix</a></li></ul><h3>Strings:</h3><ul><li><a href="https://www.techiedelight.com/check-given-string-rotated-palindrome-not/">Check if a string is a rotated palindrome or not</a></li><li><a href="https://www.techiedelight.com/check-repeated-subsequence-present-string-not/">Check if a repeated subsequence is present in a string or not</a></li><li><a href="https://www.techiedelight.com/check-strings-can-derived-circularly-rotating/">Check if strings can be derived from each other by circularly rotating them</a></li><li><a href="https://www.techiedelight.com/determine-if-two-strings-are-anagram-or-not/">Determine whether two strings are anagram or not</a></li><li><a href="https://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/">Find all binary strings that can be formed from a wildcard pattern</a></li><li><a href="https://www.techiedelight.com/find-interleavings-of-given-strings/">Find all interleaving of given strings</a></li><li><a href="https://www.techiedelight.com/isomorphic-strings/">Isomorphic Strings</a></li><li><a href="https://www.techiedelight.com/find-possible-palindromic-substrings-string/">Find all possible palindromic substrings of a string</a></li><li><a href="https://www.techiedelight.com/find-possible-combinations-words-formed-from-mobile-keypad/">Find all possible combinations of words formed from the mobile keypad</a></li><li><a href="https://www.techiedelight.com/possible-combinations-replacing-given-digits-corresponding-list/">Find all possible combinations by replacing given digits with characters of the corresponding list</a></li><li><a href="https://www.techiedelight.com/find-words-that-follows-given-pattern/">Find all words from the given list that follow the same order of characters as the given pattern</a></li><li><a href="https://www.techiedelight.com/first-k-non-repeating-characters-string/">Find first `k` non-repeating characters in a string in a single traversal</a></li><li><a href="https://www.techiedelight.com/group-anagrams-together-given-list-words/">Group anagrams together from a list of words</a></li><li><a href="https://www.techiedelight.com/reverse-text-without-reversing-individual-words/">Reverse text without reversing individual words</a></li><li><a href="https://www.techiedelight.com/find-longest-substring-containing-k-distinct-characters/">Find the longest substring of a string containing `k` distinct characters</a></li><li><a href="https://www.techiedelight.com/find-palindromic-permutations-string/">Find all palindromic permutations of a string</a></li><li><a href="https://www.techiedelight.com/find-substrings-string-permutation-given-string/">Find all substrings of a string that are a permutation of another string</a></li><li><a href="https://www.techiedelight.com/find-longest-substring-given-string-containing-distinct-characters/">Find the longest substring of a string containing distinct characters</a></li><li><a href="https://www.techiedelight.com/find-permutations-given-string/">Find all permutations of a string in C++ (Using Backtracking and STL)</a></li><li><a href="https://www.techiedelight.com/find-lexicographically-next-permutations-string-sorted-ascending-order/">Find all lexicographically next permutations of a string sorted in ascending order</a></li><li><a href="https://www.techiedelight.com/find-lexicographically-minimal-string-rotation/">Lexicographically Minimal String Rotation</a></li><li><a href="https://www.techiedelight.com/find-n-digit-binary-numbers-k-bits-set-k-ranges-1-n/">Find all n-digit binary numbers with k-bits set where `k` ranges from 1 to `n`</a></li><li><a href="https://www.techiedelight.com/generate-binary-numbers-1-n/">Generate binary numbers between 1 to `n` using a queue</a></li><li><a href="https://www.techiedelight.com/calculate-rank-lexicographically-sorted-permutations/">Lexicographic rank of a string</a></li><li><a href="https://www.techiedelight.com/shortest-superstring-problem/">Shortest Superstring Problem</a></li><li><a href="https://www.techiedelight.com/check-string-interleaving-two-given-strings/">Check if a string is interleaving of two other given strings</a></li><li><a href="https://www.techiedelight.com/find-permutations-string-cpp-java-iterative/">Iterative approach to finding permutations of a string</a></li><li><a href="https://www.techiedelight.com/std_next_permutation-overview-implementation/">std::next_permutation | Overview and Implementation in C++</a></li><li><a href="https://www.techiedelight.com/std_prev_permutation-overview-implementation/">std::prev_permutation | Overview and Implementation in C++</a></li><li><a href="https://www.techiedelight.com/implementation-kmp-algorithm-c-cpp-java/">Implementation of KMP Algorithm</a></li><li><a href="https://www.techiedelight.com/construct-longest-palindrome-string/">Construct the longest palindrome by shuffling or deleting characters from a string</a></li><li><a href="https://www.techiedelight.com/determine-string-follows-specified-order/">Determine whether the characters of a string follow a specified order or not</a></li><li><a href="https://www.techiedelight.com/determine-pattern-matches-string-not/">Determine whether a string matches with a given pattern</a></li></ul><h3>Binary Tree:</h3><ul><li><a href="https://www.techiedelight.com/check-if-two-binary-trees-are-identical-not-iterative-recursive/">Check if two binary trees are identical or not</a></li><li><a href="https://www.techiedelight.com/calculate-height-binary-tree-iterative-recursive/">Calculate the height of a binary tree</a></li><li><a href="https://www.techiedelight.com/delete-given-binary-tree-iterative-recursive/">Delete a binary tree</a></li><li><a href="https://www.techiedelight.com/level-order-traversal-binary-tree/">Level order traversal of a binary tree</a></li><li><a href="https://www.techiedelight.com/spiral-order-traversal-binary-tree/">Spiral order traversal of a binary tree</a></li><li><a href="https://www.techiedelight.com/reverse-level-order-traversal-binary-tree/">Reverse level order traversal of a binary tree</a></li><li><a href="https://www.techiedelight.com/print-nodes-binary-tree-specific-order/">Print all nodes of a perfect binary tree in a specific order</a></li><li><a href="https://www.techiedelight.com/print-left-view-of-binary-tree/">Print left view of a binary tree</a></li><li><a href="https://www.techiedelight.com/print-bottom-view-of-binary-tree/">Print bottom view of a binary tree</a></li><li><a href="https://www.techiedelight.com/print-top-view-binary-tree/">Print top view of a binary tree</a></li><li><a href="https://www.techiedelight.com/find-next-node-in-same-level-binary-tree/">Find the next node at the same level as the given node in a binary tree</a></li><li><a href="https://www.techiedelight.com/check-given-binary-tree-complete-binary-tree-not/">Check if a binary tree is a complete binary tree or not</a></li><li><a href="https://www.techiedelight.com/determine-given-binary-tree-is-subtree-of-another-binary-tree-not/">Determine whether a binary tree is a subtree of another binary tree</a></li><li><a href="https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/">Postorder Tree Traversal</a></li><li><a href="https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/">Preorder Tree Traversal</a></li><li><a href="https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/">Inorder Tree Traversal</a></li><li><a href="https://www.techiedelight.com/find-ancestors-of-given-node-binary-tree/">Find ancestors of a given node in a binary tree</a></li><li><a href="https://www.techiedelight.com/find-vertical-sum-given-binary-tree/">Find the vertical sum of a binary tree</a></li><li><a href="https://www.techiedelight.com/vertical-traversal-binary-tree/">Perform vertical traversal of a binary tree</a></li><li><a href="https://www.techiedelight.com/find-diagonal-sum-given-binary-tree/">Find the diagonal sum of a binary tree</a></li><li><a href="https://www.techiedelight.com/print-diagonal-traversal-binary-tree/">Print diagonal traversal of a binary tree</a></li><li><a href="https://www.techiedelight.com/print-corner-nodes-every-level-binary-tree/">Print corner nodes of every level in a binary tree</a></li><li><a href="https://www.techiedelight.com/print-right-view-binary-tree/">Print right view of a binary tree</a></li><li><a href="https://www.techiedelight.com/find-maximum-width-given-binary-tree/">Compute the maximum number of nodes at any level in a binary tree</a></li><li><a href="https://www.techiedelight.com/build-binary-tree-given-parent-array/">Build a binary tree from a parent array</a></li><li><a href="https://www.techiedelight.com/find-pair-with-given-sum-bst/">Find a pair with the given sum in a BST</a></li><li><a href="https://www.techiedelight.com/construct-binary-tree-ancestor-matrix/">Construct a binary tree from an ancestor matrix</a></li><li><a href="https://www.techiedelight.com/print-leaf-to-root-path-binary-tree/">Iteratively print the leaf to root path for every leaf node in a binary tree</a></li></ul><h3>Dynamic Programming:</h3><ul><li><a href="https://www.techiedelight.com/introduction-dynamic-programming/">Introduction to Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence/">Longest Common Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence-finding-lcs/">Longest Common Subsequence | Finding all LCS</a></li><li><a href="https://www.techiedelight.com/longest-common-subsequence-of-k-sequences/">Longest Common Subsequence of k–sequences</a></li><li><a href="https://www.techiedelight.com/longest-palindromic-subsequence-using-dynamic-programming/">Longest Palindromic Subsequence using Dynamic Programming</a></li><li><a href="https://www.techiedelight.com/longest-repeated-subsequence-problem/">Longest Repeated Subsequence Problem</a></li><li><a href="https://www.techiedelight.com/shortest-common-supersequence-introduction-scs-length/">Shortest Common Supersequence Problem</a></li><li><a href="https://www.techiedelight.com/find-longest-sequence-formed-adjacent-numbers-matrix/">Find the longest sequence formed by adjacent numbers in the matrix</a></li><li><a href="https://www.techiedelight.com/counting-paths-on-grid-to-reach-destination-cell/">Count the number of paths in a matrix with a given cost to reach the destination cell</a></li><li><a href="https://www.techiedelight.com/0-1-knapsack-problem/">0–1 Knapsack Problem</a></li><li><a href="https://www.techiedelight.com/subset-sum-problem/">Subset Sum Problem — Dynamic Programming Solution</a></li><li><a href="https://www.techiedelight.com/minimum-sum-partition-problem/">Minimum Sum Partition Problem</a></li><li><a href="https://www.techiedelight.com/coin-change-problem-find-total-number-ways-get-denomination-coins/">Coin Change Problem</a></li><li><a href="https://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/">Find optimal cost to construct a binary search tree</a></li><li><a href="https://www.techiedelight.com/maximum-length-snake-sequence/">Maximum Length Snake Sequence</a></li><li><a href="https://www.techiedelight.com/check-string-interleaving-two-given-strings/">Check if a string is interleaving of two other given strings</a></li><li><a href="https://www.techiedelight.com/find-ways-calculate-target-elements-array/">Find ways to calculate a target from elements of the specified array</a></li></ul><h3>Linked List:</h3><ul><li><a href="https://www.techiedelight.com/detect-cycle-linked-list-floyds-cycle-detection-algorithm/">Detect cycle in a linked list (Floyd’s Cycle Detection Algorithm)</a></li><li><a href="https://www.techiedelight.com/remove-duplicates-linked-list/">Remove duplicates from a linked list in a single traversal</a></li><li><a href="https://www.techiedelight.com/remove-duplicates-linked-list/">Remove duplicates from a linked list in a single traversal</a></li><li><a href="https://www.techiedelight.com/convert-multilevel-linked-list-singly/">Convert a multilevel linked list to a singly linked list</a></li></ul><h3>Miscellaneous:</h3><ul><li><a href="https://www.techiedelight.com/cpp-implementation-trie-data-structure/">C++ Implementation of Trie Data Structure</a></li><li><a href="https://www.techiedelight.com/memory-efficient-trie-implementation-using-map-insert-search-delete/">Memory Efficient Implementation of Trie in C++ — Insert, Search and Delete</a></li><li><a href="https://www.techiedelight.com/generate-power-set-given-set/">Generate the power set of a given set</a></li><li><a href="https://www.techiedelight.com/numbers-represented-as-sum-of-two-cubes/">Find numbers represented as the sum of two cubes for two different pairs</a></li><li><a href="https://www.techiedelight.com/traverse-given-directory-bfs-dfs-java/">Traverse a given directory using BFS and DFS in Java</a></li></ul><p><strong>Thanks for reading.</strong></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7900a6ddb1d4" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techie-delight/data-structures-and-algorithms-problems-in-c-using-stl-7900a6ddb1d4">Data structures and algorithms problems in C++ using STL</a> was originally published in <a href="https://medium.com/techie-delight">Techie Delight</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>