450-DSA-Questions
450- DSA Questions π₯π₯
νμΌ νμκΈ°
μ΅μ’ λ²μ λ€μ΄λ‘λ (.zip)- org.eclipse.jdt.core.prefs
- arraysubsetanother.class
- buysellstock.class
- buysellstock2tran.class
- buysellstockfees.class
- buysellstockinfinte.class
- buysellstockktrans.class
- choclatedistribution.class
- commonelements.class
- elementsappearktimes.class
- factorialBigno.class
- findduplicate.class
- inversioncount.class
- kthmaxmin.class
- largestrectanglehistogram.class
- largestsumsubarray.class
- Longest_subarray_less_than_k.class
- longestconsecutivesubsequence.class
- maxandmin$Pair.class
- maxandmin.class
- maxproductsubarray.class
- median.class
- medianoftwosortedarray.class
- medianSortArrSameSize.class
- mergearrayNospace.class
- mergeintervals.class
- minimisemaxdiff$1.class
- minimisemaxdiff$pair.class
- minimisemaxdiff.class
- minjumpsps.class
- minswapsKtogether.class
- MM.class
- negativetooneside.class
- nextpermutation.class
- pallindromicarray.class
- positivenegativealt.class
- rainwater.class
- rearrangeArray.class
- reversearray.class
- smallestsubarray.class
- sort012.class
- subarraysum0.class
- subarraysumk.class
- sumpair.class
- sumtriplet.class
- template.class
- threewaypartitioning.class
- uglynumber.class
- unionintersectionofarrays.class
- allPossiblePaths.class
- balancedparanthesis.class
- combinationsum.class
- equalsumsubset.class
- isValidIP.class
- klengthpath.class
- knighttour.class
- kpartition.class
- kpartitionequalsum.class
- kthpermutation.class
- landmines$pair.class
- landmines.class
- largestnoinkswap.class
- letterCasePermutations.class
- longestpossibleroute.class
- mcolouring.class
- nqueens.class
- printallpallindromicsubstring.class
- printallpath.class
- ratinamaze.class
- removeinvalidpara.class
- splitintofibbonacciseq.class
- sudoku.class
- tugofwar.class
- wordbreak2.class
- binarytobst$BST$Node.class
- binarytobst$BST.class
- binarytobst.class
- bstfrompreorder$BST$Node.class
- bstfrompreorder$BST.class
- bstfrompreorder.class
- bsttobalancedbst$BST$Node.class
- bsttobalancedbst$BST.class
- bsttobalancedbst.class
- countbstnodesrange$BST$Node.class
- countbstnodesrange$BST.class
- countbstnodesrange.class
- deletionandfindvalue$BST$Node.class
- deletionandfindvalue$BST.class
- deletionandfindvalue.class
- flattenbst$BST$Node.class
- flattenbst$BST.class
- flattenbst.class
- inordersuccessor$BST$Node.class
- inordersuccessor$BST$pair.class
- inordersuccessor$BST.class
- inordersuccessor.class
- isbst$BST$Node.class
- isbst$BST.class
- isbst.class
- isdeadend$BST$Node.class
- isdeadend$BST.class
- isdeadend.class
- kthlargest$BST$Node.class
- kthlargest$BST.class
- kthlargest.class
- largestbst$BST$Node.class
- largestbst$BST$pair.class
- largestbst$BST.class
- largestbst.class
- LCA$BST$Node.class
- LCA$BST.class
- LCA.class
- median$BST$Node.class
- median$BST.class
- median.class
- mergetwobst$BST$Node.class
- mergetwobst$BST.class
- mergetwobst.class
- morristraversal$BST$Node.class
- morristraversal$BST.class
- morristraversal.class
- replacewithleastgreterelement$BST$Node.class
- replacewithleastgreterelement$BST.class
- replacewithleastgreterelement.class
- successorandpre$BST$Node.class
- successorandpre$BST.class
- successorandpre.class
- targetsum2bst$BST$Node.class
- targetsum2bst$BST.class
- targetsum2bst.class
- bottomview$BinaryTree$Node.class
- bottomview$BinaryTree$pair.class
- bottomview$BinaryTree.class
- bottomview.class
- boundarytraversal$BinaryTree$Node.class
- boundarytraversal$BinaryTree.class
- boundarytraversal.class
- chechkmirror$BinaryTree$Node.class
- chechkmirror$BinaryTree.class
- chechkmirror.class
- checkforduplicatesubtree$BinaryTree$Node.class
- checkforduplicatesubtree$BinaryTree$pair.class
- checkforduplicatesubtree$BinaryTree.class
- checkforduplicatesubtree.class
- cheeckleafsamelevel$BinaryTree$Node.class
- cheeckleafsamelevel$BinaryTree.class
- cheeckleafsamelevel.class
- diagnoltraversal$BinaryTree$Node.class
- diagnoltraversal$BinaryTree.class
- diagnoltraversal.class
- diameter$BinaryTree$diapair.class
- diameter$BinaryTree$Node.class
- diameter$BinaryTree.class
- diameter.class
- distancebw2nodes$BinaryTree$Node.class
- distancebw2nodes$BinaryTree.class
- distancebw2nodes.class
- height$Node.class
- height.class
- inorderiteration$BinaryTree$Node.class
- inorderiteration$BinaryTree.class
- inorderiteration.class
- isbalanced$BinaryTree$Node.class
- isbalanced$BinaryTree$pair.class
- isbalanced$BinaryTree.class
- isbalanced.class
- isomorphictree$BinaryTree$Node.class
- isomorphictree$BinaryTree.class
- isomorphictree.class
- issumtree$BinaryTree$Node.class
- issumtree$BinaryTree$pair.class
- issumtree$BinaryTree.class
- issumtree.class
- iterativeprepostinorder$BinaryTree$Node.class
- iterativeprepostinorder$BinaryTree$pair.class
- iterativeprepostinorder$BinaryTree.class
- iterativeprepostinorder.class
- kthancestor$BinaryTree$Node.class
- kthancestor$BinaryTree.class
- kthancestor.class
- largestsubtreesum$BinaryTree$Node.class
- largestsubtreesum$BinaryTree.class
- largestsubtreesum.class
- LCA$BinaryTree$Node.class
- LCA$BinaryTree.class
- LCA.class
- leftview$BinaryTree$Node.class
- leftview$BinaryTree.class
- leftview.class
- levelorder$Node.class
- levelorder.class
- longestpathsum$BinaryTree$Node.class
- longestpathsum$BinaryTree$pair.class
- longestpathsum$BinaryTree.class
- longestpathsum.class
- maxsumnonadjacentnodes$BinaryTree$Node.class
- maxsumnonadjacentnodes$BinaryTree.class
- maxsumnonadjacentnodes.class
- minswaptomakeBST$BinaryTree$Node.class
- minswaptomakeBST$BinaryTree.class
- minswaptomakeBST.class
- mirror$BinaryTree$Node.class
- mirror$BinaryTree.class
- mirror.class
- preorderiterative$BinaryTree$Node.class
- preorderiterative$BinaryTree.class
- preorderiterative.class
- printduplicatesubtree$BinaryTree$Node.class
- printduplicatesubtree$BinaryTree.class
- printduplicatesubtree.class
- printksumpath$BinaryTree$Node.class
- printksumpath$BinaryTree.class
- printksumpath.class
- reverselevelorder$Node.class
- reverselevelorder.class
- topview$BinaryTree$Node.class
- topview$BinaryTree$pair.class
- topview$BinaryTree.class
- topview.class
- tosumtree$BinaryTree$Node.class
- tosumtree$BinaryTree.class
- tosumtree.class
- treefrominorderandpre$BinaryTree$Node.class
- treefrominorderandpre$BinaryTree.class
- treefrominorderandpre.class
- treefromstring$BinaryTree$Node.class
- treefromstring$BinaryTree.class
- treefromstring.class
- treetoDDL$BinaryTree$Node.class
- treetoDDL$BinaryTree.class
- treetoDDL.class
- zigzagtraversal$BinaryTree$Node.class
- zigzagtraversal$BinaryTree.class
- zigzagtraversal.class
- copysetbitinarange.class
- countnoofflipbits.class
- countsetbits.class
- countsquencewithproductK.class
- counttotalsetbits.class
- dividewithoutoperator.class
- intro.class
- ispower2.class
- missingtwonumber.class
- posofonlysetbit.class
- powerset.class
- practise.class
- printsubsets.class
- binomialcoffecient.class
- booleanparenthisation.class
- buyingstockstwice.class
- buysellstockKtrans.class
- catalanno.class
- coinchange.class
- coingamewinner.class
- countdearangements.class
- countdistinctsubsequence.class
- countpallindromicsubsequence.class
- editdistance.class
- eggdrop.class
- friendspairing.class
- goldmine.class
- interleavedstrings.class
- knapsack.class
- LargestIndependentset$node.class
- LargestIndependentset.class
- largestsquareinmatrix.class
- lcs.class
- lcs3strings.class
- longestaltsubsequence.class
- longestcommonsubstring.class
- longestincsubsequence.class
- longestpallindromicsubsequence.class
- longestpallindromicsubstring.class
- longestrepeatingsubsequence.class
- longestsequencewithadjdiif1.class
- maxdiffofzeroandone.class
- maximisecutsegment.class
- maxlengthchain$pair.class
- maxlengthchain.class
- maxpathmatrix.class
- maxrectanglewithequal01.class
- maxrectanglewithsum0.class
- maxsumincsequence.class
- maxsumrectangle.class
- maxsumsequenceno3consecutive.class
- mcm.class
- mincostfillbag.class
- minjumps.class
- minremovalarraymaxmin.class
- mobilekeypad.class
- optimalbst.class
- optimalgame.class
- paintingfence.class
- pallindromicpartioning.class
- permutationcoffecient.class
- reachagivenscore.class
- subsetsum.class
- sumpairwithdiff.class
- unboundedKnapsack.class
- weightedjobscheduling$pair.class
- weightedjobscheduling.class
- wordbreak.class
- aliendict.class
- bellmanford$edgepair.class
- bellmanford.class
- bfs$pair.class
- bfs.class
- bipertite$pair.class
- bipertite.class
- bridgeinagraph.class
- cheapestflights$pair.class
- cheapestflights.class
- chromaticnumber.class
- clonegraph$Node.class
- clonegraph.class
- counttriangles.class
- cycleindirectedgraph.class
- dfsdft$pair.class
- dfsdft.class
- dijkstra$pair.class
- dijkstra.class
- eulariancircuit.class
- floodfill.class
- floydwarshall.class
- journeytomoon.class
- klengthpath.class
- longestpath.class
- makegraph$Graph$pair.class
- makegraph$Graph.class
- makegraph.class
- mcolouring.class
- mcoluringproblem.class
- minedgesreverse$pair.class
- minedgesreverse.class
- minimisecashflow$pair.class
- minimisecashflow.class
- minstepsKnight.class
- mintimebyjob.class
- noofislands.class
- oliverandthegame.class
- prims$pair.class
- prims.class
- ratinmaze.class
- snakeandladder$pair.class
- snakeandladder.class
- stronglyconnectedKOSARAJU.class
- topologicalsort.class
- travellingsalesman.class
- twocliche$pair.class
- twocliche.class
- wiredconnections.class
- wordladder.class
- activityselection$pair.class
- activityselection.class
- arrangeamplifiers$FastReader.class
- arrangeamplifiers.class
- buymaxstocks$pair.class
- buymaxstocks.class
- Chocola.class
- chooseandswap.class
- defkin.class
- diehard.class
- fractionalknapsack$1.class
- fractionalknapsack$Item.class
- fractionalknapsack.class
- gergovia$FastReader.class
- gergovia.class
- huffmanencoding$Node.class
- huffmanencoding.class
- islandsurvival.class
- jobsequencingproblem$1.class
- jobsequencingproblem$Job.class
- jobsequencingproblem.class
- maximumtrain$train.class
- maximumtrain.class
- maxproductsubset.class
- maxsum3stack.class
- maxsumafterknegations.class
- maxsumarr.class
- maxsumpermutation.class
- minmaxcandies.class
- minplatforms$train.class
- minplatforms.class
- pickingupchicks$FastReader.class
- pickingupchicks.class
- smallestnowithgivensum.class
- smallestsubsetwithgrtrsum.class
- bsttominheap$BST$Node.class
- bsttominheap$BST.class
- bsttominheap.class
- connectropes.class
- convertmintomaxheap.class
- heapsort.class
- isbtaheap.class
- klargest.class
- kthlargest.class
- kthlargestcontisubarraysum.class
- maxheap.class
- maxofsubarrayinwindow.class
- medianinastream.class
- mergeksortedarrays$pair.class
- mergeksortedarrays.class
- mergeksortedlinkedlist$Node.class
- mergeksortedlinkedlist$pair.class
- mergeksortedlinkedlist.class
- mergetwoheaps.class
- minheap.class
- minsumformedbydigits.class
- reorganisestring$pair.class
- reorganisestring.class
- add1tolinkedlist$Node.class
- add1tolinkedlist.class
- add2number$Node.class
- add2number.class
- cloneLLwithrandompointers$Node.class
- cloneLLwithrandompointers.class
- deleteloop$Node.class
- deleteloop.class
- deletenodesonright$Node.class
- deletenodesonright.class
- detectloop$Node.class
- detectloop.class
- flattenedLL$Node.class
- flattenedLL.class
- intersectionofsortedlist$Node.class
- intersectionofsortedlist.class
- intersectionpoint$Node.class
- intersectionpoint.class
- ksortedLL$Node.class
- ksortedLL.class
- LinkedList$Node.class
- LinkedList.class
- LLasStack$Node.class
- LLasStack.class
- llclient.class
- mergesort$Node.class
- mergesort.class
- multiplytwoLL$Node.class
- multiplytwoLL.class
- nthnodefromlast$Node.class
- nthnodefromlast.class
- pallindrome$Node.class
- pallindrome.class
- removeduplicate$Node.class
- removeduplicate.class
- removeduplicatesunsorted$Node.class
- removeduplicatesunsorted.class
- reversedoublyLL$Node.class
- reversedoublyLL.class
- reverseLL$ListNode.class
- reverseLL.class
- reverseLLingroups$Node.class
- reverseLLingroups.class
- rotatedoublyLLbyn$Node.class
- rotatedoublyLLbyn.class
- segregateevenodd$Node.class
- segregateevenodd.class
- sort012$Node.class
- sort012.class
- commonelement.class
- commonelements.class
- kthsmallest.class
- maxsizerectangle.class
- median.class
- rotate.class
- rowwithmax1.class
- searchmatrix.class
- sort.class
- spiraltraversal.class
- citytour.class
- joshlinkedlisttobst$Node.class
- joshlinkedlisttobst.class
- joshmirrortreequestion$BinaryTree$Node.class
- joshmirrortreequestion$BinaryTree.class
- joshmirrortreequestion.class
- largestnumber$Sort.class
- largestnumber.class
- mincharinsertpallindrome.class
- nooflengthn.class
- perfectpeak.class
- powerfunction.class
- prettyprint.class
- stringpallindrome.class
- unluckyno13.class
- countAndSay.class
- adjacentdifferbyk.class
- agressivecows.class
- bookallocation.class
- countingsort.class
- countsubarraywithzerosum.class
- counttripletwithsmallersum.class
- doubblehelix.class
- ekospoj$FastReader.class
- ekospoj.class
- findfirstandlastindex.class
- findpairwithgivendiff.class
- foursum.class
- inplacemergesort.class
- inversioncount.class
- kthsmallestAGAIN$pair.class
- kthsmallestAGAIN.class
- majorityelement.class
- maxsumnoadjacent.class
- mergewithoutspace.class
- minswapstosort.class
- missingnoinap.class
- productarray.class
- repeatingandmissing.class
- roti_prata.class
- searchinrotatedarray.class
- subsetsum.class
- trailling0infactorial.class
- balancedpara.class
- celebrityproblem.class
- circulartourPetrolpump.class
- distanceofnearest1$pair.class
- distanceofnearest1.class
- dynamicstack.class
- dynamicstackclient.class
- evaluatepostfix.class
- firstnegative.class
- firstnonrepeatingcharacterstream.class
- gamewithstring.class
- getminstack.class
- implement2stack$TwoStack.class
- implement2stack.class
- interleave.class
- kqueue.class
- kqueueclient.class
- kstackclient.class
- kstacks.class
- largestareaHistogram.class
- longestvalidsubstring.class
- LRUCache$Node.class
- LRUCache.class
- maxelementinwindow.class
- mergeintervals$pair.class
- mergeintervals.class
- midstackclient.class
- nextgreater.class
- nextminelement.class
- queue.class
- queueclient.class
- redundantbrackets.class
- reverseaqueue.class
- reversestack.class
- rotalloranges$pair.class
- rotalloranges.class
- sortstack.class
- stackclient.class
- stackusingarray.class
- stackusingtwoqueue.class
- stackwithmiddleoperation$Node.class
- stackwithmiddleoperation.class
- summinmaxinawindow.class
- balanceparenthisis.class
- checkshuffle.class
- computercafeproblem.class
- countandsay.class
- countofnumberofstringinarray.class
- countpallindromicsubsequence.class
- countreversals.class
- duplicates.class
- editdistance.class
- immutability.class
- isomorphicstring.class
- knuthmorispratt.class
- LCS.class
- longestcommonprefix.class
- longestpallindromicsubsequence.class
- Longestrepeatingsubsequence.class
- longetspallindromicsubstring.class
- minflips.class
- mininsertionfrontpalindrome.class
- minswapsbracket.class
- pallindrome.class
- permutation.class
- printallsentences.class
- printanagrams.class
- printsubsequence.class
- rabbinkarp.class
- removeconsecutiveduplicates.class
- romantointeger.class
- rotationstrings.class
- searchstringin2dmatrix.class
- secondmostrepeatedword.class
- sentencetonumber.class
- smallestwindow2.class
- smallestwindowthatcontainallchar.class
- splitstring01.class
- transformonestrinhtoother.class
- validIP.class
- wildcardcharactersstringmatching.class
- wordbreak.class
- wordwrap.class
- rangeProductQueries.class
- 0,1,2_sort_array.cpp
- Best Time to Buy and Sell Stock.cpp
- BinarySearch.cpp
- chocolateDistributionProblem.cpp
- commonElements3SortedArrays.cpp
- Count pairs with given sum.cpp
- countInversion.cpp
- Cyclically rotate an array by one.cpp
- cyclically rotate.cpp
- elementsAppearingMoreThanNByKTimes.cpp
- Factorials of large numbers.cpp
- Find Duplicate.cpp
- Find the Duplicate Number( through Binary search).cpp
- Kadane's Algorithm.cpp
- Kth smallest element.cpp
- longestConsecutiveSubsequence.cpp
- max_and_min_in_array.cpp
- maximumProductSubarray.cpp
- Merge Without Extra Space.cpp
- Minimum number of jumps.cpp
- minimumLengthSubarrayWithSum.cpp
- minimumMergeOperationsMakeArrayPalindrome.cpp
- minimumSwapsKTogether.cpp
- move all negative.cpp
- nextPermutation.cpp
- rearrangePositiveNegativeO1Space.cpp
- Reverse an array.cpp
- subarrayWithZeroSum.cpp
- Three way partitioning.cpp
- trappingRainWater.cpp
- tripletWithSumK.cpp
- union and intersection of two sorted arrays.cpp
- whetherArraySubsetOrNot.cpp
- graphColoring.cpp
- knightTour.cpp
- printAllPathsMNMatrix.cpp
- printPermutations.cpp
- RatInMaze.cpp
- targetSumSubsets.cpp
- binaryTreeToSumTree.cpp
- constructBinaryTreePreorderInorder.cpp
- diameterBinaryTree.cpp
- heightOfBinaryTree.cpp
- isTreeBalancedBinaryTree.cpp
- LCABinaryTree.cpp
- levelOrderTraversal.cpp
- maximumSumSubtree.cpp
- mirrorOfTree.cpp
- zigZagTraversal.cpp
- xor_prob_1.cpp
- xor_prob_2.cpp
- xor_prob_3.cpp
- all bits to zero except last.cpp
- binary code to intege.cpp
- Bit Difference.cpp
- even or odd using bit manipulation.cpp
- Find position of set bit.cpp
- generate all possible subsets.cpp
- integer_to_binary.cpp
- Number of 1 Bits .cpp
- Power of 2.cpp
- brothers_from_different_roots.c++
- chech_whether_bst_contains_dead_end.c++
- constructBSTPreorder.cpp
- count_bst_nodes_that_lie_in_a_given_range.c++
- deleteNodeBST.cpp
- flatten_binary_tree_to_linked_list.c++
- isTreeBST.cpp
- k_th_largest_element_in_bst.c++
- k_th_smallest_element_in_bst.c++
- largestBSTSubtree.cpp
- LCABST.cpp
- preorder_to_postorder.c++
- printElementsInRange.cpp
- Boolean_Parenthesization.c++
- Coin Change.cpp
- Count number of ways to reacha given score in a game.cpp
- Edit Distance.cpp
- Egg Dropping Puzzle.cpp
- Friends Pairing Problem.cpp
- Interleaved_Strings.c++
- Knapsack Problem.cpp
- Knapsack with Duplicate Items(Unbounded Knapsack).cpp
- LCS (Longest Common Subsequence) of three strings.cpp
- Longest Common Subsequence.cpp
- Longest Common Substring.cpp
- Longest Increasing Subsequence.cpp
- Longest Palindromic Subsequence.cpp
- Longest Repeating Subsequence.cpp
- Longest subsequence such that difference between adjacent is one.cpp
- Maximum subsequence sum such that no three are consecutive.cpp
- Maximum sum increasing subsequence.cpp
- maximum_sum_rectangle.c++
- Mobile_numeric_keypad.c++
- Space Optimized Solution of LCS.cpp
- Subset Sum Problem.cpp
- Word Break.cpp
- checkIfBinaryTreeIsMaxHeap.cpp
- Connect n ropes with minimum cost.cpp
- convertBSTToMinHeapInO1Space.cpp
- convertMinHeapToMaxHeap.cpp
- heapSort.cpp
- Kth smallest and largest in an unsorted array.cpp
- kthLargestSumContiguousSubarray.cpp
- maxPriorityQueueRecursion.cpp
- medianPriorityQueue.cpp
- mergeKSortedArrays.cpp
- mergeKSortedLinkedLists.cpp
- mergeTwoMaxHeaps.cpp
- minimumSum.cpp
- minPriorityQueueRecursion.cpp
- reorganizeString.cpp
- slidingWindowMaximum.cpp
- smallestRangeInKLists.cpp
- Adding_two_Linkedlist.cpp
- appendLastNToFirst.cpp
- clone_a_linked_list_with_next_and_random_pointer.c++
- eliminateDuplicatesSortedLinkedList.cpp
- evenAfterOddLinkedList.cpp
- flatten_a_linked_list.c++
- hasCycle.cpp
- intersectionOfTwoLinkedList.cpp
- isPalindrome.cpp
- kReverseLinkedList.cpp
- kthElementFromLast.cpp
- mergeSortLL.cpp
- Middle of the Linked List.cpp
- removeNodeFromEnd.cpp
- reverseLinkedList.cpp
- commonElementsAllRowsMatrix.cpp
- Kth element in Matrix.cpp
- matrixTranspose.cpp
- Median in a row-wise sorted Matrix.cpp
- rotateMatrix90Degree.cpp
- rowWithMax1s.cpp
- Search a 2D Matrix.cpp
- Sorted matrix.cpp
- Spirally traversing a matrix.cpp
- Count Squares.cpp
- Count triplets with sum smaller than X.cpp
- Find All Four Sum Numbers.cpp
- find fixed point (value equals to index).cpp
- Find Missing And Repeating.cpp
- Find Pair Given Difference.cpp
- Find pivot element.cpp
- First and last occurrences of x.cpp
- Majority Element.cpp
- Merge Without Extra Space.cpp
- Middle of Three.cpp
- Minimum Swaps to Sort.cpp
- Product array puzzle.cpp
- Search in Rotated Sorted Array.cpp
- Sort by Set Bit Count.cpp
- Stickler Thief.cpp
- Zero Sum Subarrays.cpp
- balancedBrackets.cpp
- firstNegativeIntegerInEveryWindow.cpp
- gasStation.cpp
- largestRectangleInHistogram.cpp
- nextGreaterElement.cpp
- nextSmallerElement.cpp
- redundantBrackets.cpp
- Reverse a stack using recurssion.cpp
- reverseFirstKElementsInQueue.cpp
- sort a stack using recurssion.cpp
- stackPermutations.cpp
- sumOfMinAndMaxElementsInSubarray.cpp
- Count and Say.cpp
- is_strings_anagram.cpp
- Longest Palindrome in a String.cpp
- Longest Repeating Subsequence.cpp
- Palindrome String.cpp
- Reverse String.cpp
- README.md
- sample.txt
- arraysubsetanother.java
- buysellstock.java
- buysellstock2tran.java
- buysellstockfees.java
- buysellstockinfinte.java
- buysellstockktrans.java
- choclatedistribution.java
- commonelements.java
- elementsappearktimes.java
- factorialBigno.java
- findduplicate.java
- inversioncount.java
- kthmaxmin.java
- largestrectanglehistogram.java
- largestsumsubarray.java
- longest_subarray_less_than_k.java
- longestconsecutivesubsequence.java
- maxandmin.java
- maxproductsubarray.java
- median.java
- medianoftwosortedarray.java
- medianSortArrSameSize.java
- mergearrayNospace.java
- mergeintervals.java
- minimisemaxdiff.java
- minjumpsps.java
- minswapsKtogether.java
- negativetooneside.java
- nextpermutation.java
- pallindromicarray.java
- positivenegativealt.java
- rainwater.java
- rearrangeArray.java
- reversearray.java
- smallestsubarray.java
- sort012.java
- Space optimization using bit manipulations.java
- subarraysum0.java
- subarraysumk.java
- sumpair.java
- sumtriplet.java
- threewaypartitioning.java
- uglynumber.java
- unionintersectionofarrays.java
- allPossiblePaths.java
- balancedparanthesis.java
- combinationsum.java
- equalsumsubset.java
- isValidIP.java
- klengthpath.java
- knighttour.java
- kpartition.java
- kpartitionequalsum.java
- kthpermutation.java
- landmines.java
- largestnoinkswap.java
- letterCasePermutations.java
- longestpossibleroute.java
- mcolouring.java
- nqueens.java
- printallpallindromicsubstring.java
- printallpath.java
- ratinamaze.java
- removeinvalidpara.java
- splitintofibbonacciseq.java
- sudoku.java
- tugofwar.java
- wordbreak2.java
- binarytobst.java
- bstfrompreorder.java
- bsttobalancedbst.java
- countbstnodesrange.java
- deletionandfindvalue.java
- flattenbst.java
- inordersuccessor.java
- isbst.java
- isdeadend.java
- kthlargest.java
- largestbst.java
- LCA.java
- median.java
- mergetwobst.java
- morristraversal.java
- replacewithleastgreterelement.java
- successorandpre.java
- targetsum2bst.java
- bottomview.java
- boundarytraversal.java
- chechkmirror.java
- checkforduplicatesubtree.java
- cheeckleafsamelevel.java
- diagnoltraversal.java
- diameter.java
- distancebw2nodes.java
- height.java
- inorderiteration.java
- isbalanced.java
- isomorphictree.java
- issumtree.java
- iterativeprepostinorder.java
- kthancestor.java
- largestsubtreesum.java
- LCA.java
- leftview.java
- levelorder.java
- longestpathsum.java
- maxsumnonadjacentnodes.java
- minswaptomakeBST.java
- mirror.java
- preorderiterative.java
- printduplicatesubtree.java
- printksumpath.java
- reverselevelorder.java
- topview.java
- tosumtree.java
- treefrominorderandpre.java
- treefromstring.java
- treetoDDL.java
- zigzagtraversal.java
- copysetbitinarange.java
- countnoofflipbits.java
- countsetbits.java
- countsquencewithproductK.java
- counttotalsetbits.java
- dividewithoutoperator.java
- intro.java
- ispower2.java
- missingtwonumber.java
- posofonlysetbit.java
- powerset.java
- practise.java
- printsubsets.java
- binomialcoffecient.java
- booleanparenthisation.java
- buyingstockstwice.java
- buysellstockKtrans.java
- catalanno.java
- coinchange.java
- coingamewinner.java
- countdearangements.java
- countdistinctsubsequence.java
- countpallindromicsubsequence.java
- editdistance.java
- eggdrop.java
- friendspairing.java
- goldmine.java
- interleavedstrings.java
- knapsack.java
- LargestIndependentset.java
- largestsquareinmatrix.java
- lcs.java
- lcs3strings.java
- longestaltsubsequence.java
- longestcommonsubstring.java
- longestincsubsequence.java
- longestpallindromicsubsequence.java
- longestpallindromicsubstring.java
- longestrepeatingsubsequence.java
- longestsequencewithadjdiif1.java
- maxdiffofzeroandone.java
- maximisecutsegment.java
- maxlengthchain.java
- maxpathmatrix.java
- maxrectanglewithequal01.java
- maxrectanglewithsum0.java
- maxsumincsequence.java
- maxsumrectangle.java
- maxsumsequenceno3consecutive.java
- mcm.java
- mincostfillbag.java
- minjumps.java
- minremovalarraymaxmin.java
- mobilekeypad.java
- optimalbst.java
- optimalgame.java
- paintingfence.java
- pallindromicpartioning.java
- permutationcoffecient.java
- reachagivenscore.java
- subsetsum.java
- sumpairwithdiff.java
- unboundedKnapsack.java
- weightedjobscheduling.java
- wordbreak.java
- aliendict.java
- bellmanford.java
- bfs.java
- bipertite.java
- bridgeinagraph.java
- cheapestflights.java
- chromaticnumber.java
- clonegraph.java
- counttriangles.java
- cycleindirectedgraph.java
- dfsdft.java
- dijkstra.java
- eulariancircuit.java
- floodfill.java
- floydwarshall.java
- journeytomoon.java
- klengthpath.java
- longestpath.java
- makegraph.java
- mcolouring.java
- mcoluringproblem.java
- minedgesreverse.java
- minimisecashflow.java
- minstepsKnight.java
- mintimebyjob.java
- noofislands.java
- oliverandthegame.java
- prims.java
- ratinmaze.java
- snakeandladder.java
- stronglyconnectedKOSARAJU.java
- topologicalsort.java
- travellingsalesman.java
- twocliche.java
- wiredconnections.java
- wordladder.java
- activityselection.java
- arrangeamplifiers.java
- buymaxstocks.java
- Chocola.java
- chooseandswap.java
- defkin.java
- diehard.java
- fractionalknapsack.java
- gergovia.java
- huffmanencoding.java
- islandsurvival.java
- jobsequencingproblem.java
- maximumtrain.java
- maxproductsubset.java
- maxsum3stack.java
- maxsumafterknegations.java
- maxsumarr.java
- maxsumpermutation.java
- minmaxcandies.java
- minplatforms.java
- pickingupchicks.java
- smallestnowithgivensum.java
- smallestsubsetwithgrtrsum.java
- bsttominheap.java
- connectropes.java
- convertmintomaxheap.java
- heapsort.java
- isbtaheap.java
- klargest.java
- kthlargest.java
- kthlargestcontisubarraysum.java
- maxheap.java
- maxofsubarrayinwindow.java
- medianinastream.java
- mergeksortedarrays.java
- mergeksortedlinkedlist.java
- mergetwoheaps.java
- minheap.java
- MinMachineScheduledTasks.java
- minsumformedbydigits.java
- reorganisestring.java
- add1tolinkedlist.java
- add2number.java
- cloneLLwithrandompointers.java
- deleteloop.java
- deletenodesonright.java
- detectloop.java
- flattenedLL.java
- intersectionofsortedlist.java
- intersectionpoint.java
- ksortedLL.java
- LinkedList.java
- LLasStack.java
- llclient.java
- mergesort.java
- multiplytwoLL.java
- nthnodefromlast.java
- pallindrome.java
- removeduplicate.java
- removeduplicatesunsorted.java
- reversedoublyLL.java
- reverseLL.java
- reverseLLingroups.java
- rotatedoublyLLbyn.java
- segregateevenodd.java
- sort012.java
- GCD.java
- Reverse.java
- User.java
- commonelement.java
- commonelements.java
- kthsmallest.java
- maxsizerectangle.java
- median.java
- rotate.java
- rowwithmax1.java
- searchmatrix.java
- sort.java
- spiraltraversal.java
- citytour.java
- joshlinkedlisttobst.java
- joshmirrortreequestion.java
- largestnumber.java
- mincharinsertpallindrome.java
- nooflengthn.java
- perfectpeak.java
- powerfunction.java
- prettyprint.java
- stringpallindrome.java
- unluckyno13.java
- countAndSay.java
- adjacentdifferbyk.java
- agressivecows.java
- bookallocation.java
- countingsort.java
- countsubarraywithzerosum.java
- counttripletwithsmallersum.java
- doubblehelix.java
- ekospoj.java
- findfirstandlastindex.java
- findpairwithgivendiff.java
- foursum.java
- inplacemergesort.java
- inversioncount.java
- kthsmallestAGAIN.java
- majorityelement.java
- maxsumnoadjacent.java
- mergewithoutspace.java
- minswapstosort.java
- missingnoinap.java
- productarray.java
- repeatingandmissing.java
- roti_prata.java
- searchinrotatedarray.java
- subsetsum.java
- trailling0infactorial.java
- balancedpara.java
- celebrityproblem.java
- circulartourPetrolpump.java
- distanceofnearest1.java
- dynamicstack.java
- dynamicstackclient.java
- evaluatepostfix.java
- firstnegative.java
- firstnonrepeatingcharacterstream.java
- gamewithstring.java
- getminstack.java
- implement2stack.java
- interleave.java
- kqueue.java
- kqueueclient.java
- kstackclient.java
- kstacks.java
- largestareaHistogram.java
- longestvalidsubstring.java
- LRUCache.java
- maxelementinwindow.java
- mergeintervals.java
- midstackclient.java
- nextgreater.java
- nextminelement.java
- queue.java
- queueclient.java
- redundantbrackets.java
- reverseaqueue.java
- reversestack.java
- rotalloranges.java
- sortstack.java
- stackclient.java
- stackusingarray.java
- stackusingtwoqueue.java
- stackwithmiddleoperation.java
- summinmaxinawindow.java
- balanceparenthisis.java
- checkshuffle.java
- computercafeproblem.java
- countandsay.java
- countofnumberofstringinarray.java
- countpallindromicsubsequence.java
- countreversals.java
- duplicates.java
- editdistance.java
- immutability.java
- isomorphicstring.java
- knuthmorispratt.java
- LCS.java
- longestcommonprefix.java
- longestpallindromicsubsequence.java
- Longestrepeatingsubsequence.java
- longetspallindromicsubstring.java
- minflips.java
- mininsertionfrontpalindrome.java
- minswapsbracket.java
- pallindrome.java
- permutation.java
- printallsentences.java
- printanagrams.java
- printsubsequence.java
- rabbinkarp.java
- removeconsecutiveduplicates.java
- romantointeger.java
- rotationstrings.java
- searchstringin2dmatrix.java
- secondmostrepeatedword.java
- sentencetonumber.java
- smallestwindow2.java
- smallestwindowthatcontainallchar.java
- splitstring01.java
- transformonestrinhtoother.java
- validIP.java
- wildcardcharactersstringmatching.java
- wordbreak.java
- wordwrap.java
- rangeProductQueries.java
- 14_merge_intervals.py
- 15_next_permutation.py
- 16_count_incersion.py
- 17_best_time_to_buy_and_sell_stock.py
- 18_pair_with_sum.py
- 1_array_reverse.py
- 21_subarray_with_sum0.py
- 23_maximum_product_subarray.py
- 24_longest_consecutive_subsequence.py
- 27_subset_of_another_array.py
- 30_Chocolate_Distribution_problem.py
- 31_smallest_subarray_with_sum_greater_x.py
- 32_three_way_partioning.py
- 33_min_swaps_less_than_k.py
- 34_plaindrome_array.py
- 35_median.py
- 36_positiveNegative.py
- array_union_intersection.py
- cyclic_rotate.py
- factorial.py
- Kadane_algo.py
- kth_min_max_elements.py
- largest_subarray_sum.py
- merge_array_inplace.py
- merge_intervals.py
- min_max_elements_array.py
- move_negatives.py
- reverse_array.py
- second_max_element.py
- sort_array.py
- Triple_sum.py
- 2_search_2d_matrix.py
- 4_row_with_max_1.py
- 5_sort_matrix.py
- 6_maximum_size_rectangle.py
- 11_permutations_of_given_string.py
- 12_split_into_two_substring_binary.py
- 13_word_wrap.py
- 15_find_next_greater_number.py
- 16_balanced_paranthesis.py
- 17_word_break.py
- 26_convert_roman_to_decimal.py
- 76_ConvertSentenceToNumericKeypad.py
- 7_count_and_say.py
- count_frequency_characters.py
- duplicates.py
- Palindrome_or_not.py
- pallindromeString.py
- Reverse_a_string.py
- second_most_repeated_string.py
- readme.md
- Factorial.py
- kthGrammer.cpp
- lookAndSay.cpp
- Nth_Fibonacci_Number.java
- oneToN.cpp
- Recursive Java palindrome program
- removeConsecutiveDuplicates.cpp
- reverseStack.cpp
- sortAnArray.cpp
- sortAStack.cpp
- subsequenceOfString.cpp
- towerOfHanoi.cpp
- .classpath
- .gitignore
- .project
- LICENSE
- README.md
// repository documentation
Was this content helpful?
(0 ratings)