Name	Name	Last commit message	Last commit date
Latest commit History 162 Commits
DPWithBitmasking	DPWithBitmasking
BFS-Minimum Cost Path .cpp	BFS-Minimum Cost Path .cpp
Best Time to Buy and Sell Stock with Cooldown.cpp	Best Time to Buy and Sell Stock with Cooldown.cpp
BestTimeToBuyAndSell-1014. Best Sightseeing Pair.cpp	BestTimeToBuyAndSell-1014. Best Sightseeing Pair.cpp
BestTimeToBuyAndSell-121. Best Time to Buy and Sell Stock.cpp	BestTimeToBuyAndSell-121. Best Time to Buy and Sell Stock.cpp
BestTimeToBuyAndSell-122. Best Time to Buy and Sell Stock II.cpp	BestTimeToBuyAndSell-122. Best Time to Buy and Sell Stock II.cpp
BestTimeToBuyAndSell-188. Best Time to Buy and Sell Stock IV.cpp	BestTimeToBuyAndSell-188. Best Time to Buy and Sell Stock IV.cpp
BestTimeToBuyAndSell-714. Best Time to Buy and Sell Stock with Transaction Fee.cpp	BestTimeToBuyAndSell-714. Best Time to Buy and Sell Stock with Transaction Fee.cpp
CF-714div2c.cpp	CF-714div2c.cpp
CatalanNumber-96. Unique Binary Search Trees.cpp	CatalanNumber-96. Unique Binary Search Trees.cpp
DP-1031. Maximum Sum of Two Non-Overlapping Subarrays.cpp	DP-1031. Maximum Sum of Two Non-Overlapping Subarrays.cpp
DP-115. Distinct Subsequences.cpp	DP-115. Distinct Subsequences.cpp
DP-1641. Count Sorted Vowel Strings.cpp	DP-1641. Count Sorted Vowel Strings.cpp
DP-174. Dungeon Game.cpp	DP-174. Dungeon Game.cpp
DP-343. Integer Break.cpp	DP-343. Integer Break.cpp
DP-467. Unique Substrings in Wraparound String.cpp	DP-467. Unique Substrings in Wraparound String.cpp
DP-740. Delete and Earn.cpp	DP-740. Delete and Earn.cpp
DP-764. Largest Plus Sign.cpp	DP-764. Largest Plus Sign.cpp
DP-978. Longest Turbulent Subarray.cpp	DP-978. Longest Turbulent Subarray.cpp
DP-BalacedBinaryTreeCounter.cpp	DP-BalacedBinaryTreeCounter.cpp
DP-CoinCombination.cpp	DP-CoinCombination.cpp
DP-EditDistance.cpp	DP-EditDistance.cpp
DP-FriendsPairingProblem.cpp	DP-FriendsPairingProblem.cpp
DP-GoldMineProblem.cpp	DP-GoldMineProblem.cpp
DP-LIS-446. Arithmetic Slices II - Subsequence.cpp	DP-LIS-446. Arithmetic Slices II - Subsequence.cpp
DP-Longest Arithmetic Subsequence of Given Difference.cpp	DP-Longest Arithmetic Subsequence of Given Difference.cpp
DP-MinCostStairs.cpp	DP-MinCostStairs.cpp
DP-PairWithSpecificDiff.cpp	DP-PairWithSpecificDiff.cpp
DP-PerfectSquares.cpp	DP-PerfectSquares.cpp
DP-PredictWinnerofGame.cpp	DP-PredictWinnerofGame.cpp
DP-SubsetSum..cpp	DP-SubsetSum..cpp
DP-Target-Sum.cpp	DP-Target-Sum.cpp
DP-Triangle.cpp	DP-Triangle.cpp
DP-UnboundedKnapsack.cpp	DP-UnboundedKnapsack.cpp
DP-bookShop.cpp	DP-bookShop.cpp
DP-coinChange.cpp	DP-coinChange.cpp
DP-coinChange2.cpp	DP-coinChange2.cpp
DP-decode-ways.cpp	DP-decode-ways.cpp
DP-divisor game.cpp	DP-divisor game.cpp
DP-houseRobber1.cpp	DP-houseRobber1.cpp
DP-houseRobberII.cpp	DP-houseRobberII.cpp
DP-jump-game-ii.cpp	DP-jump-game-ii.cpp
DP-knapsackZeroOne.cpp	DP-knapsackZeroOne.cpp
DP-largestSquare.cpp	DP-largestSquare.cpp
DP-lcsOFthreeString.cpp	DP-lcsOFthreeString.cpp
DP-lonestPalindrmicSubstrin.cpp	DP-lonestPalindrmicSubstrin.cpp
DP-longesAlterntiveSubsequence.cpp	DP-longesAlterntiveSubsequence.cpp
DP-longestCommonSubstring.cpp	DP-longestCommonSubstring.cpp
DP-longestIncreasingSeq-o(nlogn).cpp	DP-longestIncreasingSeq-o(nlogn).cpp
DP-longestIncreasingSeq.cpp	DP-longestIncreasingSeq.cpp
DP-longestSequenceDiffOne.cpp	DP-longestSequenceDiffOne.cpp
DP-matrixChainMulti.cpp	DP-matrixChainMulti.cpp
DP-maxDiffofZeroOnes.cpp	DP-maxDiffofZeroOnes.cpp
DP-maximizeCutSegment.cpp	DP-maximizeCutSegment.cpp
DP-maximumSumIncreasingSubseq.cpp	DP-maximumSumIncreasingSubseq.cpp
DP-minCosttoFillBag.cpp	DP-minCosttoFillBag.cpp
DP-minJumpGameII.cpp	DP-minJumpGameII.cpp
DP-minRemovalTomakeMinMaxdifflessthanequaltoK.cpp	DP-minRemovalTomakeMinMaxdifflessthanequaltoK.cpp
DP-paintfaince.cpp	DP-paintfaince.cpp
DP-partionEqualSubset.cpp	DP-partionEqualSubset.cpp
DP-productSum.cpp	DP-productSum.cpp
DP-reachGivenScore.cpp	DP-reachGivenScore.cpp
DP-smallestSumContigousArray.cpp	DP-smallestSumContigousArray.cpp
DP-subsequenceLessThanK.cpp	DP-subsequenceLessThanK.cpp
DP-uniquePath.cpp	DP-uniquePath.cpp
DP-wordBreak.cpp	DP-wordBreak.cpp
DPOnString-2222. Number of Ways to Select Buildings.cpp	DPOnString-2222. Number of Ways to Select Buildings.cpp
DPOnTrees-337. House Robber III.cpp	DPOnTrees-337. House Robber III.cpp
DigitDP-357. Count Numbers with Unique Digits.cpp	DigitDP-357. Count Numbers with Unique Digits.cpp
Fibonacci-Count ways to reach the n'th stair .cpp	Fibonacci-Count ways to reach the n'th stair .cpp
Kadane-Algo-1567. Maximum Length of Subarray With Positive Product.cpp	Kadane-Algo-1567. Maximum Length of Subarray With Positive Product.cpp
Kadane-Algo-918. Maximum Sum Circular Subarray.cpp	Kadane-Algo-918. Maximum Sum Circular Subarray.cpp
Knapsack-1402. Reducing Dishes.cpp	Knapsack-1402. Reducing Dishes.cpp
Knapsack-2140. Solving Questions With Brainpower.cpp	Knapsack-2140. Solving Questions With Brainpower.cpp
Knapsack-377. Combination Sum IV.cpp	Knapsack-377. Combination Sum IV.cpp
Knapscak474. Ones and Zeroes.cpp	Knapscak474. Ones and Zeroes.cpp
LCS-1048. Longest String Chain.cpp	LCS-1048. Longest String Chain.cpp
LCS-1092. Shortest Common Supersequence.cpp	LCS-1092. Shortest Common Supersequence.cpp
LCS-115. Distinct Subsequences.cpp	LCS-115. Distinct Subsequences.cpp
LCS-1312. Minimum Insertion Steps to Make a String Palindrome.cpp	LCS-1312. Minimum Insertion Steps to Make a String Palindrome.cpp
LCS-32. Longest Valid Parentheses.cpp	LCS-32. Longest Valid Parentheses.cpp
LCS-392. Is Subsequence.cpp	LCS-392. Is Subsequence.cpp
LCS-5. Longest Palindromic Substring.cpp	LCS-5. Longest Palindromic Substring.cpp
LCS-583. Delete Operation for Two Strings.cpp	LCS-583. Delete Operation for Two Strings.cpp
LCS-97. Interleaving String.cpp	LCS-97. Interleaving String.cpp
LCS-Palindromic Substrings.cpp	LCS-Palindromic Substrings.cpp
LCS-longestPalindromicSubsequence.cpp	LCS-longestPalindromicSubsequence.cpp
LCS-longestcommonSequence.cpp	LCS-longestcommonSequence.cpp
LCS-printing longest common sequence.cpp	LCS-printing longest common sequence.cpp
LIS-1691. Maximum Height by Stacking Cuboids.cpp	LIS-1691. Maximum Height by Stacking Cuboids.cpp
LIS-2111. Minimum Operations to Make the Array K-Increasing.cpp	LIS-2111. Minimum Operations to Make the Array K-Increasing.cpp
LIS-354. Russian Doll Envelopes.cpp	LIS-354. Russian Doll Envelopes.cpp
LIS-368. Largest Divisible Subset.cpp	LIS-368. Largest Divisible Subset.cpp
LIS-646. Maximum Length of Pair Chain.cpp	LIS-646. Maximum Length of Pair Chain.cpp
Lcs-memoization-tabulation-Minimum ASCII Delete Sum for Two Strings.cpp	Lcs-memoization-tabulation-Minimum ASCII Delete Sum for Two Strings.cpp
LinearDP-1510. Stone Game IV.cpp	LinearDP-1510. Stone Game IV.cpp
LinearDP-1526. Minimum Number of Increments on Subarrays to Form a Target Array.cpp	LinearDP-1526. Minimum Number of Increments on Subarrays to Form a Target Array.cpp
LinearDP-2110. Number of Smooth Descent Periods of a Stock.cpp	LinearDP-2110. Number of Smooth Descent Periods of a Stock.cpp
LinearDP-413. Arithmetic Slices.cpp	LinearDP-413. Arithmetic Slices.cpp
LinearDP-jump-game.cpp	LinearDP-jump-game.cpp

Name

Last commit message

Last commit date

162 Commits

DPWithBitmasking

BFS-Minimum Cost Path .cpp

Best Time to Buy and Sell Stock with Cooldown.cpp

BestTimeToBuyAndSell-1014. Best Sightseeing Pair.cpp

BestTimeToBuyAndSell-121. Best Time to Buy and Sell Stock.cpp

BestTimeToBuyAndSell-122. Best Time to Buy and Sell Stock II.cpp

BestTimeToBuyAndSell-188. Best Time to Buy and Sell Stock IV.cpp

BestTimeToBuyAndSell-714. Best Time to Buy and Sell Stock with Transaction Fee.cpp