├── .DS_Store ├── JAVA_DSA ├── .DS_Store ├── .vscode │ └── settings.json ├── README.md ├── bin │ ├── .DS_Store │ ├── App.class │ ├── arrays │ │ ├── .DS_Store │ │ ├── BoatsToSavePeople.class │ │ ├── BrickWall.class │ │ ├── CanPlaceFlowers.class │ │ ├── ContainerWithMostWater.class │ │ ├── CountInversions.class │ │ ├── DuplicateNumber.class │ │ ├── EqualRowAndColumnPair.class │ │ ├── FindMissingAndRepeating.class │ │ ├── FourSum.class │ │ ├── FruitIntoBaskets.class │ │ ├── HouseRobber.class │ │ ├── InterchangableRect.class │ │ ├── IntersectionOfArrays.class │ │ ├── KadaneAlgo.class │ │ ├── LongestSub1AfterDeleting.class │ │ ├── MajorityElement.class │ │ ├── MatrixDiagonalSum.class │ │ ├── MaxAndMinInArray.class │ │ ├── MaxNumberKSumPair.class │ │ ├── MaximumSubarray.class │ │ ├── MaximumSumCircularSubarray.class │ │ ├── MergeIntervals.class │ │ ├── MergeTwoSortedArray.class │ │ ├── NegativeNumbersToBeg.class │ │ ├── Node.class │ │ ├── PrintAllSubarrayWith0Sum.class │ │ ├── ProductOfArrayExceptSelf.class │ │ ├── PushDominoes.class │ │ ├── ReduceXToZero.class │ │ ├── RemoveOverlapping.class │ │ ├── ReverseString.class │ │ ├── RotateArray.class │ │ ├── SlidingWindowMaximum.class │ │ ├── Sort012SortColors.class │ │ ├── SpiralMatrix.class │ │ ├── SpiralMatrix2.class │ │ ├── SubSatifyCondition.class │ │ ├── SubStringWithoutRepeating.class │ │ ├── ThreeSum.class │ │ ├── ThreeSumClosest.class │ │ ├── ThresholdAvgSub.class │ │ ├── myMap.class │ │ ├── myPair.class │ │ ├── pair.class │ │ └── twoSum.class │ ├── backtracking │ │ ├── .DS_Store │ │ ├── AdditiveNumber.class │ │ ├── Combinations.class │ │ ├── KEqualSumSubsets.class │ │ ├── MatchSticksSquare.class │ │ ├── MaxTransferRequests.class │ │ ├── NQueens.class │ │ ├── PalindromePartitioning.class │ │ ├── Permutations.class │ │ ├── Permutations2.class │ │ ├── RatInAMaze.class │ │ ├── RestoreIpAddress.class │ │ ├── SplittingAString.class │ │ ├── Subsets.class │ │ ├── Subsets2.class │ │ ├── TrieNode.class │ │ ├── UniquePaths.class │ │ ├── UniquePaths2.class │ │ ├── WordSearch.class │ │ └── WordSearch2.class │ ├── binarySearch │ │ ├── .DS_Store │ │ ├── AllocateMinimumNumberOfPages.class │ │ ├── ArriveOnTimeOffice.class │ │ ├── BinarySearch.class │ │ ├── BitonicPoint.class │ │ ├── CapacityToShipPackages.class │ │ ├── CeilOfAnElement.class │ │ ├── CountOfAnElementInASortedArray.class │ │ ├── FindInBitonicArray.class │ │ ├── FindPeakElement.class │ │ ├── FindPeakElementcopy.class │ │ ├── FirstAndLastElementInASortedArray.class │ │ ├── FirstAndLastPosition.class │ │ ├── FloorOfAnElement.class │ │ ├── IndexofFirstOneInInfinite.class │ │ ├── KokoEatingBananas.class │ │ ├── MagneticForceBetweenTwoBalls.class │ │ ├── MaxConfusion.class │ │ ├── MaxRibbonCut.class │ │ ├── MaximumAtAIndex.class │ │ ├── MaximumCandiesAllocatedToKChildren.class │ │ ├── MinimizeMaximumDiffPairs.class │ │ ├── MinimizedMaximumOfProducts.class │ │ ├── MinimumDifferenceElement.class │ │ ├── MinimumInRotatedSortedArray.class │ │ ├── MinimumLimitBallsInBag.class │ │ ├── NegativeNumbersInSortedMatrix.class │ │ ├── PeakIndexInMountainArray.class │ │ ├── PositionInInfinite.class │ │ ├── RowWiseAndColumnWiseSorted.class │ │ ├── Search2dMatrix2.class │ │ ├── SearchA2DMatrix.class │ │ ├── SearchA2dSortedMatrix.class │ │ ├── SearchInARoatedSortedArray.class │ │ ├── SearchInAlmostSortedArray.class │ │ ├── SearchInRevereseSortedArray.class │ │ ├── SearchInRotatedSorted2.class │ │ ├── SearchInsertPosition.class │ │ ├── SmallestLetterGreaterThanTarget.class │ │ ├── SplitArrayLargestSum.class │ │ ├── SquareRoot.class │ │ ├── findAnElementInRotatedSortedArray.class │ │ ├── lc81helper.class │ │ └── peakElement2.class │ ├── bitManipulation │ │ ├── .DS_Store │ │ ├── CanIWin.class │ │ ├── LongestAwesomeSubstring.class │ │ ├── SortByParity.class │ │ └── VowelEven.class │ ├── dynamicProgramming │ │ ├── .DS_Store │ │ ├── ASCIIDeleteSum.class │ │ ├── BestTeamWithNoConflicts.class │ │ ├── BestTimeToBuyAndSellStock.class │ │ ├── BooleanParenthesization.class │ │ ├── BuildArrayExactlyK.class │ │ ├── BurstBallons.class │ │ ├── BuyAndSellStock2.class │ │ ├── BuyAndSellWithFee.class │ │ ├── ChampagneTower.class │ │ ├── ClimbingStairs.class │ │ ├── CodingNinjasPartitionsWithGivenDifference.class │ │ ├── CoinChange1.class │ │ ├── CoinChange2.class │ │ ├── CombinationSum.class │ │ ├── CombinationSumIV.class │ │ ├── ConcatenatedWords.class │ │ ├── CountOfSubsetWithSum.class │ │ ├── DecodeWays.class │ │ ├── DeleteAndEarn.class │ │ ├── EditDistance.class │ │ ├── ExtraCharactersInString.class │ │ ├── FairDistributionOfCookies.class │ │ ├── FrogJump.class │ │ ├── HouseRobber2.class │ │ ├── InterleavingString.class │ │ ├── Job.class │ │ ├── JumpGame2.class │ │ ├── JumpGame6.class │ │ ├── KnapSack01.class │ │ ├── KnightProbability.class │ │ ├── LIS.class │ │ ├── LargestPlusSign.class │ │ ├── LargestVarianceSubstring.class │ │ ├── LongestCommonSubstring.class │ │ ├── LongestPalindromicSubSeq.class │ │ ├── LongestPalindromicSubstring.class │ │ ├── LongestRepeatingSubsequence.class │ │ ├── MatrixChainMultiplication.class │ │ ├── MaxEventAttend2.class │ │ ├── MaximumProfitInJob.class │ │ ├── MinCostClimbingStairs.class │ │ ├── MinimumCostToCutAStick.class │ │ ├── MinimumDeletion.class │ │ ├── MinimumInsertionPalindrome.class │ │ ├── MinimumSubsetSum.class │ │ ├── New21Game.class │ │ ├── NumberOfLis.class │ │ ├── NumberOfSubsetWithGivenDifference.class │ │ ├── OptimizedPalindromePartition.class │ │ ├── PalindromicPartitioning2.class │ │ ├── PalindromicPartitioning4.class │ │ ├── PalindromicSubstrings.class │ │ ├── PartitionEqualSubsetSum.class │ │ ├── PascalTriangle.class │ │ ├── PrintLCS.class │ │ ├── RegularExpressionMatching.class │ │ ├── RemoveBoxes.class │ │ ├── RodCuttingGFG.class │ │ ├── RussianDollEnvelopes.class │ │ ├── SCS.class │ │ ├── SetMatrixZeroes.class │ │ ├── StackingCuboids$1.class │ │ ├── StackingCuboids.class │ │ ├── StoneGame1.class │ │ ├── StoneGame3.class │ │ ├── StrangePrinter.class │ │ ├── SubsetSumProblem.class │ │ ├── SuoerEggDrop.class │ │ ├── SuperUglyNumber.class │ │ ├── TargetSum.class │ │ ├── Triangle.class │ │ ├── TriangulationOfPolygon.class │ │ ├── TurbulentSubarray.class │ │ ├── UglyNumber.class │ │ ├── UglyNumber2.class │ │ ├── UnboundedKnapsack.class │ │ ├── WildcardMatching.class │ │ ├── WordBreak.class │ │ ├── WordBreak2.class │ │ ├── isSubSeq.class │ │ ├── st3.class │ │ └── stoneGame2.class │ ├── graphs │ │ ├── .DS_Store │ │ ├── AsFarFromLandFromPossible.class │ │ ├── CloneGraph.class │ │ ├── ColoringBorder.class │ │ ├── CountSubGraphs.class │ │ ├── FlowerPlanting.class │ │ ├── JumpGame3.class │ │ ├── LetterCombinationOfPhoneNumber.class │ │ ├── MaxAreaIsland.class │ │ ├── MaximalNetworkRank.class │ │ ├── MinTimeToCollectAllApples.class │ │ ├── Node.class │ │ ├── NumberOfIslands.class │ │ ├── ParallelCourses3.class │ │ ├── ReconstructItenary.class │ │ ├── RottingOranges.class │ │ ├── ShortestBridge.class │ │ ├── ShortestPathAllNodes.class │ │ ├── WaterAndJugProblem.class │ │ ├── pair.class │ │ └── restoreArrayFromAdjacent.class │ ├── greedy │ │ ├── .DS_Store │ │ ├── Candies.class │ │ ├── DIStringMatch.class │ │ ├── Dota2Senate.class │ │ ├── GasStation.class │ │ ├── GetTheMaximumScore.class │ │ ├── JumpGame.class │ │ ├── MinReplaceToSortArray.class │ │ ├── MinimumMovesToMakePalindrome.class │ │ ├── MinimumTimeToMakeRopeColourful.class │ │ ├── NmeetingsInoneRoom.class │ │ ├── NumberOfWeakCharacters.class │ │ ├── ShortestUnsorted.class │ │ ├── TaskScheduler.class │ │ ├── TaskSchedulerHelper.class │ │ ├── ValidPalindrome2.class │ │ └── pair.class │ ├── hashTable │ │ ├── .DS_Store │ │ ├── APSequenceGivenDiff.class │ │ ├── AllAnagrams.class │ │ ├── ArrayOfDoubledPair.class │ │ ├── BuddyStrings.class │ │ ├── CarPooling.class │ │ ├── ContinousSub.class │ │ ├── ContinousSubarraySum.class │ │ ├── DNASequence.class │ │ ├── DesignHashMap.class │ │ ├── DesignTwitter.class │ │ ├── DifferenceInTwoArrays.class │ │ ├── FindAllGoodIndices.class │ │ ├── FindAndReplacePattern.class │ │ ├── FlowersInFullBloom.class │ │ ├── GridGame.class │ │ ├── GroupAnagrams.class │ │ ├── GroupThePeople.class │ │ ├── IntegerToRoman.class │ │ ├── KClosestPointsToOrigin.class │ │ ├── KPairWithSmallestSum.class │ │ ├── KWeakestRows.class │ │ ├── MaxConsecOnes.class │ │ ├── MaxEventAttend.class │ │ ├── MinRoundsToCompleteTasks.class │ │ ├── MinimizeDeviationInArray.class │ │ ├── MyHashMap.class │ │ ├── RabbitsInForest.class │ │ ├── SetKConsec.class │ │ ├── SetMatrixZeroes.class │ │ ├── SubStringwithEqual012.class │ │ ├── SubarraySumDivisibleByk.class │ │ ├── SubarraySumEqualsK.class │ │ ├── SubarrayWithEqual01.class │ │ ├── TopKFreq.class │ │ ├── Twitter.class │ │ ├── User.class │ │ ├── lc373comp.class │ │ └── mpNode.class │ ├── heap │ │ └── SingleThreadedCpu.class │ ├── linkedList │ │ ├── .DS_Store │ │ ├── AddOneToLinkedList.class │ │ ├── AddTwoNumbers2.class │ │ ├── AddTwoNumbersLinkedList.class │ │ ├── BrowserHistory.class │ │ ├── CopyRandomPointer.class │ │ ├── DLLS.class │ │ ├── DeleteLoopInALinkedList.class │ │ ├── FlattenDoublyLinkedList.class │ │ ├── IntersectionLinkedList.class │ │ ├── IntersectionOfLinkedList.class │ │ ├── LLCycle2.class │ │ ├── LastElementToFirst.class │ │ ├── LinkedListCycle.class │ │ ├── ListNode.class │ │ ├── MaximumTwinSumOfLinkedList.class │ │ ├── MergeKLinkedList.class │ │ ├── MiddleOfLinkedList.class │ │ ├── Node.class │ │ ├── PartitionList.class │ │ ├── RemoveDuplicatesFromSortedList2.class │ │ ├── RemoveDuplicatesFromUnsorted.class │ │ ├── RemoveDuplicatesSorted.class │ │ ├── RemoveLinkedListElement.class │ │ ├── ReverseLinkedList.class │ │ ├── ReverseLinkedList2.class │ │ ├── ReverseNodesInKGroup.class │ │ ├── SwapNodesInPairs.class │ │ ├── help.class │ │ ├── lc430Helper.class │ │ └── lc86helper.class │ ├── math │ │ ├── .DS_Store │ │ ├── BeautifulArrangment2.class │ │ ├── CheckIfStraightLine.class │ │ ├── ExcelSheetCol.class │ │ ├── GCD.class │ │ ├── NoOfZeroFilledSubarrays.class │ │ ├── ReverseInteger.class │ │ ├── SignOfTheProduct.class │ │ └── ValidPickupAndDelivery.class │ ├── stackAndQueue │ │ ├── .DS_Store │ │ ├── AsteroidCollision.class │ │ ├── CarFleet.class │ │ ├── CarFleet2.class │ │ ├── CheckIfValidAfterSub.class │ │ ├── CustomStack.class │ │ ├── DailyTemprature.class │ │ ├── DecodeString.class │ │ ├── LongestValidParentheses.class │ │ ├── MaxWidthRamp.class │ │ ├── MinDeletionsArrayBeautiful.class │ │ ├── MinStack.class │ │ ├── MyStack.class │ │ ├── NextGreaterElement1.class │ │ ├── NextGreaterElement2.class │ │ ├── SimplifyPath.class │ │ ├── SpanNode.class │ │ ├── StackUsingQueues.class │ │ ├── StackWithIncrementOperation.class │ │ ├── StockSpanner.class │ │ ├── SumOfSubarrayMin.class │ │ ├── SwapToMakeBalanced.class │ │ ├── ValidParentheses.class │ │ ├── ValidateStackSequences.class │ │ ├── lc32Helper.class │ │ └── stackNode.class │ ├── strings │ │ ├── .DS_Store │ │ ├── CountAndSay.class │ │ ├── DecodeStringAtIndex.class │ │ ├── EncodeAndDecodeTinyUrl.class │ │ ├── Length3PalSubSeq.class │ │ ├── MergeStringsAlternately.class │ │ ├── NamingACompany.class │ │ ├── RemoveAllAdjacent.class │ │ ├── RemoveColouredPieces.class │ │ ├── RemoveDuplicateLetters.class │ │ ├── ReorganizeString.class │ │ ├── ReverseString3.class │ │ ├── StringCompression.class │ │ ├── StringToInteger.class │ │ └── lc1047.class │ └── trees │ │ ├── .DS_Store │ │ ├── AllPossibleFullBinaryTree.class │ │ ├── BSATtoGST.class │ │ ├── BinaryTreeCameras.class │ │ ├── BottomLeft.class │ │ ├── BoundryTraversal.class │ │ ├── Codec.class │ │ ├── ColoringGame.class │ │ ├── ConstructFromInorderPostorder.class │ │ ├── ConstructFromInorderPreorder.class │ │ ├── DeepestLeavesSum.class │ │ ├── DeleteInBst.class │ │ ├── DiagonalTraversal.class │ │ ├── DiameterOfBinaryTree.class │ │ ├── DistributeCoinsInBinaryTree.class │ │ ├── FlipEqui.class │ │ ├── GoodNodes.class │ │ ├── HouseRobber3.class │ │ ├── InorderTraversal.class │ │ ├── LCA.class │ │ ├── LCAOfNormalBinaryTree.class │ │ ├── LeftView.class │ │ ├── LevelOrder.class │ │ ├── LongestZigZagPath.class │ │ ├── MaximumPathSum.class │ │ ├── MaximumProductOfSplittedBinaryTree.class │ │ ├── MaximumWidthOfBinaryTree.class │ │ ├── MinimumDepth.class │ │ ├── MorrisTraversal.class │ │ ├── Node.class │ │ ├── NodesAtDistanceK.class │ │ ├── NodesInCBT.class │ │ ├── PathSum.class │ │ ├── PathSum2.class │ │ ├── PathSum3.class │ │ ├── PostOrder.class │ │ ├── PreorderTraversal.class │ │ ├── RecoverBST.class │ │ ├── ReverseLevelOrder.class │ │ ├── RightSideView.class │ │ ├── SeralizeAndDesBst.class │ │ ├── SortedArrayBst.class │ │ ├── SymmetricTree.class │ │ ├── TraversalsIterative.class │ │ ├── TreeNode.class │ │ ├── UniqueBst.class │ │ ├── ValidateBinaryTreeNodes.class │ │ ├── ValidateBst.class │ │ ├── ZigZagLevelOrderTraversal.class │ │ ├── customPair.class │ │ ├── customTree.class │ │ ├── helper.class │ │ ├── helper2.class │ │ ├── helper3.class │ │ ├── lc337.class │ │ ├── maxPathSumHelper.class │ │ ├── populatingNextRightPointer.class │ │ └── populatingNextRightPointer2.class └── src │ ├── .DS_Store │ ├── App.java │ ├── arrays │ ├── .DS_Store │ ├── ArrayPairsDivisibleK.java │ ├── BoatsToSavePeople.java │ ├── BrickWall.java │ ├── CanPlaceFlowers.java │ ├── ContainerWithMostWater.java │ ├── CountInversions.java │ ├── DividePlayersIntoTeamsOfEqualSkill.java │ ├── DuplicateNumber.java │ ├── EqualRowAndColumnPair.java │ ├── FindMissingAndRepeating.java │ ├── FourSum.java │ ├── FruitIntoBaskets.java │ ├── HouseRobber.java │ ├── InterchangableRect.java │ ├── IntersectionOfArrays.java │ ├── KadaneAlgo.java │ ├── LongestSub1AfterDeleting.java │ ├── MajorityElement.java │ ├── MatrixDiagonalSum.java │ ├── MaxAndMinInArray.java │ ├── MaxNumberKSumPair.java │ ├── MaximumSubarray.java │ ├── MaximumSumCircularSubarray.java │ ├── MergeIntervals.java │ ├── MergeTwoSortedArray.java │ ├── NegativeNumbersToBeg.java │ ├── PrintAllSubarrayWith0Sum.java │ ├── ProductOfArrayExceptSelf.java │ ├── PushDominoes.java │ ├── ReduceXToZero.java │ ├── RemoveOverlapping.java │ ├── ReverseString.java │ ├── RotateArray.java │ ├── SlidingWindowMaximum.java │ ├── Sort012SortColors.java │ ├── SpiralMatrix.java │ ├── SpiralMatrix2.java │ ├── SubSatifyCondition.java │ ├── SubStringWithoutRepeating.java │ ├── ThreeSum.java │ ├── ThreeSumClosest.java │ ├── ThresholdAvgSub.java │ └── twoSum.java │ ├── backtracking │ ├── .DS_Store │ ├── AdditiveNumber.java │ ├── Combinations.java │ ├── KEqualSumSubsets.java │ ├── MatchSticksSquare.java │ ├── MaxTransferRequests.java │ ├── NQueens.java │ ├── PalindromePartitioning.java │ ├── Permutations.java │ ├── Permutations2.java │ ├── RatInAMaze.java │ ├── RestoreIpAddress.java │ ├── SplittingAString.java │ ├── Subsets.java │ ├── Subsets2.java │ ├── UniquePaths.java │ ├── UniquePaths2.java │ ├── WordSearch.java │ └── WordSearch2.java │ ├── binarySearch │ ├── .DS_Store │ ├── AllocateMinimumNumberOfPages.java │ ├── ArriveOnTimeOffice.java │ ├── BinarySearch.java │ ├── BitonicPoint.java │ ├── CapacityToShipPackages.java │ ├── CeilOfAnElement.java │ ├── CountOfAnElementInASortedArray.java │ ├── FindInBitonicArray.java │ ├── FindInMountainArray.java │ ├── FindPeakElement.java │ ├── FindPeakElementcopy.java │ ├── FirstAndLastElementInASortedArray.java │ ├── FirstAndLastPosition.java │ ├── FloorOfAnElement.java │ ├── IndexofFirstOneInInfinite.java │ ├── KokoEatingBananas.java │ ├── MagneticForceBetweenTwoBalls.java │ ├── MaxConfusion.java │ ├── MaxRibbonCut.java │ ├── MaximumAtAIndex.java │ ├── MaximumCandiesAllocatedToKChildren.java │ ├── MinimizeMaximumDiffPairs.java │ ├── MinimizedMaximumOfProducts.java │ ├── MinimumDifferenceElement.java │ ├── MinimumInRotatedSortedArray.java │ ├── MinimumLimitBallsInBag.java │ ├── MinimumLimitOfBallsInABag.java │ ├── NegativeNumbersInSortedMatrix.java │ ├── PeakIndexInMountainArray.java │ ├── PositionInInfinite.java │ ├── RowWiseAndColumnWiseSorted.java │ ├── Search2dMatrix2.java │ ├── SearchA2DMatrix.java │ ├── SearchA2dSortedMatrix.java │ ├── SearchInARoatedSortedArray.java │ ├── SearchInAlmostSortedArray.java │ ├── SearchInRevereseSortedArray.java │ ├── SearchInRotatedSorted2.java │ ├── SearchInsertPosition.java │ ├── SmallestLetterGreaterThanTarget.java │ ├── SplitArrayLargestSum.java │ ├── SquareRoot.java │ ├── findAnElementInRotatedSortedArray.java │ └── peakElement2.java │ ├── bitManipulation │ ├── .DS_Store │ ├── CanIWin.java │ ├── LongestAwesomeSubstring.java │ ├── SortByParity.java │ └── VowelEven.java │ ├── dynamicProgramming │ ├── .DS_Store │ ├── ASCIIDeleteSum.java │ ├── BestTeamWithNoConflicts.java │ ├── BestTimeToBuyAndSellStock.java │ ├── BooleanParenthesization.java │ ├── BuildArrayExactlyK.java │ ├── BurstBallons.java │ ├── BuyAndSellStock2.java │ ├── BuyAndSellWithFee.java │ ├── ChampagneTower.java │ ├── ClimbingStairs.java │ ├── CodingNinjasPartitionsWithGivenDifference.java │ ├── CoinChange1.java │ ├── CoinChange2.java │ ├── CombinationSum.java │ ├── CombinationSumIV.java │ ├── ConcatenatedWords.java │ ├── CountOfSubsetWithSum.java │ ├── DecodeWays.java │ ├── DeleteAndEarn.java │ ├── EditDistance.java │ ├── ExtraCharactersInString.java │ ├── FairDistributionOfCookies.java │ ├── FrogJump.java │ ├── HouseRobber2.java │ ├── InterleavingString.java │ ├── JumpGame2.java │ ├── JumpGame6.java │ ├── KnapSack01.java │ ├── KnightProbability.java │ ├── LIS.java │ ├── LargestPlusSign.java │ ├── LargestVarianceSubstring.java │ ├── LongestCommonSubstring.java │ ├── LongestPalindromicSubSeq.java │ ├── LongestPalindromicSubstring.java │ ├── LongestRepeatingSubsequence.java │ ├── MatrixChainMultiplication.java │ ├── MaxEventAttend2.java │ ├── MaximumProfitInJob.java │ ├── MinCostClimbingStairs.java │ ├── MinimumCostToCutAStick.java │ ├── MinimumDeletion.java │ ├── MinimumInsertionPalindrome.java │ ├── MinimumSubsetSum.java │ ├── New21Game.java │ ├── NumberOfLis.java │ ├── NumberOfSubsetWithGivenDifference.java │ ├── OptimizedPalindromePartition.java │ ├── PalindromicPartitioning2.java │ ├── PalindromicPartitioning4.java │ ├── PalindromicSubstrings.java │ ├── PartitionEqualSubsetSum.java │ ├── PascalTriangle.java │ ├── PrintLCS.java │ ├── RegularExpressionMatching.java │ ├── RemoveBoxes.java │ ├── RodCuttingGFG.java │ ├── RussianDollEnvelopes.java │ ├── SCS.java │ ├── SetMatrixZeroes.java │ ├── StackingCuboids.java │ ├── StoneGame1.java │ ├── StoneGame3.java │ ├── StrangePrinter.java │ ├── SubsetSumProblem.java │ ├── SuoerEggDrop.java │ ├── SuperUglyNumber.java │ ├── TargetSum.java │ ├── Triangle.java │ ├── TriangulationOfPolygon.java │ ├── TurbulentSubarray.java │ ├── UglyNumber.java │ ├── UglyNumber2.java │ ├── UnboundedKnapsack.java │ ├── WildcardMatching.java │ ├── WordBreak.java │ ├── WordBreak2.java │ ├── isSubSeq.java │ └── stoneGame2.java │ ├── graphs │ ├── .DS_Store │ ├── AsFarFromLandFromPossible.java │ ├── CloneGraph.java │ ├── ColoringBorder.java │ ├── CountSubGraphs.java │ ├── FlowerPlanting.java │ ├── JumpGame3.java │ ├── LetterCombinationOfPhoneNumber.java │ ├── MaxAreaIsland.java │ ├── MaximalNetworkRank.java │ ├── MinTimeToCollectAllApples.java │ ├── NumberOfIslands.java │ ├── ParallelCourses3.java │ ├── ReconstructItenary.java │ ├── RottingOranges.java │ ├── ShortestBridge.java │ ├── ShortestPathAllNodes.java │ ├── WaterAndJugProblem.java │ └── restoreArrayFromAdjacent.java │ ├── greedy │ ├── .DS_Store │ ├── Candies.java │ ├── DIStringMatch.java │ ├── Dota2Senate.java │ ├── GasStation.java │ ├── GetTheMaximumScore.java │ ├── JumpGame.java │ ├── MinReplaceToSortArray.java │ ├── MinimumMovesToMakePalindrome.java │ ├── MinimumTimeToMakeRopeColourful.java │ ├── NmeetingsInoneRoom.java │ ├── NumberOfWeakCharacters.java │ ├── ShortestUnsorted.java │ ├── TaskScheduler.java │ └── ValidPalindrome2.java │ ├── hashTable │ ├── .DS_Store │ ├── APSequenceGivenDiff.java │ ├── AllAnagrams.java │ ├── ArrayOfDoubledPair.java │ ├── BuddyStrings.java │ ├── CarPooling.java │ ├── ContinousSub.java │ ├── ContinousSubarraySum.java │ ├── DNASequence.java │ ├── DesignHashMap.java │ ├── DesignTwitter.java │ ├── DifferenceInTwoArrays.java │ ├── FindAllGoodIndices.java │ ├── FindAndReplacePattern.java │ ├── FlowersInFullBloom.java │ ├── GridGame.java │ ├── GroupAnagrams.java │ ├── GroupThePeople.java │ ├── IntegerToRoman.java │ ├── KClosestPointsToOrigin.java │ ├── KPairWithSmallestSum.java │ ├── KWeakestRows.java │ ├── MaxConsecOnes.java │ ├── MaxEventAttend.java │ ├── MinRoundsToCompleteTasks.java │ ├── MinimizeDeviationInArray.java │ ├── PermutationInString.java │ ├── RabbitsInForest.java │ ├── SetKConsec.java │ ├── SetMatrixZeroes.java │ ├── SubStringwithEqual012.java │ ├── SubarraySumDivisibleByk.java │ ├── SubarraySumEqualsK.java │ ├── SubarrayWithEqual01.java │ └── TopKFreq.java │ ├── heap │ └── SingleThreadedCpu.java │ ├── linkedList │ ├── .DS_Store │ ├── AddOneToLinkedList.java │ ├── AddTwoNumbers2.java │ ├── AddTwoNumbersLinkedList.java │ ├── BrowserHistory.java │ ├── CopyRandomPointer.java │ ├── DeleteLoopInALinkedList.java │ ├── FlattenDoublyLinkedList.java │ ├── IntersectionLinkedList.java │ ├── IntersectionOfLinkedList.java │ ├── LLCycle2.java │ ├── LastElementToFirst.java │ ├── LinkedListCycle.java │ ├── MaximumTwinSumOfLinkedList.java │ ├── MergeKLinkedList.java │ ├── MiddleOfLinkedList.java │ ├── MyCircularDeque.java │ ├── PartitionList.java │ ├── RemoveDuplicatesFromSortedList2.java │ ├── RemoveDuplicatesFromUnsorted.java │ ├── RemoveDuplicatesSorted.java │ ├── RemoveLinkedListElement.java │ ├── ReverseLinkedList.java │ ├── ReverseLinkedList2.java │ ├── ReverseNodesInKGroup.java │ ├── SwapNodesInPairs.java │ └── removeNthNode.java │ ├── math │ ├── .DS_Store │ ├── BeautifulArrangment2.java │ ├── CheckIfStraightLine.java │ ├── ExcelSheetCol.java │ ├── GCD.java │ ├── NoOfZeroFilledSubarrays.java │ ├── ReverseInteger.java │ ├── SignOfTheProduct.java │ └── ValidPickupAndDelivery.java │ ├── stackAndQueue │ ├── .DS_Store │ ├── AsteroidCollision.java │ ├── CarFleet.java │ ├── CarFleet2.java │ ├── CheckIfValidAfterSub.java │ ├── DailyTemprature.java │ ├── DecodeString.java │ ├── LongestValidParentheses.java │ ├── MaxWidthRamp.java │ ├── MinDeletionsArrayBeautiful.java │ ├── MinStack.java │ ├── NextGreaterElement1.java │ ├── NextGreaterElement2.java │ ├── SimplifyPath.java │ ├── StackUsingQueues.java │ ├── StackWithIncrementOperation.java │ ├── StockSpanner.java │ ├── SumOfSubarrayMin.java │ ├── SwapToMakeBalanced.java │ ├── ValidParentheses.java │ └── ValidateStackSequences.java │ ├── strings │ ├── .DS_Store │ ├── CountAndSay.java │ ├── DecodeStringAtIndex.java │ ├── EncodeAndDecodeTinyUrl.java │ ├── Length3PalSubSeq.java │ ├── MergeStringsAlternately.java │ ├── NamingACompany.java │ ├── RemoveAllAdjacent.java │ ├── RemoveColouredPieces.java │ ├── RemoveDuplicateLetters.java │ ├── ReorganizeString.java │ ├── ReverseString3.java │ ├── StringCompression.java │ └── StringToInteger.java │ └── trees │ ├── .DS_Store │ ├── AllPossibleFullBinaryTree.java │ ├── BSATtoGST.java │ ├── BinaryTreeCameras.java │ ├── BottomLeft.java │ ├── BoundryTraversal.java │ ├── ColoringGame.java │ ├── ConstructFromInorderPostorder.java │ ├── ConstructFromInorderPreorder.java │ ├── DeepestLeavesSum.java │ ├── DeleteInBst.java │ ├── DiagonalTraversal.java │ ├── DiameterOfBinaryTree.java │ ├── DistributeCoinsInBinaryTree.java │ ├── FlipEqui.java │ ├── GoodNodes.java │ ├── HouseRobber3.java │ ├── InorderTraversal.java │ ├── LCA.java │ ├── LCAOfNormalBinaryTree.java │ ├── LeftView.java │ ├── LevelOrder.java │ ├── LongestZigZagPath.java │ ├── MaximumPathSum.java │ ├── MaximumProductOfSplittedBinaryTree.java │ ├── MaximumWidthOfBinaryTree.java │ ├── MinimumDepth.java │ ├── MorrisTraversal.java │ ├── NodesAtDistanceK.java │ ├── NodesInCBT.java │ ├── PathSum.java │ ├── PathSum2.java │ ├── PathSum3.java │ ├── PostOrder.java │ ├── PreorderTraversal.java │ ├── RecoverBST.java │ ├── ReverseLevelOrder.java │ ├── RightSideView.java │ ├── SeralizeAndDesBst.java │ ├── SortedArrayBst.java │ ├── SymmetricTree.java │ ├── TraversalsIterative.java │ ├── UniqueBst.java │ ├── UniqueBst2.java │ ├── ValidateBinaryTreeNodes.java │ ├── ValidateBst.java │ ├── ZigZagLevelOrderTraversal.java │ ├── populatingNextRightPointer.java │ └── populatingNextRightPointer2.java ├── javascript-dsa ├── .DS_Store ├── adityaVermaBinarySearch │ └── .DS_Store ├── arrays │ ├── .DS_Store │ ├── 2966.js │ ├── AllDuplicatesInArray.js │ ├── AntFallOut.js │ ├── ArrowBurstBallons.js │ ├── BagOfTokens.js │ ├── CinemaSeatAllocation.js │ ├── CountNicePairsInArray.js │ ├── DiagnolTraversal.js │ ├── DivideLongCorridor.js │ ├── DuplicatesFromSortedArray.js │ ├── FirstMissingPositive.js │ ├── FreqMostFreq.js │ ├── IntervalListIntersections.js │ ├── MaxCoinsYouCanGet.js │ ├── MaximumScoreGoodSub.js │ ├── MinimizeMaxPairSum.js │ ├── ProductLessThanK.js │ ├── ReductionOperations.js │ ├── RemovedCoveredIntervals.js │ ├── RevealCardsInIncreasingOrder.js │ ├── RotateImage.js │ ├── SubMaxAtleastKTimes.js │ ├── SubarrayKDifferentIntegers.js │ ├── SumOfAbsoluteDiff.js │ ├── WinnerOfArrayGame.js │ └── powerKSizeSubarrays.ts ├── backtracking │ ├── .DS_Store │ ├── ConcatStringUnique.js │ ├── MaximumScoreFormedByLetters.js │ └── NumberOfBeautifulSubsets.js ├── binarySearch │ └── .DS_Store ├── bitManipulation │ ├── .DS_Store │ ├── BitwiseAndNumberRange.js │ ├── HammingDistance.js │ ├── MinimizeXOR.js │ ├── NumberOf1Bits.js │ ├── PowerOfFour.js │ └── PrefixArrayOriginalXOR.js ├── dfs │ └── NestedListIterator.js ├── dynamicProgramming │ ├── .DS_Store │ ├── ArithmeticSlices.js │ ├── DiceRollsWithTargetSum.js │ ├── FlipStringMonotonic.js │ ├── FreedomTrail.js │ ├── KnightDialer.js │ ├── LongestArithmeticSub.js │ ├── MinimumFailingPathSum.js │ ├── OnesAndZeroes.js │ ├── PartitionArrayMaxSum.js │ ├── PerfectSquares.js │ ├── RangeSumQueryImutable2D.js │ ├── StayInSamePlace.js │ ├── StickersToSpellWord.js │ ├── StudentAttendanceRecord.js │ ├── SubMatAllOnes.js │ ├── UncrossedLines.js │ └── VideoStitch.js ├── graphs │ ├── .DS_Store │ ├── CourseSchedule4.js │ ├── EvaluateDivision.js │ ├── GroupsOfFarmlands.js │ ├── MinimumHeightTrees.js │ ├── NumberOfClosedIslands.js │ ├── OpenTheLock.js │ ├── OutOfBoundryPaths.js │ └── ZeroAndOnesLosses.js ├── greedy │ ├── .DS_Store │ ├── EliminateMaxMonsters.js │ ├── InsertInterval.js │ └── TwoCityScheduling.js ├── hashMapAndHeap │ ├── .DS_Store │ ├── ConvertTo2D.js │ ├── InsertDeleteGetRand.js │ ├── MakeStringAnagram.js │ ├── SeatReservationManager.js │ └── SortChByFreq.js ├── linkedList │ ├── .DS_Store │ ├── MergeInBetween.js │ └── ZeroSumConsec.js ├── math │ ├── .DS_Store │ ├── LaserBeamsInABank.js │ └── SequentialDigits.js ├── searchingAndSorting │ └── .DS_Store ├── stack │ ├── .DS_Store │ ├── 1438.js │ ├── BSTIterator.js │ ├── BuildAnArray.js │ ├── CheckIfValidPar.js │ ├── ReversePolishNotation.js │ └── ValidParentString.js ├── strings │ ├── .DS_Store │ ├── AdditionMakeValidString.js │ ├── BasicCalculator.js │ ├── ChangesAlternateBinary.js │ ├── CheckIfTwoStrings.js │ ├── CompareVersionNumbers.js │ ├── DeletingSimilarEnds.js │ ├── NonOverlappingPalindromSub.js │ ├── OptimalPartitionString.js │ ├── SortVowelsInAString.js │ ├── StringHalvesAlike.js │ ├── StringsAreClose.js │ ├── SubstringsWithinBudget.js │ ├── ThreeSameDigit.js │ └── ZigZagConversion.js ├── trees │ ├── .DS_Store │ ├── AddOneRow.js │ ├── BalanceBST.js │ ├── BinaryTreeInfected.js │ ├── ConstructString.js │ ├── DeleteLeavesWithGivenValue.js │ ├── DiffBetNodeAces.js │ ├── LargestValueInEachRow.js │ ├── LeafSimilarTrees.js │ ├── ModeInTree.js │ ├── NodeEqualAverageOfSubtree.js │ ├── PseudoPalPaths.js │ ├── SmallestString.js │ ├── SumRootToLeafNo.js │ └── TreeWithFactor.js └── trie │ └── ImplementTrie.js ├── python-dsa ├── arrays │ └── checkIfParenthisisCanBeValid.py ├── backtracking │ ├── permutations.py │ └── permutations2.py ├── binary-trees │ ├── largestValueInRow.py │ ├── lca.py │ ├── reverseOddLevels.py │ └── traversals.py ├── bit-manipulation │ └── MinimizeXOR.py ├── dynamic-programming │ └── targetSum.py ├── graphs │ ├── numberOfProvinces.py │ └── rottingoranges.py ├── hashMap │ └── pairEqualSumPair.py ├── lists │ └── continousSubarrays.py ├── priority-queue │ ├── KMultiplicationOperations.py │ ├── exceedThresholdValue2.py │ ├── maximumAveragePassRation.py │ └── sortKSortedArray.py ├── stacks │ ├── nge1.py │ ├── nge2.py │ ├── specialDiscountInShop.py │ └── trappingRainWater.py └── strings │ ├── constructStringRepeatLimit.py │ ├── letterTilePossibilities.py │ └── removeAllOccurencesOfASubstring.py └── typescript-dsa ├── javascript ├── binarySearch │ └── SplitArrayLargestSum.js ├── graphs │ └── SurroundedRegions.js └── hashtable │ ├── CheckIfN.js │ └── SpecialStiringThrice.js ├── tsconfig.json └── typescript ├── Graphs └── SurroundedRegions.ts ├── Hashtable ├── CheckIfN.ts └── SpecialStiringThrice.ts └── binarySearch └── SplitArrayLargestSum.ts /.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "java.project.sourcePaths": ["src"], 3 | "java.project.outputPath": "bin", 4 | "java.project.referencedLibraries": [ 5 | "lib/**/*.jar" 6 | ] 7 | } 8 | -------------------------------------------------------------------------------- /JAVA_DSA/README.md: -------------------------------------------------------------------------------- 1 | ## Getting Started 2 | 3 | Welcome to the VS Code Java world. Here is a guideline to help you get started to write Java code in Visual Studio Code. 4 | 5 | ## Folder Structure 6 | 7 | The workspace contains two folders by default, where: 8 | 9 | - `src`: the folder to maintain sources 10 | - `lib`: the folder to maintain dependencies 11 | 12 | Meanwhile, the compiled output files will be generated in the `bin` folder by default. 13 | 14 | > If you want to customize the folder structure, open `.vscode/settings.json` and update the related settings there. 15 | 16 | ## Dependency Management 17 | 18 | The `JAVA PROJECTS` view allows you to manage your dependencies. More details can be found [here](https://github.com/microsoft/vscode-java-dependency#manage-dependencies). 19 | -------------------------------------------------------------------------------- /JAVA_DSA/bin/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/App.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/App.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/BoatsToSavePeople.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/BoatsToSavePeople.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/BrickWall.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/BrickWall.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/CanPlaceFlowers.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/CanPlaceFlowers.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/ContainerWithMostWater.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/ContainerWithMostWater.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/CountInversions.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/CountInversions.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/DuplicateNumber.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/DuplicateNumber.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/EqualRowAndColumnPair.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/EqualRowAndColumnPair.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/FindMissingAndRepeating.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/FindMissingAndRepeating.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/FourSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/FourSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/FruitIntoBaskets.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/FruitIntoBaskets.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/HouseRobber.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/HouseRobber.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/InterchangableRect.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/InterchangableRect.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/IntersectionOfArrays.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/IntersectionOfArrays.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/KadaneAlgo.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/KadaneAlgo.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/LongestSub1AfterDeleting.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/LongestSub1AfterDeleting.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/MajorityElement.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/MajorityElement.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/MatrixDiagonalSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/MatrixDiagonalSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/MaxAndMinInArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/MaxAndMinInArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/MaxNumberKSumPair.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/MaxNumberKSumPair.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/MaximumSubarray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/MaximumSubarray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/MaximumSumCircularSubarray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/MaximumSumCircularSubarray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/MergeIntervals.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/MergeIntervals.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/MergeTwoSortedArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/MergeTwoSortedArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/NegativeNumbersToBeg.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/NegativeNumbersToBeg.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/Node.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/Node.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/PrintAllSubarrayWith0Sum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/PrintAllSubarrayWith0Sum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/ProductOfArrayExceptSelf.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/ProductOfArrayExceptSelf.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/PushDominoes.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/PushDominoes.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/ReduceXToZero.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/ReduceXToZero.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/RemoveOverlapping.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/RemoveOverlapping.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/ReverseString.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/ReverseString.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/RotateArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/RotateArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/SlidingWindowMaximum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/SlidingWindowMaximum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/Sort012SortColors.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/Sort012SortColors.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/SpiralMatrix.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/SpiralMatrix.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/SpiralMatrix2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/SpiralMatrix2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/SubSatifyCondition.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/SubSatifyCondition.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/SubStringWithoutRepeating.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/SubStringWithoutRepeating.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/ThreeSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/ThreeSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/ThreeSumClosest.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/ThreeSumClosest.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/ThresholdAvgSub.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/ThresholdAvgSub.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/myMap.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/myMap.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/myPair.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/myPair.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/pair.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/pair.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/arrays/twoSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/arrays/twoSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/AdditiveNumber.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/AdditiveNumber.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/Combinations.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/Combinations.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/KEqualSumSubsets.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/KEqualSumSubsets.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/MatchSticksSquare.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/MatchSticksSquare.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/MaxTransferRequests.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/MaxTransferRequests.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/NQueens.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/NQueens.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/PalindromePartitioning.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/PalindromePartitioning.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/Permutations.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/Permutations.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/Permutations2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/Permutations2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/RatInAMaze.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/RatInAMaze.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/RestoreIpAddress.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/RestoreIpAddress.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/SplittingAString.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/SplittingAString.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/Subsets.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/Subsets.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/Subsets2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/Subsets2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/TrieNode.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/TrieNode.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/UniquePaths.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/UniquePaths.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/UniquePaths2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/UniquePaths2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/WordSearch.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/WordSearch.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/backtracking/WordSearch2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/backtracking/WordSearch2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/AllocateMinimumNumberOfPages.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/AllocateMinimumNumberOfPages.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/ArriveOnTimeOffice.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/ArriveOnTimeOffice.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/BinarySearch.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/BinarySearch.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/BitonicPoint.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/BitonicPoint.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/CapacityToShipPackages.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/CapacityToShipPackages.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/CeilOfAnElement.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/CeilOfAnElement.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/CountOfAnElementInASortedArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/CountOfAnElementInASortedArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/FindInBitonicArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/FindInBitonicArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/FindPeakElement.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/FindPeakElement.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/FindPeakElementcopy.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/FindPeakElementcopy.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/FirstAndLastElementInASortedArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/FirstAndLastElementInASortedArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/FirstAndLastPosition.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/FirstAndLastPosition.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/FloorOfAnElement.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/FloorOfAnElement.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/IndexofFirstOneInInfinite.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/IndexofFirstOneInInfinite.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/KokoEatingBananas.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/KokoEatingBananas.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/MagneticForceBetweenTwoBalls.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/MagneticForceBetweenTwoBalls.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/MaxConfusion.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/MaxConfusion.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/MaxRibbonCut.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/MaxRibbonCut.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/MaximumAtAIndex.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/MaximumAtAIndex.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/MaximumCandiesAllocatedToKChildren.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/MaximumCandiesAllocatedToKChildren.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/MinimizeMaximumDiffPairs.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/MinimizeMaximumDiffPairs.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/MinimizedMaximumOfProducts.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/MinimizedMaximumOfProducts.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/MinimumDifferenceElement.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/MinimumDifferenceElement.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/MinimumInRotatedSortedArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/MinimumInRotatedSortedArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/MinimumLimitBallsInBag.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/MinimumLimitBallsInBag.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/NegativeNumbersInSortedMatrix.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/NegativeNumbersInSortedMatrix.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/PeakIndexInMountainArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/PeakIndexInMountainArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/PositionInInfinite.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/PositionInInfinite.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/RowWiseAndColumnWiseSorted.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/RowWiseAndColumnWiseSorted.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/Search2dMatrix2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/Search2dMatrix2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/SearchA2DMatrix.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/SearchA2DMatrix.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/SearchA2dSortedMatrix.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/SearchA2dSortedMatrix.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/SearchInARoatedSortedArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/SearchInARoatedSortedArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/SearchInAlmostSortedArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/SearchInAlmostSortedArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/SearchInRevereseSortedArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/SearchInRevereseSortedArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/SearchInRotatedSorted2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/SearchInRotatedSorted2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/SearchInsertPosition.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/SearchInsertPosition.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/SmallestLetterGreaterThanTarget.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/SmallestLetterGreaterThanTarget.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/SplitArrayLargestSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/SplitArrayLargestSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/SquareRoot.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/SquareRoot.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/findAnElementInRotatedSortedArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/findAnElementInRotatedSortedArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/lc81helper.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/lc81helper.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/binarySearch/peakElement2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/binarySearch/peakElement2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/bitManipulation/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/bitManipulation/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/bitManipulation/CanIWin.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/bitManipulation/CanIWin.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/bitManipulation/LongestAwesomeSubstring.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/bitManipulation/LongestAwesomeSubstring.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/bitManipulation/SortByParity.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/bitManipulation/SortByParity.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/bitManipulation/VowelEven.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/bitManipulation/VowelEven.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/ASCIIDeleteSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/ASCIIDeleteSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/BestTeamWithNoConflicts.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/BestTeamWithNoConflicts.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/BestTimeToBuyAndSellStock.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/BestTimeToBuyAndSellStock.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/BooleanParenthesization.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/BooleanParenthesization.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/BuildArrayExactlyK.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/BuildArrayExactlyK.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/BurstBallons.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/BurstBallons.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/BuyAndSellStock2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/BuyAndSellStock2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/BuyAndSellWithFee.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/BuyAndSellWithFee.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/ChampagneTower.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/ChampagneTower.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/ClimbingStairs.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/ClimbingStairs.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/CodingNinjasPartitionsWithGivenDifference.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/CodingNinjasPartitionsWithGivenDifference.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/CoinChange1.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/CoinChange1.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/CoinChange2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/CoinChange2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/CombinationSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/CombinationSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/CombinationSumIV.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/CombinationSumIV.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/ConcatenatedWords.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/ConcatenatedWords.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/CountOfSubsetWithSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/CountOfSubsetWithSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/DecodeWays.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/DecodeWays.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/DeleteAndEarn.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/DeleteAndEarn.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/EditDistance.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/EditDistance.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/ExtraCharactersInString.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/ExtraCharactersInString.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/FairDistributionOfCookies.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/FairDistributionOfCookies.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/FrogJump.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/FrogJump.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/HouseRobber2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/HouseRobber2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/InterleavingString.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/InterleavingString.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/Job.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/Job.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/JumpGame2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/JumpGame2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/JumpGame6.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/JumpGame6.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/KnapSack01.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/KnapSack01.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/KnightProbability.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/KnightProbability.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/LIS.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/LIS.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/LargestPlusSign.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/LargestPlusSign.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/LargestVarianceSubstring.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/LargestVarianceSubstring.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/LongestCommonSubstring.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/LongestCommonSubstring.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/LongestPalindromicSubSeq.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/LongestPalindromicSubSeq.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/LongestPalindromicSubstring.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/LongestPalindromicSubstring.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/LongestRepeatingSubsequence.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/LongestRepeatingSubsequence.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/MatrixChainMultiplication.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/MatrixChainMultiplication.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/MaxEventAttend2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/MaxEventAttend2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/MaximumProfitInJob.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/MaximumProfitInJob.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/MinCostClimbingStairs.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/MinCostClimbingStairs.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/MinimumCostToCutAStick.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/MinimumCostToCutAStick.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/MinimumDeletion.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/MinimumDeletion.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/MinimumInsertionPalindrome.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/MinimumInsertionPalindrome.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/MinimumSubsetSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/MinimumSubsetSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/New21Game.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/New21Game.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/NumberOfLis.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/NumberOfLis.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/NumberOfSubsetWithGivenDifference.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/NumberOfSubsetWithGivenDifference.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/OptimizedPalindromePartition.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/OptimizedPalindromePartition.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/PalindromicPartitioning2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/PalindromicPartitioning2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/PalindromicPartitioning4.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/PalindromicPartitioning4.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/PalindromicSubstrings.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/PalindromicSubstrings.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/PartitionEqualSubsetSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/PartitionEqualSubsetSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/PascalTriangle.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/PascalTriangle.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/PrintLCS.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/PrintLCS.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/RegularExpressionMatching.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/RegularExpressionMatching.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/RemoveBoxes.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/RemoveBoxes.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/RodCuttingGFG.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/RodCuttingGFG.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/RussianDollEnvelopes.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/RussianDollEnvelopes.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/SCS.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/SCS.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/SetMatrixZeroes.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/SetMatrixZeroes.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/StackingCuboids$1.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/StackingCuboids$1.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/StackingCuboids.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/StackingCuboids.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/StoneGame1.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/StoneGame1.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/StoneGame3.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/StoneGame3.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/StrangePrinter.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/StrangePrinter.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/SubsetSumProblem.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/SubsetSumProblem.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/SuoerEggDrop.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/SuoerEggDrop.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/SuperUglyNumber.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/SuperUglyNumber.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/TargetSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/TargetSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/Triangle.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/Triangle.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/TriangulationOfPolygon.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/TriangulationOfPolygon.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/TurbulentSubarray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/TurbulentSubarray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/UglyNumber.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/UglyNumber.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/UglyNumber2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/UglyNumber2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/UnboundedKnapsack.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/UnboundedKnapsack.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/WildcardMatching.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/WildcardMatching.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/WordBreak.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/WordBreak.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/WordBreak2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/WordBreak2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/isSubSeq.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/isSubSeq.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/st3.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/st3.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/dynamicProgramming/stoneGame2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/dynamicProgramming/stoneGame2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/AsFarFromLandFromPossible.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/AsFarFromLandFromPossible.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/CloneGraph.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/CloneGraph.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/ColoringBorder.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/ColoringBorder.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/CountSubGraphs.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/CountSubGraphs.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/FlowerPlanting.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/FlowerPlanting.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/JumpGame3.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/JumpGame3.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/LetterCombinationOfPhoneNumber.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/LetterCombinationOfPhoneNumber.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/MaxAreaIsland.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/MaxAreaIsland.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/MaximalNetworkRank.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/MaximalNetworkRank.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/MinTimeToCollectAllApples.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/MinTimeToCollectAllApples.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/Node.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/Node.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/NumberOfIslands.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/NumberOfIslands.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/ParallelCourses3.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/ParallelCourses3.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/ReconstructItenary.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/ReconstructItenary.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/RottingOranges.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/RottingOranges.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/ShortestBridge.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/ShortestBridge.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/ShortestPathAllNodes.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/ShortestPathAllNodes.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/WaterAndJugProblem.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/WaterAndJugProblem.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/pair.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/pair.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/graphs/restoreArrayFromAdjacent.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/graphs/restoreArrayFromAdjacent.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/Candies.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/Candies.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/DIStringMatch.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/DIStringMatch.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/Dota2Senate.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/Dota2Senate.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/GasStation.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/GasStation.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/GetTheMaximumScore.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/GetTheMaximumScore.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/JumpGame.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/JumpGame.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/MinReplaceToSortArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/MinReplaceToSortArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/MinimumMovesToMakePalindrome.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/MinimumMovesToMakePalindrome.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/MinimumTimeToMakeRopeColourful.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/MinimumTimeToMakeRopeColourful.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/NmeetingsInoneRoom.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/NmeetingsInoneRoom.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/NumberOfWeakCharacters.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/NumberOfWeakCharacters.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/ShortestUnsorted.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/ShortestUnsorted.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/TaskScheduler.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/TaskScheduler.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/TaskSchedulerHelper.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/TaskSchedulerHelper.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/ValidPalindrome2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/ValidPalindrome2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/greedy/pair.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/greedy/pair.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/APSequenceGivenDiff.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/APSequenceGivenDiff.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/AllAnagrams.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/AllAnagrams.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/ArrayOfDoubledPair.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/ArrayOfDoubledPair.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/BuddyStrings.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/BuddyStrings.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/CarPooling.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/CarPooling.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/ContinousSub.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/ContinousSub.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/ContinousSubarraySum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/ContinousSubarraySum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/DNASequence.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/DNASequence.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/DesignHashMap.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/DesignHashMap.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/DesignTwitter.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/DesignTwitter.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/DifferenceInTwoArrays.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/DifferenceInTwoArrays.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/FindAllGoodIndices.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/FindAllGoodIndices.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/FindAndReplacePattern.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/FindAndReplacePattern.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/FlowersInFullBloom.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/FlowersInFullBloom.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/GridGame.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/GridGame.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/GroupAnagrams.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/GroupAnagrams.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/GroupThePeople.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/GroupThePeople.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/IntegerToRoman.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/IntegerToRoman.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/KClosestPointsToOrigin.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/KClosestPointsToOrigin.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/KPairWithSmallestSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/KPairWithSmallestSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/KWeakestRows.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/KWeakestRows.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/MaxConsecOnes.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/MaxConsecOnes.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/MaxEventAttend.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/MaxEventAttend.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/MinRoundsToCompleteTasks.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/MinRoundsToCompleteTasks.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/MinimizeDeviationInArray.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/MinimizeDeviationInArray.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/MyHashMap.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/MyHashMap.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/RabbitsInForest.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/RabbitsInForest.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/SetKConsec.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/SetKConsec.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/SetMatrixZeroes.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/SetMatrixZeroes.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/SubStringwithEqual012.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/SubStringwithEqual012.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/SubarraySumDivisibleByk.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/SubarraySumDivisibleByk.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/SubarraySumEqualsK.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/SubarraySumEqualsK.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/SubarrayWithEqual01.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/SubarrayWithEqual01.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/TopKFreq.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/TopKFreq.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/Twitter.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/Twitter.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/User.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/User.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/lc373comp.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/lc373comp.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/hashTable/mpNode.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/hashTable/mpNode.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/heap/SingleThreadedCpu.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/heap/SingleThreadedCpu.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/AddOneToLinkedList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/AddOneToLinkedList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/AddTwoNumbers2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/AddTwoNumbers2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/AddTwoNumbersLinkedList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/AddTwoNumbersLinkedList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/BrowserHistory.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/BrowserHistory.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/CopyRandomPointer.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/CopyRandomPointer.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/DLLS.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/DLLS.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/DeleteLoopInALinkedList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/DeleteLoopInALinkedList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/FlattenDoublyLinkedList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/FlattenDoublyLinkedList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/IntersectionLinkedList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/IntersectionLinkedList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/IntersectionOfLinkedList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/IntersectionOfLinkedList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/LLCycle2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/LLCycle2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/LastElementToFirst.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/LastElementToFirst.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/LinkedListCycle.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/LinkedListCycle.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/ListNode.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/ListNode.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/MaximumTwinSumOfLinkedList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/MaximumTwinSumOfLinkedList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/MergeKLinkedList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/MergeKLinkedList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/MiddleOfLinkedList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/MiddleOfLinkedList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/Node.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/Node.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/PartitionList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/PartitionList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/RemoveDuplicatesFromSortedList2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/RemoveDuplicatesFromSortedList2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/RemoveDuplicatesFromUnsorted.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/RemoveDuplicatesFromUnsorted.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/RemoveDuplicatesSorted.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/RemoveDuplicatesSorted.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/RemoveLinkedListElement.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/RemoveLinkedListElement.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/ReverseLinkedList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/ReverseLinkedList.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/ReverseLinkedList2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/ReverseLinkedList2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/ReverseNodesInKGroup.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/ReverseNodesInKGroup.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/SwapNodesInPairs.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/SwapNodesInPairs.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/help.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/help.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/lc430Helper.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/lc430Helper.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/linkedList/lc86helper.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/linkedList/lc86helper.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/math/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/math/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/math/BeautifulArrangment2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/math/BeautifulArrangment2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/math/CheckIfStraightLine.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/math/CheckIfStraightLine.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/math/ExcelSheetCol.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/math/ExcelSheetCol.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/math/GCD.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/math/GCD.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/math/NoOfZeroFilledSubarrays.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/math/NoOfZeroFilledSubarrays.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/math/ReverseInteger.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/math/ReverseInteger.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/math/SignOfTheProduct.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/math/SignOfTheProduct.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/math/ValidPickupAndDelivery.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/math/ValidPickupAndDelivery.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/AsteroidCollision.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/AsteroidCollision.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/CarFleet.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/CarFleet.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/CarFleet2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/CarFleet2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/CheckIfValidAfterSub.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/CheckIfValidAfterSub.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/CustomStack.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/CustomStack.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/DailyTemprature.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/DailyTemprature.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/DecodeString.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/DecodeString.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/LongestValidParentheses.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/LongestValidParentheses.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/MaxWidthRamp.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/MaxWidthRamp.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/MinDeletionsArrayBeautiful.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/MinDeletionsArrayBeautiful.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/MinStack.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/MinStack.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/MyStack.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/MyStack.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/NextGreaterElement1.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/NextGreaterElement1.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/NextGreaterElement2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/NextGreaterElement2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/SimplifyPath.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/SimplifyPath.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/SpanNode.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/SpanNode.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/StackUsingQueues.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/StackUsingQueues.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/StackWithIncrementOperation.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/StackWithIncrementOperation.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/StockSpanner.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/StockSpanner.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/SumOfSubarrayMin.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/SumOfSubarrayMin.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/SwapToMakeBalanced.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/SwapToMakeBalanced.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/ValidParentheses.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/ValidParentheses.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/ValidateStackSequences.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/ValidateStackSequences.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/lc32Helper.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/lc32Helper.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/stackAndQueue/stackNode.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/stackAndQueue/stackNode.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/CountAndSay.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/CountAndSay.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/DecodeStringAtIndex.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/DecodeStringAtIndex.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/EncodeAndDecodeTinyUrl.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/EncodeAndDecodeTinyUrl.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/Length3PalSubSeq.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/Length3PalSubSeq.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/MergeStringsAlternately.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/MergeStringsAlternately.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/NamingACompany.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/NamingACompany.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/RemoveAllAdjacent.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/RemoveAllAdjacent.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/RemoveColouredPieces.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/RemoveColouredPieces.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/RemoveDuplicateLetters.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/RemoveDuplicateLetters.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/ReorganizeString.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/ReorganizeString.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/ReverseString3.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/ReverseString3.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/StringCompression.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/StringCompression.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/StringToInteger.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/StringToInteger.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/strings/lc1047.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/strings/lc1047.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/AllPossibleFullBinaryTree.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/AllPossibleFullBinaryTree.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/BSATtoGST.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/BSATtoGST.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/BinaryTreeCameras.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/BinaryTreeCameras.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/BottomLeft.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/BottomLeft.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/BoundryTraversal.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/BoundryTraversal.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/Codec.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/Codec.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/ColoringGame.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/ColoringGame.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/ConstructFromInorderPostorder.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/ConstructFromInorderPostorder.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/ConstructFromInorderPreorder.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/ConstructFromInorderPreorder.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/DeepestLeavesSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/DeepestLeavesSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/DeleteInBst.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/DeleteInBst.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/DiagonalTraversal.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/DiagonalTraversal.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/DiameterOfBinaryTree.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/DiameterOfBinaryTree.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/DistributeCoinsInBinaryTree.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/DistributeCoinsInBinaryTree.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/FlipEqui.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/FlipEqui.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/GoodNodes.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/GoodNodes.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/HouseRobber3.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/HouseRobber3.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/InorderTraversal.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/InorderTraversal.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/LCA.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/LCA.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/LCAOfNormalBinaryTree.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/LCAOfNormalBinaryTree.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/LeftView.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/LeftView.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/LevelOrder.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/LevelOrder.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/LongestZigZagPath.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/LongestZigZagPath.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/MaximumPathSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/MaximumPathSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/MaximumProductOfSplittedBinaryTree.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/MaximumProductOfSplittedBinaryTree.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/MaximumWidthOfBinaryTree.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/MaximumWidthOfBinaryTree.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/MinimumDepth.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/MinimumDepth.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/MorrisTraversal.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/MorrisTraversal.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/Node.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/Node.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/NodesAtDistanceK.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/NodesAtDistanceK.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/NodesInCBT.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/NodesInCBT.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/PathSum.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/PathSum.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/PathSum2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/PathSum2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/PathSum3.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/PathSum3.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/PostOrder.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/PostOrder.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/PreorderTraversal.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/PreorderTraversal.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/RecoverBST.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/RecoverBST.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/ReverseLevelOrder.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/ReverseLevelOrder.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/RightSideView.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/RightSideView.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/SeralizeAndDesBst.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/SeralizeAndDesBst.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/SortedArrayBst.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/SortedArrayBst.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/SymmetricTree.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/SymmetricTree.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/TraversalsIterative.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/TraversalsIterative.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/TreeNode.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/TreeNode.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/UniqueBst.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/UniqueBst.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/ValidateBinaryTreeNodes.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/ValidateBinaryTreeNodes.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/ValidateBst.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/ValidateBst.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/ZigZagLevelOrderTraversal.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/ZigZagLevelOrderTraversal.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/customPair.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/customPair.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/customTree.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/customTree.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/helper.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/helper.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/helper2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/helper2.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/helper3.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/helper3.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/lc337.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/lc337.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/maxPathSumHelper.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/maxPathSumHelper.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/populatingNextRightPointer.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/populatingNextRightPointer.class -------------------------------------------------------------------------------- /JAVA_DSA/bin/trees/populatingNextRightPointer2.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/bin/trees/populatingNextRightPointer2.class -------------------------------------------------------------------------------- /JAVA_DSA/src/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/App.java: -------------------------------------------------------------------------------- 1 | public class App { 2 | public static void main(String[] args) throws Exception { 3 | System.out.println("Hello, World!"); 4 | } 5 | } 6 | -------------------------------------------------------------------------------- /JAVA_DSA/src/arrays/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/arrays/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/arrays/ArrayPairsDivisibleK.java: -------------------------------------------------------------------------------- 1 | package arrays; 2 | 3 | public class ArrayPairsDivisibleK { 4 | 5 | public static boolean canArrange(int[] arr, int k) { 6 | int freq[] = new int[k+1]; 7 | // count the frequency of each remainder 8 | for (int i : arr) { 9 | freq[i % k]++; 10 | } 11 | // check 12 | for (int i = 0; i < ((k + 1) / 2); i++) { 13 | if (freq[i] != freq[k - i]) { 14 | return false; 15 | } 16 | } 17 | return true; 18 | } 19 | 20 | public static void main(String[] args) { 21 | int arr[] = { 1, 2, 3, 4, 5, 10, 6, 7, 8, 9 }; 22 | int k = 5; 23 | System.out.println(canArrange(arr, k)); 24 | } 25 | } 26 | -------------------------------------------------------------------------------- /JAVA_DSA/src/arrays/CanPlaceFlowers.java: -------------------------------------------------------------------------------- 1 | package arrays; 2 | 3 | public class CanPlaceFlowers { 4 | 5 | public static void main(String args[]){ 6 | 7 | } 8 | public boolean canPlace(int[] flowerbed, int n){ 9 | int placed = 0; 10 | for(int i = 0;i=n; 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /JAVA_DSA/src/arrays/ContainerWithMostWater.java: -------------------------------------------------------------------------------- 1 | package arrays; 2 | 3 | public class ContainerWithMostWater { 4 | 5 | public static void main(String args[]) { 6 | int arr[] = { 1, 8, 6, 2, 5, 4, 8, 3, 7 }; 7 | System.out.print(util1(arr)); 8 | } 9 | 10 | public static int util1(int[] arr) { 11 | int i = 0, j = arr.length - 1; 12 | int ans = 0; 13 | while (i < j) { 14 | int length = Math.min(arr[i], arr[j]); 15 | int width = j - i; 16 | int currentAns = width * length; 17 | ans = Math.max(ans, currentAns); 18 | if (arr[i] > arr[j]) { 19 | j--; 20 | } else { 21 | i++; 22 | } 23 | } 24 | return ans; 25 | } 26 | 27 | } 28 | -------------------------------------------------------------------------------- /JAVA_DSA/src/arrays/KadaneAlgo.java: -------------------------------------------------------------------------------- 1 | package arrays; 2 | 3 | public class KadaneAlgo { 4 | public static long maxSubarraySum(int arr[], int n) { 5 | int maxNow = 0; 6 | int totalMax = Integer.MIN_VALUE; 7 | for(int i = 0;i helper = new HashMap(); 11 | int sum=0,ans=0; 12 | helper.put(0,1); 13 | for(int i=0;i hm = new HashMap<>(); 17 | for (int i = 0; i < nums.length; i++) { 18 | int toLookFor = target - nums[i]; 19 | if (hm.containsKey(toLookFor)) { 20 | int ans[] = new int[] { hm.get(toLookFor), i }; 21 | return ans; 22 | } else { 23 | hm.put(nums[i], i); 24 | } 25 | } 26 | return new int[] { -1 }; 27 | } 28 | 29 | } -------------------------------------------------------------------------------- /JAVA_DSA/src/backtracking/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/backtracking/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/backtracking/Subsets2.java: -------------------------------------------------------------------------------- 1 | package backtracking; 2 | 3 | import java.util.*; 4 | 5 | public class Subsets2 { 6 | 7 | public static void main(String args[]) { 8 | 9 | } 10 | 11 | static List> ans; 12 | 13 | public static List> util1(int arr[]) { 14 | ans = new ArrayList<>(); 15 | Arrays.sort(arr); 16 | helper(arr, 0, new ArrayList<>()); 17 | return ans; 18 | } 19 | 20 | public static void helper(int arr[], int index, List l) { 21 | ans.add(new ArrayList<>(l)); 22 | for (int i = index; i < arr.length; i++) { 23 | if (i > index && arr[i] == arr[i - 1]) { 24 | continue; 25 | } 26 | l.add(arr[i]); 27 | helper(arr, i + 1, l); 28 | l.remove(l.size() - 1); 29 | } 30 | } 31 | 32 | } 33 | -------------------------------------------------------------------------------- /JAVA_DSA/src/backtracking/UniquePaths.java: -------------------------------------------------------------------------------- 1 | package backtracking; 2 | 3 | public class UniquePaths { 4 | 5 | public static void main(String args[]){ 6 | 7 | } 8 | 9 | 10 | public static int util1(int m , int n){ 11 | int grid[][] = new int[m][n]; 12 | grid[0][0] = 1; 13 | for(int i = 0;i=0){ 16 | grid[i][j]+=grid[i-1][j]; 17 | } 18 | if(j-1>=0){ 19 | grid[i][j]+=grid[i][j-1]; 20 | } 21 | } 22 | } 23 | return grid[grid.length-1][grid[0].length-1]; 24 | } 25 | 26 | } 27 | -------------------------------------------------------------------------------- /JAVA_DSA/src/binarySearch/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/binarySearch/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/binarySearch/BinarySearch.java: -------------------------------------------------------------------------------- 1 | package binarySearch; 2 | 3 | public class BinarySearch { 4 | 5 | public static void main(String[] args) { 6 | int arr[] = {-1,0,3,5,9,12}; 7 | int target =12; 8 | System.out.println(binarySearch(arr,target)); 9 | 10 | } 11 | public static int binarySearch(int nums[],int target ) { 12 | int high = nums.length-1,low = 0; 13 | while(high>=low) { 14 | int mid = (high+low)/2; 15 | if(nums[mid]>target) { 16 | high = mid-1; 17 | }else if(nums[mid]x) { 18 | res =arr[mid]; 19 | end = mid-1; 20 | }else { 21 | start = mid+1; 22 | } 23 | } 24 | return res; 25 | 26 | } 27 | 28 | } 29 | -------------------------------------------------------------------------------- /JAVA_DSA/src/binarySearch/FindPeakElement.java: -------------------------------------------------------------------------------- 1 | package binarySearch; 2 | 3 | public class FindPeakElement { 4 | 5 | public static void main(String[] args) { 6 | // TODO Auto-generated method stub 7 | int arr[] = {1,2,1,3,5,6,4}; 8 | System.out.print(findPeakElement(arr)); 9 | 10 | } 11 | public static int findPeakElement(int [] nums) { 12 | int start = 0,end = nums.length-1,mid = 0; 13 | while(start<=end) { 14 | mid = start + (end-start)/2; 15 | if((midx) { 24 | end = mid-1; 25 | }else { 26 | res = mid; 27 | start = mid+1; 28 | } 29 | } 30 | return res; 31 | } 32 | 33 | } 34 | -------------------------------------------------------------------------------- /JAVA_DSA/src/binarySearch/MinimumInRotatedSortedArray.java: -------------------------------------------------------------------------------- 1 | package binarySearch; 2 | 3 | public class MinimumInRotatedSortedArray { 4 | 5 | public static void main(String[] args) { 6 | int arr[] = {2,5,6,8,11,12,15,18}; 7 | System.out.print(findMin(arr)); 8 | 9 | } 10 | public static int findMin(int [] nums) { 11 | int pivot = getPivot(nums); 12 | return nums[pivot]; 13 | } 14 | private static int getPivot(int []arr) { 15 | int n = arr.length; 16 | int mid = 0,start = 0,end = n-1; 17 | while(start<=end) { 18 | mid = start + (end-start)/2; 19 | int prev = (mid+n-1)%n,next = (mid+1)%n; 20 | if(arr[mid]target) { 25 | end = mid-2; 26 | }else { 27 | start = mid+2; 28 | } 29 | } 30 | return -1; 31 | } 32 | 33 | } 34 | -------------------------------------------------------------------------------- /JAVA_DSA/src/binarySearch/SearchInRevereseSortedArray.java: -------------------------------------------------------------------------------- 1 | package binarySearch; 2 | 3 | public class SearchInRevereseSortedArray { 4 | 5 | public static void main(String[] args) { 6 | int arr[] = {8,7,5,3,1}; 7 | System.out.print(bs(arr,7)); 8 | 9 | } 10 | private static int bs(int [] arr, int n) { 11 | int mid = 0,start = 0,end = arr.length-1; 12 | while(start<=end) { 13 | mid = start + (end-start)/2; 14 | if(arr[mid] == n) { 15 | return mid; 16 | } 17 | else if(arr[mid] target) { 18 | res = mid; 19 | end = mid - 1; 20 | } else { 21 | start = mid + 1; 22 | } 23 | } 24 | 25 | return res; 26 | } 27 | 28 | } 29 | -------------------------------------------------------------------------------- /JAVA_DSA/src/binarySearch/SmallestLetterGreaterThanTarget.java: -------------------------------------------------------------------------------- 1 | package binarySearch; 2 | 3 | public class SmallestLetterGreaterThanTarget { 4 | 5 | public static void main(String[] args) { 6 | // TODO Auto-generated method stub 7 | char arr[] = {'c','f','j'}; 8 | System.out.print(nextGreaterLetter(arr,'e')); 9 | 10 | } 11 | public static char nextGreaterLetter(char [] letters,char target) { 12 | char res = letters[0]; 13 | int start =0,end = letters.length-1,mid = 0; 14 | int toCompare =(int)target; 15 | while(start<=end) { 16 | mid = start + (end-start)/2; 17 | int a = (int)letters[mid]; 18 | if(a>toCompare) { 19 | res = letters[mid]; 20 | end = mid-1; 21 | }else { 22 | start = mid+1; 23 | } 24 | } 25 | return res; 26 | } 27 | 28 | } 29 | -------------------------------------------------------------------------------- /JAVA_DSA/src/binarySearch/SquareRoot.java: -------------------------------------------------------------------------------- 1 | package binarySearch; 2 | 3 | public class SquareRoot { 4 | 5 | public static void main(String[] args) { 6 | int x = 9; 7 | int ans = mySqrt(x); 8 | System.out.print(ans); 9 | } 10 | 11 | public static int mySqrt(int x) { 12 | if(x == 0) {return x;} 13 | //take low because mid * mid might cause overflow... 14 | long low = 1,high = x; 15 | while(true) { 16 | long mid =low + (high-low)/2; 17 | if((mid * mid)>x) { 18 | high = mid-1; 19 | }else { 20 | long next = mid+1; 21 | if((next*next) >x) {return (int)mid;} 22 | low =mid+1; 23 | } 24 | } 25 | } 26 | 27 | } 28 | -------------------------------------------------------------------------------- /JAVA_DSA/src/bitManipulation/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/bitManipulation/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/dynamicProgramming/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/dynamicProgramming/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/dynamicProgramming/HouseRobber2.java: -------------------------------------------------------------------------------- 1 | package dynamicProgramming; 2 | 3 | public class HouseRobber2 { 4 | 5 | public static void main(String args[]) { 6 | int arr[] = { 1, 4, 3, 2 }; 7 | System.out.print(util2(arr)); 8 | } 9 | 10 | public static int util2(int arr[]) { 11 | if (arr.length == 0) { 12 | return arr[0]; 13 | } 14 | int ans1 = helper(arr, 1); 15 | int ans2 = helper(arr, 0); 16 | return Math.max(ans1, ans2); 17 | } 18 | 19 | public static int helper(int arr[], int i) { 20 | int dp[] = new int[arr.length]; 21 | dp[0] = 0; 22 | dp[1] = arr[i++]; 23 | for (int a = 2; a < dp.length; a++) { 24 | dp[a] = Math.max(dp[a - 1], (dp[a - 2] + arr[i++])); 25 | } 26 | return dp[dp.length - 1]; 27 | } 28 | 29 | } 30 | -------------------------------------------------------------------------------- /JAVA_DSA/src/dynamicProgramming/UglyNumber.java: -------------------------------------------------------------------------------- 1 | package dynamicProgramming; 2 | 3 | public class UglyNumber { 4 | public static void main(String args[]){ 5 | int n = 14; 6 | System.out.println(uglyNumber(n)); 7 | } 8 | public static boolean uglyNumber(int n){ 9 | if(n <=0){return false;} 10 | if(n == 1){return true;} 11 | if(n%2 == 0){ 12 | return uglyNumber(n/2); 13 | }else if (n%3 == 0){ 14 | return uglyNumber(n/3); 15 | }else if(n%5 == 0){ 16 | return uglyNumber(n/5); 17 | }else{ 18 | return false; 19 | } 20 | } 21 | 22 | } 23 | -------------------------------------------------------------------------------- /JAVA_DSA/src/graphs/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/graphs/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/greedy/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/greedy/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/greedy/DIStringMatch.java: -------------------------------------------------------------------------------- 1 | package greedy; 2 | 3 | public class DIStringMatch { 4 | public static void main(String args[]){ 5 | String s = "DDI"; 6 | int arr[]= diStringMatch(s); 7 | for(int i:arr){ 8 | System.out.print(i+" "); 9 | } 10 | } 11 | 12 | public static int[] diStringMatch(String s){ 13 | int low = 0,high = s.length(); 14 | int ans[] = new int[s.length()+1]; 15 | int k =0; 16 | for(int i =0;i hm = new HashMap<>(); 17 | hm.put(0, 0); 18 | int sum = 0; 19 | for (int i = 0; i < arr.length; i++) { 20 | sum += arr[i]; 21 | if (hm.containsKey(sum % k)) { 22 | if (hm.get(sum % k) < i) { 23 | return true; 24 | } 25 | } else { 26 | hm.put(sum % k, i + 1); 27 | } 28 | } 29 | return false; 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /JAVA_DSA/src/hashTable/MaxConsecOnes.java: -------------------------------------------------------------------------------- 1 | package hashTable; 2 | 3 | public class MaxConsecOnes { 4 | 5 | public static void main(String[] args) { 6 | int arr[] = {1,1,0,1,1,1}; 7 | System.out.print(findMaxConsecutiveOnes(arr)); 8 | 9 | } 10 | public static int findMaxConsecutiveOnes(int[] nums) { 11 | int maxLen = Integer.MIN_VALUE,current = 0; 12 | for(int i = 0;i helper = new HashMap(); 12 | helper.put(0,1); 13 | for(int i:nums) { 14 | sum +=i; 15 | int remainder = sum%k; 16 | if(remainder<0) {remainder+=k;} 17 | if(helper.containsKey(remainder)) { 18 | result += helper.get(remainder); 19 | helper.put(remainder,helper.get(remainder)+1); 20 | } 21 | helper.putIfAbsent(remainder,1); 22 | } 23 | return result; 24 | } 25 | 26 | } 27 | -------------------------------------------------------------------------------- /JAVA_DSA/src/hashTable/SubarrayWithEqual01.java: -------------------------------------------------------------------------------- 1 | package hashTable; 2 | import java.util.HashMap; 3 | 4 | public class SubarrayWithEqual01 { 5 | 6 | public static void main(String [] args) { 7 | int arr[] = {0,1,0,0,1,1,0}; 8 | System.out.print(findMaxLength(arr)); 9 | } 10 | public static int findMaxLength(int nums[]) { 11 | if(nums.length == 0||nums == null) {return 0;} 12 | int sum = 0,max = 0; 13 | HashMap help = new HashMap(); 14 | help.put(0,-1); 15 | for(int i = 0;i nextNodes = new HashSet(); 8 | ListNode temp = head; 9 | while(temp!=null) { 10 | if(nextNodes.contains(temp)) { 11 | return true; 12 | }else { 13 | nextNodes.add(temp); 14 | temp = temp.next; 15 | } 16 | } 17 | return false; 18 | } 19 | 20 | 21 | public static void main(String[] args) { 22 | ListNode a = new ListNode(3); 23 | ListNode b = new ListNode(4); 24 | ListNode c = new ListNode(5); 25 | ListNode d = new ListNode(6); 26 | ListNode e = new ListNode(7); 27 | a.next = b; 28 | b.next = c; 29 | c.next = d; 30 | d.next = e; 31 | e.next = null; 32 | System.out.print(hasCycle(a)); 33 | 34 | } 35 | 36 | } 37 | -------------------------------------------------------------------------------- /JAVA_DSA/src/linkedList/MaximumTwinSumOfLinkedList.java: -------------------------------------------------------------------------------- 1 | package linkedList; 2 | 3 | import java.util.*; 4 | 5 | public class MaximumTwinSumOfLinkedList { 6 | 7 | public static void main(String args[]) { 8 | 9 | } 10 | 11 | public static int util1(ListNode head) { 12 | Deque dq = new ArrayDeque<>(); 13 | ListNode temp = head; 14 | while (temp != null) { 15 | dq.addLast(temp); 16 | temp = temp.next; 17 | } 18 | int ans = Integer.MIN_VALUE; 19 | while (dq.isEmpty() == false) { 20 | ListNode leftNode = dq.removeFirst(); 21 | ListNode rightNode = dq.removeLast(); 22 | int candidate = leftNode.val + rightNode.val; 23 | ans = Math.max(ans, candidate); 24 | } 25 | return ans; 26 | } 27 | 28 | } 29 | -------------------------------------------------------------------------------- /JAVA_DSA/src/math/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/math/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/math/ExcelSheetCol.java: -------------------------------------------------------------------------------- 1 | package math; 2 | 3 | public class ExcelSheetCol { 4 | 5 | public static void main(String args[]) { 6 | // System.out.print(29%26); 7 | System.out.print(34%26); 8 | } 9 | 10 | //basically this is a base 26 number system 11 | //because here A starts from 1, so we do n-- 12 | 13 | public static String util1(int n) { 14 | StringBuilder sb = new StringBuilder(); 15 | while (n > 0) { 16 | n--; 17 | char ch = (char) ((n % 26) + 'A'); 18 | sb.append(ch); 19 | n /= 26; 20 | } 21 | return sb.reverse().toString(); 22 | } 23 | 24 | } 25 | -------------------------------------------------------------------------------- /JAVA_DSA/src/math/SignOfTheProduct.java: -------------------------------------------------------------------------------- 1 | package math; 2 | 3 | public class SignOfTheProduct { 4 | 5 | public static void main(String args[]){ 6 | int arr[] ={-1,1,-1,1,-1}; 7 | System.out.println(util1(arr)); 8 | } 9 | 10 | public static int util1(int [] arr){ 11 | int numberNegative = 0; 12 | for(int i:arr){ 13 | if(i == 0){ 14 | return 0; 15 | }else if(i<0){ 16 | numberNegative++; 17 | } 18 | } 19 | if(numberNegative%2 == 0){ 20 | return 1; 21 | }else{ 22 | return -1; 23 | } 24 | } 25 | 26 | } 27 | -------------------------------------------------------------------------------- /JAVA_DSA/src/math/ValidPickupAndDelivery.java: -------------------------------------------------------------------------------- 1 | package math; 2 | 3 | public class ValidPickupAndDelivery { 4 | 5 | public static void main(String args[]) { 6 | System.out.print(util1(8)); 7 | } 8 | 9 | static int mod = 1000000007; 10 | 11 | public static long util1(int n) { 12 | if (n == 1) { 13 | return 1; 14 | } 15 | long smallAns = util1(n - 1); 16 | long positions = ((n * 2 - 1) * (n * 2)) / 2; 17 | return (smallAns * positions) % mod; 18 | } 19 | 20 | /* 21 | * for the ith pickup we have exact (2*i-1) positions 22 | * for the ith delivery we have exact (2*i) positions 23 | * in exact half of the combinations, the delivery will be before than the 24 | * pickup, that is why divide by 2 25 | */ 26 | } 27 | -------------------------------------------------------------------------------- /JAVA_DSA/src/stackAndQueue/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/stackAndQueue/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/stackAndQueue/StockSpanner.java: -------------------------------------------------------------------------------- 1 | package stackAndQueue; 2 | 3 | import java.util.Stack; 4 | public class StockSpanner { 5 | 6 | Stack s; 7 | public StockSpanner() { 8 | s = new Stack(); 9 | } 10 | 11 | public int next(int price) { 12 | int toReturn = 1; 13 | while(s.isEmpty() != false){ 14 | if(s.peek().a<=price){ 15 | toReturn+=s.pop().b; 16 | }else{ 17 | break; 18 | } 19 | } 20 | SpanNode sn = new SpanNode(price, toReturn); 21 | s.push(sn); 22 | return toReturn; 23 | } 24 | } 25 | class SpanNode{ 26 | int a; 27 | int b; 28 | SpanNode(int a, int b){ 29 | this.a = a;this.b = b; 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /JAVA_DSA/src/stackAndQueue/ValidateStackSequences.java: -------------------------------------------------------------------------------- 1 | package stackAndQueue; 2 | 3 | import java.util.*; 4 | 5 | public class ValidateStackSequences { 6 | 7 | public static void main(String args[]) { 8 | 9 | } 10 | 11 | public static boolean util1(int[] pushed, int[] popped) { 12 | Stack s = new Stack<>(); 13 | for (int i = 0, k = 0; i < pushed.length; i++) { 14 | s.push(pushed[i]); 15 | while ((s.isEmpty() == false) && (s.peek() == popped[k])) { 16 | s.pop(); 17 | k++; 18 | } 19 | } 20 | return s.isEmpty(); 21 | } 22 | 23 | } 24 | -------------------------------------------------------------------------------- /JAVA_DSA/src/strings/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/strings/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/strings/ReverseString3.java: -------------------------------------------------------------------------------- 1 | package strings; 2 | 3 | public class ReverseString3 { 4 | 5 | public static void main(String[] args) { 6 | 7 | } 8 | 9 | public static String util1(String str) { 10 | String arr[] = str.split(" "); 11 | StringBuffer ans = new StringBuffer(); 12 | for (String s : arr) { 13 | for (int i = s.length() - 1; i >= 0; i--) { 14 | ans.append(s.charAt(i)); 15 | } 16 | ans.append(" "); 17 | } 18 | return ans.substring(0, ans.length() - 1); 19 | } 20 | 21 | } 22 | -------------------------------------------------------------------------------- /JAVA_DSA/src/trees/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/JAVA_DSA/src/trees/.DS_Store -------------------------------------------------------------------------------- /JAVA_DSA/src/trees/BSATtoGST.java: -------------------------------------------------------------------------------- 1 | package trees; 2 | 3 | public class BSATtoGST { 4 | 5 | public static void main(String[] args) { 6 | // TODO Auto-generated method stub 7 | 8 | } 9 | 10 | } 11 | -------------------------------------------------------------------------------- /JAVA_DSA/src/trees/GoodNodes.java: -------------------------------------------------------------------------------- 1 | package trees; 2 | 3 | public class GoodNodes { 4 | 5 | public static void main(String args[]) { 6 | 7 | } 8 | 9 | static int ans = 0; 10 | 11 | public static int util1(TreeNode root) { 12 | dfs(root, Integer.MIN_VALUE); 13 | return ans; 14 | } 15 | 16 | public static void dfs(TreeNode root, int maxNode) { 17 | if (root == null) { 18 | return; 19 | } 20 | maxNode = Math.max(maxNode, root.val); 21 | if (root.val >= maxNode) { 22 | ans++; 23 | } 24 | dfs(root.left, maxNode); 25 | dfs(root.right, maxNode); 26 | } 27 | 28 | } 29 | -------------------------------------------------------------------------------- /JAVA_DSA/src/trees/LCA.java: -------------------------------------------------------------------------------- 1 | package trees; 2 | 3 | public class LCA { 4 | 5 | public static void main(String[] args) { 6 | // TODO Auto-generated method stub 7 | 8 | } 9 | 10 | } 11 | -------------------------------------------------------------------------------- /JAVA_DSA/src/trees/PostOrder.java: -------------------------------------------------------------------------------- 1 | package trees; 2 | 3 | public class PostOrder { 4 | 5 | public static void main(String[] args) { 6 | // TODO Auto-generated method stub 7 | 8 | } 9 | 10 | } 11 | -------------------------------------------------------------------------------- /JAVA_DSA/src/trees/PreorderTraversal.java: -------------------------------------------------------------------------------- 1 | package trees; 2 | 3 | public class PreorderTraversal { 4 | 5 | public static void main(String[] args) { 6 | // TODO Auto-generated method stub 7 | 8 | } 9 | 10 | } 11 | -------------------------------------------------------------------------------- /javascript-dsa/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/adityaVermaBinarySearch/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/adityaVermaBinarySearch/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/arrays/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/arrays/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/arrays/2966.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @param {number} k 4 | * @return {number[][]} 5 | */ 6 | var divideArray = function (nums, k) { 7 | nums.sort((a, b) => a - b); 8 | let ans = []; 9 | let current = []; 10 | for (let i of nums) { 11 | if (current.length <= 2) { 12 | //array length less than 3 13 | if (current.length == 0 || i - current[0] <= k) { 14 | current.push(i); 15 | } else { 16 | return []; 17 | } 18 | } else { 19 | //array length == 3 20 | ans.push(current); 21 | current = [i]; 22 | } 23 | } 24 | if (current.length) { 25 | //edge case 26 | if (current.length == 3) { 27 | ans.push(current); 28 | } else { 29 | return []; 30 | } 31 | } 32 | return ans; 33 | }; 34 | 35 | let nums = [1, 3, 3, 2, 7, 3], 36 | k = 3; 37 | console.log(divideArray(nums, k)); 38 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/AllDuplicatesInArray.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @return {number[]} 4 | */ 5 | var findDuplicates = function (nums) { 6 | for (let i = 0; i < nums.length; i++) { 7 | while (nums[nums[i] - 1] != nums[i]) { 8 | [nums[nums[i] - 1], nums[i]] = [nums[i], nums[nums[i] - 1]]; 9 | } 10 | } 11 | let ans = []; 12 | for (let i = 0; i < nums.length; i++) { 13 | if (nums[i] != i + 1) { 14 | ans.push(nums[i]); 15 | } 16 | } 17 | return ans; 18 | }; 19 | //index sort 20 | 21 | let nums = [4, 3, 2, 7, 8, 2, 3, 1]; 22 | console.log(findDuplicates(nums)); 23 | 24 | //range of integers is 1 to n 25 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/AntFallOut.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number} n 3 | * @param {number[]} left 4 | * @param {number[]} right 5 | * @return {number} 6 | */ 7 | var getLastMoment = function(n, left, right) { 8 | let ans = Number.MIN_SAFE_INTEGER; 9 | for(let i of left){ 10 | ans = Math.max(ans,i); 11 | } 12 | for(let i of right){ 13 | ans = Math.max(ans,(n-i)); 14 | } 15 | return ans; 16 | }; 17 | 18 | //dumb af 19 | 20 | 21 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/BagOfTokens.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} tokens 3 | * @param {number} power 4 | * @return {number} 5 | */ 6 | var bagOfTokensScore = function (tokens, power) { 7 | tokens.sort((a, b) => a - b); 8 | let i = 0, 9 | j = tokens.length - 1, 10 | ans = 0, 11 | score = 0; 12 | while (i <= j) { 13 | if (power >= tokens[i]) { 14 | //move i forwards , and increase the score 15 | score++; 16 | power -= tokens[i++]; 17 | } else if (score < 1) { 18 | break; 19 | } else { 20 | power += tokens[j--]; 21 | score--; 22 | } 23 | ans = Math.max(score, ans); 24 | } 25 | return ans; 26 | }; 27 | 28 | let tokens = [71, 55, 82], 29 | power = 54; 30 | console.log(bagOfTokensScore(tokens, power)); 31 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/DiagnolTraversal.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[][]} nums 3 | * @return {number[]} 4 | */ 5 | var findDiagonalOrder = function (nums) { 6 | let map = new Map(); 7 | for (let i = 0; i < nums.length; i++) { 8 | for (let j = 0; j < nums[i].length; j++) { 9 | let current = i + j; 10 | if (map.has(current)) { 11 | map.get(current).push(nums[i][j]); 12 | } else { 13 | let arr = [nums[i][j]]; 14 | map.set(current, arr); 15 | } 16 | } 17 | } 18 | let ans = []; 19 | for (let [key, value] of map) { 20 | for (let i = value.length - 1; i >= 0; i--) { 21 | ans.push(value[i]); 22 | } 23 | } 24 | return ans; 25 | }; 26 | 27 | let nums = [[1, 2, 3, 4, 5], [6, 7], [8], [9, 10, 11], [12, 13, 14, 15, 16]]; 28 | console.log(findDiagonalOrder(nums)); 29 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/DuplicatesFromSortedArray.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @return {number} 4 | */ 5 | var removeDuplicates = function (nums) { 6 | let k = 1, 7 | start = 1, 8 | end = 1; 9 | while (end < nums.length) { 10 | if (nums[start - 1] != nums[end]) { 11 | nums[start++] = nums[end++]; 12 | k++; 13 | } else { 14 | end++; 15 | } 16 | } 17 | return k; 18 | }; 19 | 20 | let nums = [0, 0, 1, 1, 1, 2, 2, 3, 3, 4]; 21 | console.log(removeDuplicates(nums), nums); 22 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/FreqMostFreq.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @param {number} k 4 | * @return {number} 5 | */ 6 | var maxFrequency = function (nums, k) { 7 | nums.sort((a, b) => { 8 | if (a > b) { 9 | return 1; 10 | } else { 11 | return -1; 12 | } 13 | }); 14 | let sum = 0, 15 | ans = 0; 16 | let left = 0, 17 | right = 0; 18 | while (right < nums.length) { 19 | sum += nums[right]; 20 | while (sum + k < nums[right] * (right - left + 1)) { 21 | sum -= nums[left]; 22 | left++; 23 | } 24 | ans = Math.max(ans, right - left + 1); 25 | right++; 26 | } 27 | return ans; 28 | }; 29 | 30 | let nums = [1, 4, 8, 13], 31 | k = 5; 32 | console.log(maxFrequency(nums, k)); 33 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/MinimizeMaxPairSum.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @return {number} 4 | */ 5 | var minPairSum = function (nums) { 6 | //sort the array 7 | nums.sort((a, b) => { 8 | if (a > b) { 9 | return 1; 10 | } else { 11 | return -1; 12 | } 13 | }); 14 | //now get the max sum pair 15 | let ans = Number.MIN_SAFE_INTEGER; 16 | for (let i = 0, j = nums.length - 1; i < j; i++, j--) { 17 | let smallAns = nums[i] + nums[j]; 18 | ans = Math.max(smallAns, ans); 19 | } 20 | return ans; 21 | }; 22 | 23 | //we can choose to get the sum of the max and min, but that can be lesser 24 | //than the answer 25 | 26 | let nums = [4,1,5,1,2,5,1,5,5,4] 27 | console.log(minPairSum(nums)); 28 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/ProductLessThanK.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @param {number} k 4 | * @return {number} 5 | */ 6 | var numSubarrayProductLessThanK = function (nums, k) { 7 | if (k <= 1) return 0; 8 | let start = 0, 9 | end = 0, 10 | prod = 1, 11 | total = 0; 12 | while (end < nums.length) { 13 | prod *= nums[right]; 14 | while (prod >= k) { 15 | prod /= nums[start++]; 16 | } 17 | total += end - start + 1; 18 | end++; 19 | } 20 | return total; 21 | }; 22 | 23 | //by (end-start+1) we are enumarating all the subarrays that end with arr[end] 24 | 25 | let nums = [10, 5, 2, 6], 26 | k = 100; 27 | console.log(numSubarrayProductLessThanK(nums, k)); 28 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/RevealCardsInIncreasingOrder.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} deck 3 | * @return {number[]} 4 | */ 5 | var deckRevealedIncreasing = function (deck) { 6 | deck.sort((a, b) => b - a); 7 | let dq = []; 8 | for (let i = 0; i < deck.length; i++) { 9 | dq.length > 0 && dq.unshift(dq.pop()); 10 | dq.unshift(deck[i]); 11 | } 12 | return dq; 13 | }; 14 | 15 | let deck = [17, 13, 11, 2, 3, 5, 7]; 16 | console.log(deckRevealedIncreasing(deck)); 17 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/SubMaxAtleastKTimes.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @param {number} k 4 | * @return {number} 5 | */ 6 | var countSubarrays = function (nums, k) { 7 | let max = nums[0]; 8 | for (let i of nums) { 9 | max = Math.max(i, max); 10 | } 11 | let start = 0, 12 | end = 0, 13 | ans = 0, 14 | maxFreq = 0; 15 | while (end < nums.length) { 16 | maxFreq += nums[end] == max ? 1 : 0; 17 | while (maxFreq >= k) { 18 | maxFreq -= nums[start++] == max ? 1 : 0; 19 | } 20 | ans += start; 21 | end++; 22 | } 23 | return ans; 24 | }; 25 | 26 | let nums = [1, 4, 2, 1], 27 | k = 3; 28 | console.log(countSubarrays(nums, k)); 29 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/WinnerOfArrayGame.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} arr 3 | * @param {number} k 4 | * @return {number} 5 | */ 6 | var getWinner = function (arr, k) { 7 | let max = arr[0]; 8 | let streak = 0; 9 | for (let i = 1; i < arr.length; i++) { 10 | if (arr[i] > max) { 11 | max = arr[i]; 12 | streak = 1; 13 | } else { 14 | streak++; 15 | } 16 | if (streak >= k) break; 17 | } 18 | return max; 19 | }; 20 | 21 | let arr = [1, 9, 8, 2, 3, 7, 6, 4, 5], 22 | k = 7; 23 | console.log(getWinner(arr, k)); 24 | 25 | //a lot of things i can do in this question 26 | //basically find the first max among >=k elements 27 | -------------------------------------------------------------------------------- /javascript-dsa/arrays/powerKSizeSubarrays.ts: -------------------------------------------------------------------------------- 1 | function resultsArray(nums: number[], k: number): number[] { 2 | 3 | return []; 4 | }; -------------------------------------------------------------------------------- /javascript-dsa/backtracking/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/backtracking/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/backtracking/NumberOfBeautifulSubsets.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @param {number} k 4 | * @return {number} 5 | */ 6 | var beautifulSubsets = function (nums, k) { 7 | let map = new Map(); 8 | let answer = 0; 9 | const getAns = (start) => { 10 | if (map.size > 0) answer++; 11 | if (start >= nums.length) return; 12 | for (let i = start; i < nums.length; i++) { 13 | if (map.has(nums[i] - k) || map.has(nums[i] + k)) continue; 14 | map.set(nums[i], (map.get(nums[i]) || 0) + 1); 15 | getAns(i + 1); 16 | map.set(nums[i], map.get(nums[i]) - 1); 17 | if (map.get(nums[i]) === 0) map.delete(nums[i]); 18 | } 19 | }; 20 | getAns(0); 21 | return answer; 22 | }; 23 | 24 | // 11 13 13 1 1 2 3 113 25 | let nums = [1, 1, 2, 3], 26 | k = 1; 27 | console.log(beautifulSubsets(nums, k)); 28 | -------------------------------------------------------------------------------- /javascript-dsa/binarySearch/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/binarySearch/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/bitManipulation/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/bitManipulation/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/bitManipulation/HammingDistance.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number} x 3 | * @param {number} y 4 | * @return {number} 5 | */ 6 | var hammingDistance = function (x, y) { 7 | let newNo = x ^ y; 8 | let diff = parity(newNo); 9 | return diff; 10 | }; 11 | 12 | /** 13 | * 14 | * @param {number} n 15 | */ 16 | let parity = (n) => { 17 | let ones = 0; 18 | while (n > 0) { 19 | ones++; 20 | n &= n - 1; 21 | } 22 | return ones; 23 | }; 24 | 25 | /** 26 | * 27 | * @param {number} x 28 | * @param {number} y 29 | */ 30 | let hammingDistance2 = (x, y) => { 31 | let ans = 0; 32 | while (x != 0 || y != 0) { 33 | if (x % 2 != y % 2) ans++; 34 | x = (x / 2) | 0; 35 | y = (y / 2) | 0; 36 | } 37 | return ans; 38 | }; 39 | 40 | console.log(hammingDistance2(1, 4)); 41 | -------------------------------------------------------------------------------- /javascript-dsa/bitManipulation/NumberOf1Bits.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number} n - a positive integer 3 | * @return {number} 4 | */ 5 | var hammingWeight = function (n) { 6 | let num1 = 0; 7 | while (n != 0) { 8 | num1++; 9 | //remove one 1 from the binary representation 10 | n &= n - 1; 11 | } 12 | return num1; 13 | }; 14 | /** 15 | * method no 2 16 | * @param {number} n - a positive integer 17 | * @return {number} 18 | */ 19 | 20 | var util = (n) => { 21 | let count = 0; 22 | for (let i = 0; i < 32; i++) { 23 | //loop till 32 because of the constraints 24 | if (n & 1) { 25 | count++; 26 | } 27 | n >>= 1; 28 | } 29 | return count; 30 | }; 31 | 32 | console.log(hammingWeight(4294967293)); 33 | -------------------------------------------------------------------------------- /javascript-dsa/bitManipulation/PowerOfFour.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number} n 3 | * @return {boolean} 4 | */ 5 | var isPowerOfFour = function(n) { 6 | if(n == 1){ 7 | return true; 8 | }else if(n<=0){ 9 | return false; 10 | }else{ 11 | let logBase4 = Math.log(n)/Math.log(4); 12 | return (Math.round(logBase4) == logBase4); 13 | } 14 | }; 15 | 16 | //based on change of base rule 17 | console.log(isPowerOfFour(5)); -------------------------------------------------------------------------------- /javascript-dsa/bitManipulation/PrefixArrayOriginalXOR.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | /** 4 | * @param {number[]} pref 5 | * @return {number[]} 6 | */ 7 | var findArray = function (pref) { 8 | let ans = new Array(pref.length); 9 | ans[0] = pref[0]; 10 | for (let i = 0; i < pref.length - 1; i++) { 11 | ans[i + 1] = (pref[i] ^ pref[i + 1]); 12 | } 13 | return ans; 14 | }; 15 | let pref = [3, 4, 56, 76, 34]; 16 | console.log(findArray(pref)); 17 | 18 | // a ^ b = c 19 | // a ^ (a ^ b) = a ^ c 20 | // b = a ^ c -------------------------------------------------------------------------------- /javascript-dsa/dynamicProgramming/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/dynamicProgramming/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/graphs/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/graphs/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/greedy/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/greedy/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/greedy/EliminateMaxMonsters.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} dist 3 | * @param {number[]} speed 4 | * @return {number} 5 | */ 6 | var eliminateMaximum = function (dist, speed) { 7 | let time_to_city = dist.map((d,index)=>{ 8 | return d/speed[index]; 9 | }) 10 | time_to_city.sort((a,b)=>a-b); 11 | console.log(time_to_city); 12 | let time = 0; 13 | let monstersKilled = 0; 14 | for(let i of time_to_city){ 15 | if(i<=time){ 16 | break; 17 | }else{ 18 | time++; 19 | monstersKilled++; 20 | } 21 | } 22 | return monstersKilled; 23 | }; 24 | 25 | let dist = [3,2,4], 26 | speed = [5,3,2]; 27 | console.log(eliminateMaximum(dist, speed)); 28 | -------------------------------------------------------------------------------- /javascript-dsa/hashMapAndHeap/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/hashMapAndHeap/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/hashMapAndHeap/MakeStringAnagram.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {string} s 3 | * @param {string} t 4 | * @return {number} 5 | */ 6 | var minSteps = function (s, t) { 7 | //create the freq array 8 | let freq = new Array(26).fill(0); 9 | //fill the freq array with t 10 | for (let ch of t) { 11 | let index = ch.charCodeAt(0) - 97; 12 | freq[index]++; 13 | } 14 | //now decrease the characters common in both the strings 15 | for (let ch of s) { 16 | let index = ch.charCodeAt(0) - 97; 17 | freq[index]--; 18 | } 19 | //anything positive is uncommon 20 | let uncommon = 0; 21 | for (let i of freq) { 22 | if (i > 0) { 23 | uncommon += i; 24 | } 25 | } 26 | return uncommon; 27 | }; 28 | 29 | let s = "anagram", 30 | t = "mangaar"; 31 | console.log(minSteps(s, t)); 32 | -------------------------------------------------------------------------------- /javascript-dsa/linkedList/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/linkedList/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/math/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/math/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/searchingAndSorting/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/searchingAndSorting/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/stack/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/stack/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/stack/BuildAnArray.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} target 3 | * @param {number} n 4 | * @return {string[]} 5 | */ 6 | var buildArray = function (target, n) { 7 | let i = 0; 8 | let ans = []; 9 | for (let j = 1; j <= n; j++) { 10 | ans.push("Push"); 11 | if (target[i] == j) { 12 | i++; 13 | if (i == target.length) break; 14 | } else { 15 | ans.push("Pop"); 16 | } 17 | } 18 | return ans; 19 | }; 20 | 21 | let target = [1,5]; 22 | let n = 6; 23 | console.log(buildArray(target,n)); 24 | -------------------------------------------------------------------------------- /javascript-dsa/stack/ValidParentString.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {string} s 3 | * @return {boolean} 4 | */ 5 | var checkValidString = function (s) { 6 | let op = 0, 7 | cl = 0; 8 | for (let i = 0; i < s.length; i++) { 9 | if (s[i] == "(" || s[i] == "*") { 10 | op++; 11 | } else { 12 | cl++; 13 | } 14 | if (op - cl < 0) return false; 15 | } 16 | op = cl = 0; 17 | for (let i = s.length - 1; i >= 0; i--) { 18 | if (s[i] == ")" || s[i] == "*") { 19 | cl++; 20 | } else { 21 | op++; 22 | } 23 | if (cl - op < 0) return false; 24 | } 25 | return true; 26 | }; 27 | 28 | //the logic is to check if during -> there is no orphan ) and vice-versa.. -------------------------------------------------------------------------------- /javascript-dsa/strings/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/strings/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/strings/ChangesAlternateBinary.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {string} s 3 | * @return {number} 4 | */ 5 | var minOperations = function (s) { 6 | let way1 = 0; 7 | let way2 = 0; 8 | for (let i = 0; i < s.length; i++) { 9 | if (i & 1) { 10 | //odd 11 | if (s[i] == "1") { 12 | way1++; 13 | } else { 14 | way2++; 15 | } 16 | } else { 17 | //even 18 | if (s[i] == "0") { 19 | way1++; 20 | } else { 21 | way2++; 22 | } 23 | } 24 | } 25 | return Math.min(way1, way2); 26 | }; 27 | 28 | console.log(minOperations("10101010101010100101")); 29 | 30 | //example 31 | //10101010101010100101 32 | //simulataneously, we will take both the cases, start is 1 and start is 0 33 | //way1 would mean 01010101010101010.....(0 at odd) 34 | //way2 would mean 10100101010101....(0 at even) 35 | -------------------------------------------------------------------------------- /javascript-dsa/strings/DeletingSimilarEnds.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {string} s 3 | * @return {number} 4 | */ 5 | var minimumLength = function (s) { 6 | let start = 0, 7 | end = s.length - 1; 8 | while (start < end) { 9 | //as suffix and prefix cannot intersect 10 | if (s[start] == s[end]) { 11 | let theChar = s[start]; 12 | while (s[start] == theChar && start < end) { 13 | start++; 14 | } 15 | if (start == end) { 16 | //EDGE CASE 17 | return 0; 18 | } 19 | while (s[end] == theChar && start < end) { 20 | end--; 21 | } 22 | } else { 23 | //cannot proceed further 24 | break; 25 | } 26 | } 27 | return end - start + 1; 28 | }; 29 | 30 | let s = "aabccabba"; 31 | console.log(minimumLength(s)); 32 | -------------------------------------------------------------------------------- /javascript-dsa/strings/OptimalPartitionString.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {string} s 3 | * @return {number} 4 | */ 5 | var partitionString = function (s) { 6 | let ans = 0; 7 | let set = new Set(); 8 | for (let i = 0; i < s.length; i++) { 9 | if (set.has(s[i])) { 10 | ans++; 11 | set = new Set(); 12 | set.add(s[i]); 13 | } else { 14 | set.add(s[i]); 15 | } 16 | } 17 | if (!set.size == 0) ans++; 18 | return ans; 19 | }; 20 | 21 | let s = "abacaba"; 22 | console.log(partitionString(s)); 23 | -------------------------------------------------------------------------------- /javascript-dsa/strings/SortVowelsInAString.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {string} s 3 | * @return {string} 4 | */ 5 | var sortVowels = function (s) { 6 | let vowels = []; 7 | let charArr = s.split(""); 8 | for (let i = 0; i < s.length; i++) { 9 | let c = charArr[i].toLowerCase(); 10 | console.log(c); 11 | if (c == "a" || c == "e" || c == "i" || c == "o" || c == "u") { 12 | vowels.push(charArr[i]); 13 | charArr[i] = "#"; 14 | } 15 | } 16 | vowels.sort((a, b) => { 17 | if (a > b) { 18 | return 1; 19 | } else { 20 | return -1; 21 | } 22 | }); 23 | for (let i = 0; i < charArr.length; i++) { 24 | if (charArr[i] == "#") { 25 | charArr[i] = vowels.shift(); 26 | } 27 | } 28 | return charArr.join(""); 29 | }; 30 | 31 | let s = "lEetcOde"; 32 | console.log(sortVowels(s)); 33 | -------------------------------------------------------------------------------- /javascript-dsa/strings/StringHalvesAlike.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {string} s 3 | * @return {boolean} 4 | */ 5 | var halvesAreAlike = function (s) { 6 | //define the regex to check vowels 7 | let vowelsRegex = /[aeiou]/gi; 8 | //get both the valid strings 9 | let str1 = s.substring(0, s.length / 2); 10 | let str2 = s.substring(s.length / 2); 11 | //check weather both have the same number of vowels 12 | let match1 = str1.match(vowelsRegex); 13 | let match2 = str2.match(vowelsRegex); 14 | return ((match1 && match1.length) || 0) == ((match2 && match2.length) || 0); 15 | }; 16 | 17 | let s = "textbook"; 18 | console.log(halvesAreAlike(s)); 19 | 20 | //js regex works in the following way ---> /pattern/modifier(s); 21 | 22 | //construct the left and right array 23 | -------------------------------------------------------------------------------- /javascript-dsa/strings/SubstringsWithinBudget.js: -------------------------------------------------------------------------------- 1 | const tellDiff = (str1,str2,index)=>Math.abs(str1.charCodeAt(index)-str2.charCodeAt(index)); 2 | /** 3 | * @param {string} s 4 | * @param {string} t 5 | * @param {number} maxCost 6 | * @return {number} 7 | */ 8 | var equalSubstring = function(s, t, maxCost) { 9 | let start = 0,end = 0,answer = 1,window = 0; 10 | while(endmaxCost){ 13 | window-=tellDiff(s,t,start); 14 | start++; 15 | } 16 | answer = Math.max(answer,end-start+1); 17 | } 18 | return answer; 19 | }; 20 | 21 | let s = "abcd", t = "bcdf", maxCost = 3; 22 | console.log(equalSubstring(s,t,maxCost)); -------------------------------------------------------------------------------- /javascript-dsa/strings/ZigZagConversion.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {string} s 3 | * @param {number} numRows 4 | * @return {string} 5 | */ 6 | var convert = function (s, numRows) { 7 | if (numRows == 1) return s; 8 | let rows = new Array(Math.min(s.length, numRows)).fill(""); 9 | let goDown = true; 10 | let currentRow = 0; 11 | for (let ch of s) { 12 | rows[currentRow] += ch; 13 | currentRow += goDown ? 1 : -1; 14 | goDown = 15 | currentRow == 0 || currentRow == rows.length - 1 ? !goDown : goDown; 16 | } 17 | return rows.join(""); 18 | }; 19 | 20 | let s = "PAYPALISHIRING", 21 | numRows = 3; 22 | console.log(convert(s, numRows)); 23 | -------------------------------------------------------------------------------- /javascript-dsa/trees/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Abhaydutt2003/DataStructureAndAlgoPractice/e7b3bb1d5b44622af2fe77ad06ed36491d9ce8fa/javascript-dsa/trees/.DS_Store -------------------------------------------------------------------------------- /javascript-dsa/trees/SmallestString.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {TreeNode} root 3 | * @return {string} 4 | */ 5 | let smallestFromLeaf = (root) => { 6 | ans = ""; 7 | updateAns(root, ""); 8 | }; 9 | 10 | let ans = ""; 11 | 12 | let updateAns = (root, tillNow) => { 13 | if (root.left == null && root.right == null) { 14 | //lead node 15 | if (tillNow.length < ans || tillNow < ans || ans == "") { 16 | ans = tillNow; 17 | } 18 | return; 19 | }else if (root == null) { 20 | return; 21 | } 22 | console.log(String.fromCharCode(97 + root.val) + tillNow); 23 | updateAns(root.left, String.fromCharCode(97 + root.val) + tillNow); 24 | updateAns(root.right, String.fromCharCode(97 + root.val) + tillNow); 25 | }; 26 | -------------------------------------------------------------------------------- /python-dsa/binary-trees/lca.py: -------------------------------------------------------------------------------- 1 | # Definition for a binary tree node. 2 | class TreeNode: 3 | def __init__(self, x): 4 | self.val = x 5 | self.left = None 6 | self.right = None 7 | 8 | class Solution: 9 | def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode': 10 | def dfs(node)->'TreeNode': 11 | if not node: 12 | return None 13 | if node == p or node == q: 14 | return node 15 | left = dfs(node.left) 16 | right = dfs(node.right) 17 | if left and right: 18 | return node 19 | return left if left else right 20 | return dfs(root) 21 | 22 | -------------------------------------------------------------------------------- /python-dsa/binary-trees/reverseOddLevels.py: -------------------------------------------------------------------------------- 1 | class TreeNode: 2 | def __init__(self, val=0, left=None, right=None): 3 | self.val = val 4 | self.left = left 5 | self.right = right 6 | 7 | # class Solution: 8 | # def reverseOddLevels(self, root: Optional[TreeNode]) -> Optional[TreeNode]: 9 | -------------------------------------------------------------------------------- /python-dsa/binary-trees/traversals.py: -------------------------------------------------------------------------------- 1 | # Definition for a binary tree node. 2 | class TreeNode: 3 | def __init__(self, val=0, left=None, right=None): 4 | self.val = val 5 | self.left = left 6 | self.right = right 7 | 8 | 9 | 10 | 11 | class Solution: 12 | def preorderTraversal(self, root: Optional[TreeNode]) -> List[int]: 13 | if(root == None): 14 | return [] 15 | left = self.preorderTraversal(root.left) 16 | right = self.preorderTraversal(root.right) 17 | 18 | 19 | 20 | 21 | -------------------------------------------------------------------------------- /python-dsa/bit-manipulation/MinimizeXOR.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def minimizeXor(self, num1: int, num2: int) -> int: 3 | -------------------------------------------------------------------------------- /python-dsa/dynamic-programming/targetSum.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def findTargetSumWays(self, nums: List[int], target: int) -> int: 3 | arrSum = sum(nums) 4 | if arrSum < target or (target+arrSum)%2 != 0: 5 | return 0 6 | -------------------------------------------------------------------------------- /python-dsa/graphs/numberOfProvinces.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def findCircleNum(self, isConnected: List[List[int]]) -> int: 3 | 4 | 5 | 6 | solution_instance = Solution() 7 | isConnected = [[1,1,0],[1,1,0],[0,0,1]] 8 | answer = solution_instance.findCircleNum(isConnected) 9 | print(answer) -------------------------------------------------------------------------------- /python-dsa/graphs/rottingoranges.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def orangesRotting(self, grid: List[List[int]]) -> int: 3 | -------------------------------------------------------------------------------- /python-dsa/lists/continousSubarrays.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def continuousSubarrays(self, nums: List[int]) -> int: 3 | freq = {} 4 | left = 0 5 | right = 0 6 | count = 0 7 | while right < len(nums): 8 | freq[nums[right]] = freq.get(nums[right],0)+1 9 | while max(freq) -min(freq) >2: 10 | freq[nums[left]]-=1 11 | if(freq[nums[left]] == 0): 12 | del freq[nums[left]] 13 | left+=1 14 | count +=right-left+1 15 | right+=1 16 | return count 17 | -------------------------------------------------------------------------------- /python-dsa/priority-queue/KMultiplicationOperations.py: -------------------------------------------------------------------------------- 1 | import heapq 2 | from typing import List 3 | 4 | class Solution: 5 | def getFinalState(self, nums: List[int], k: int, multiplier: int) -> List[int]: 6 | pq = [] 7 | # add all the elements in the pq 8 | for i in range(len(nums)): 9 | pq.append([nums[i], i]) 10 | heapq.heapify(pq) 11 | 12 | return pq 13 | 14 | solution_instance = Solution() 15 | nums = [2,1,3,5,6] 16 | k = 5, 17 | multiplier = 2 18 | result = solution_instance.getFinalState(nums,k,multiplier) 19 | print(result) -------------------------------------------------------------------------------- /python-dsa/priority-queue/exceedThresholdValue2.py: -------------------------------------------------------------------------------- 1 | import heapq 2 | from typing import List 3 | 4 | class Solution: 5 | def minOperations(self, nums: List[int], k: int) -> int: 6 | pq = [] 7 | for num in nums: 8 | heapq.heappush(pq,num) 9 | operations = 0 10 | while pq and pq[0] < k: 11 | newSmallest = (heapq.heappop(pq)*2)+(heapq.heappop(pq)) 12 | heapq.heappush(pq,newSmallest) 13 | operations+=1 14 | return operations 15 | 16 | solutionInstance = Solution() 17 | nums = [1,1,2,4,9] 18 | k = 20 19 | answer = solutionInstance.minOperations(nums,k) 20 | print(answer) -------------------------------------------------------------------------------- /python-dsa/priority-queue/maximumAveragePassRation.py: -------------------------------------------------------------------------------- 1 | import heapq 2 | -------------------------------------------------------------------------------- /python-dsa/stacks/nge1.py: -------------------------------------------------------------------------------- 1 | from typing import List 2 | class Solution: 3 | 4 | 5 | 6 | 7 | def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]: 8 | map = {} 9 | stack = [] 10 | for num in nums2: 11 | while stack and stack[-1] List[int]: 3 | map = {} 4 | stack = [] 5 | 6 | def traveseNums(): 7 | for num in nums: 8 | while stack and stack[-1] < num: 9 | map[stack.pop()] = num 10 | stack.append(num) 11 | 12 | # traveseNums() 13 | # if stack: 14 | # traveseNums() 15 | return [map.get(num) for num in nums] 16 | 17 | -------------------------------------------------------------------------------- /python-dsa/stacks/specialDiscountInShop.py: -------------------------------------------------------------------------------- 1 | from typing import List 2 | class Solution: 3 | def finalPrices(self, prices: List[int]) -> List[int]: 4 | stack = [] 5 | for i in range(len(prices)): 6 | # update all the prices behind that are greater 7 | while (stack and prices[stack[-1]]>=prices[i]): 8 | toUpdate = stack.pop() 9 | prices[toUpdate]-=prices[i] 10 | stack.append(i); 11 | return prices 12 | 13 | 14 | solIns = Solution() 15 | prices = [10,1,1,6] 16 | result = solIns.finalPrices(prices) 17 | print(result) -------------------------------------------------------------------------------- /python-dsa/stacks/trappingRainWater.py: -------------------------------------------------------------------------------- 1 | from typing import List 2 | 3 | 4 | class Solution: 5 | def trap(self, height: List[int]) -> int: 6 | ans = 0 7 | stack = [] # monotonic 8 | for i in range(len(height)): 9 | while stack and height[stack[-1]] < height[i]: 10 | middle = stack.pop() 11 | if not stack: 12 | break 13 | left = stack[-1] 14 | currentHeight = min(height[i], height[left]) - height[middle] 15 | width = i - left - 1 16 | ans += currentHeight * width 17 | stack.append(i) 18 | return ans 19 | 20 | 21 | arr = [0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1] 22 | -------------------------------------------------------------------------------- /python-dsa/strings/letterTilePossibilities.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def numTilePossibilities(self, tiles: str) -> int: 3 | -------------------------------------------------------------------------------- /python-dsa/strings/removeAllOccurencesOfASubstring.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def removeOccurrences(self, s: str, part: str) -> str: 3 | -------------------------------------------------------------------------------- /typescript-dsa/javascript/binarySearch/SplitArrayLargestSum.js: -------------------------------------------------------------------------------- 1 | "use strict"; 2 | function splitArray(nums, k) { 3 | return 1; 4 | } 5 | ; 6 | let nums = [7, 2, 5, 10, 8], k = 2; 7 | console.log(splitArray(nums, k)); 8 | -------------------------------------------------------------------------------- /typescript-dsa/javascript/hashtable/CheckIfN.js: -------------------------------------------------------------------------------- 1 | "use strict"; 2 | function checkIfExist(arr) { 3 | const map = new Set(); 4 | for (let i = 0; i < arr.length; i++) { 5 | if (map.has(arr[i] * 2) || map.has(arr[i] / 2)) { 6 | return true; 7 | } 8 | map.add(arr[i]); 9 | } 10 | return false; 11 | } 12 | const testArr = [3, 1, 7, 11]; 13 | console.log(checkIfExist(testArr)); 14 | -------------------------------------------------------------------------------- /typescript-dsa/typescript/Hashtable/CheckIfN.ts: -------------------------------------------------------------------------------- 1 | function checkIfExist(arr: number[]): boolean { 2 | const map = new Set(); 3 | for (let i = 0; i < arr.length; i++) { 4 | if (map.has(arr[i] * 2) || map.has(arr[i] / 2)) { 5 | return true; 6 | } 7 | map.add(arr[i]); 8 | } 9 | return false; 10 | } 11 | 12 | const testArr = [3,1,7,11]; 13 | console.log(checkIfExist(testArr)); 14 | -------------------------------------------------------------------------------- /typescript-dsa/typescript/binarySearch/SplitArrayLargestSum.ts: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | function splitArray(nums: number[], k: number): number { 5 | return 1; 6 | }; 7 | 8 | let nums = [7,2,5,10,8], k = 2; 9 | console.log(splitArray(nums,k)); --------------------------------------------------------------------------------