Skip to content

kanukolluGVT/CP-and-DSA

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

60 Commits
optimization101/Modeling_Session_1
optimization101/Modeling_Session_1
 
 
1.cpp
1.cpp
 
 
1.exe
1.exe
 
 
CP.sublime-build
CP.sublime-build
 
 
Dijkstras.py
Dijkstras.py
 
 
Greedy-1-ActivitySelectionProblem.cpp
Greedy-1-ActivitySelectionProblem.cpp
 
 
Greedy-10-MaximumProductSubSetOfAnArray.cpp
Greedy-10-MaximumProductSubSetOfAnArray.cpp
 
 
Greedy-11-MaximumArraySumAfterKNegations.cpp
Greedy-11-MaximumArraySumAfterKNegations.cpp
 
 
Greedy-12-ProgramForShortestJobFirst(sfj)CPUScheduling.cpp
Greedy-12-ProgramForShortestJobFirst(sfj)CPUScheduling.cpp
 
 
Greedy-13-SmallestSubSetSumWithGreaterThanAllOtherElements.cpp
Greedy-13-SmallestSubSetSumWithGreaterThanAllOtherElements.cpp
 
 
Greedy-13-SmallestSubSetSumWithGreaterThanAllOtherElements.exe
Greedy-13-SmallestSubSetSumWithGreaterThanAllOtherElements.exe
 
 
Greedy-14-DEFKINDefenceOfAKindomSpojQuestion.cpp
Greedy-14-DEFKINDefenceOfAKindomSpojQuestion.cpp
 
 
Greedy-15-DIEHARD-DieHardSpojQuestion.cpp
Greedy-15-DIEHARD-DieHardSpojQuestion.cpp
 
 
Greedy-16-GERGOVIA-WineTradingInGergoviaSpojQuestion.cpp
Greedy-16-GERGOVIA-WineTradingInGergoviaSpojQuestion.cpp
 
 
Greedy-17-ArrangeArrangingAmplifiersSpojQuestion.cpp
Greedy-17-ArrangeArrangingAmplifiersSpojQuestion.cpp
 
 
Greedy-18-MinimumCostOFRopes.cpp
Greedy-18-MinimumCostOFRopes.cpp
 
 
Greedy-19-FindTheSmallestNumberWithGivenNumberOfDigitsAndSumOfDigits.cpp
Greedy-19-FindTheSmallestNumberWithGivenNumberOfDigitsAndSumOfDigits.cpp
 
 
Greedy-2-JobSequencingProblem.cpp
Greedy-2-JobSequencingProblem.cpp
 
 
Greedy-20-FindTheMaximumSumEqualSumOfThreeStacks.cpp
Greedy-20-FindTheMaximumSumEqualSumOfThreeStacks.cpp
 
 
Greedy-3-FractionalKnapsackProblem.cpp
Greedy-3-FractionalKnapsackProblem.cpp
 
 
Greedy-4-ChooseAndSwap.cpp
Greedy-4-ChooseAndSwap.cpp
 
 
Greedy-5-MinimumPlatformsProblem.cpp
Greedy-5-MinimumPlatformsProblem.cpp
 
 
Greedy-6-BuyMaximumStocksIfIStocksCanBeBoughtOnIthDay.cpp
Greedy-6-BuyMaximumStocksIfIStocksCanBeBoughtOnIthDay.cpp
 
 
Greedy-7-FindTheMinimumAndMaximumAmountToBuyAllNCandies.cpp
Greedy-7-FindTheMinimumAndMaximumAmountToBuyAllNCandies.cpp
 
 
Greedy-8-MinimumCostToCutBoardIntpSquaresChocola-ChocolateSpoj.cpp
Greedy-8-MinimumCostToCutBoardIntpSquaresChocola-ChocolateSpoj.cpp
 
 
Greedy-8-MinimumCostToCutBoardIntpSquaresChocola-ChocolateSpoj.exe
Greedy-8-MinimumCostToCutBoardIntpSquaresChocola-ChocolateSpoj.exe
 
 
Greedy-9-CheckIfItIsPossibleToSurviveAnIsland.cpp
Greedy-9-CheckIfItIsPossibleToSurviveAnIsland.cpp
 
 
Greedy-9-CheckIfItIsPossibleToSurviveAnIsland.exe
Greedy-9-CheckIfItIsPossibleToSurviveAnIsland.exe
 
 
INTEST - Enormous Input Test.py
INTEST - Enormous Input Test.py
 
 
L-10.1_bfs.cpp
L-10.1_bfs.cpp
 
 
L-10.2.cpp
L-10.2.cpp
 
 
L-10.3.cpp
L-10.3.cpp
 
 
L-10.4.cpp
L-10.4.cpp
 
 
L-11.cpp
L-11.cpp
 
 
L-8.1.cpp
L-8.1.cpp
 
 
README.md
README.md
 
 
adjacencylist.cpp
adjacencylist.cpp
 
 
anagram.py
anagram.py
 
 
bfs_example.py
bfs_example.py
 
 
binary_search.py
binary_search.py
 
 
binarytree-1-levelordertraversal.cpp
binarytree-1-levelordertraversal.cpp
 
 
binarytree-10-zigzagtraversaloftree.cpp
binarytree-10-zigzagtraversaloftree.cpp
 
 
binarytree-11-BalancedOrNot.cpp
binarytree-11-BalancedOrNot.cpp
 
 
binarytree-12-DiagonalTraverselOfATree.cpp
binarytree-12-DiagonalTraverselOfATree.cpp
 
 
binarytree-13-boundaryTraversal.cpp
binarytree-13-boundaryTraversal.cpp
 
 
binarytree-14-BTtolDoublyLinkedList.cpp
binarytree-14-BTtolDoublyLinkedList.cpp
 
 
binarytree-14-BTtolDoublyLinkedList.exe
binarytree-14-BTtolDoublyLinkedList.exe
 
 
binarytree-15-BTintoSumTree.cpp
binarytree-15-BTintoSumTree.cpp
 
 
binarytree-16-CBTfromIPT.cpp
binarytree-16-CBTfromIPT.cpp
 
 
binarytree-17-IfSumTreeOrNot.cpp
binarytree-17-IfSumTreeOrNot.cpp
 
 
binarytree-18-checkIfBTHasDuplicateSubTree.cpp
binarytree-18-checkIfBTHasDuplicateSubTree.cpp
 
 
binarytree-19-LeafNodesSameLevelOrNot.cpp
binarytree-19-LeafNodesSameLevelOrNot.cpp
 
 
binarytree-2-reverselevelordertraversal.cpp
binarytree-2-reverselevelordertraversal.cpp
 
 
binarytree-20-sumOfNodesOfLongestPathFromRootToLeaf.cpp
binarytree-20-sumOfNodesOfLongestPathFromRootToLeaf.cpp
 
 
binarytree-21-LargestSubTreeSumInATree.cpp
binarytree-21-LargestSubTreeSumInATree.cpp
 
 
binarytree-22- maxSumInBTNoTwoAreAdjacent.cpp
binarytree-22- maxSumInBTNoTwoAreAdjacent.cpp
 
 
binarytree-23-KSumPathInABT.cpp
binarytree-23-KSumPathInABT.cpp
 
 
binarytree-24-LCAInABT.cpp
binarytree-24-LCAInABT.cpp
 
 
binarytree-25-TreeIsomorphism.cpp
binarytree-25-TreeIsomorphism.cpp
 
 
binarytree-26-DistnceBWTwoNodesInABT.cpp
binarytree-26-DistnceBWTwoNodesInABT.cpp
 
 
binarytree-3-HeightOfATree.cpp
binarytree-3-HeightOfATree.cpp
 
 
binarytree-4-DiameterOfATree.cpp
binarytree-4-DiameterOfATree.cpp
 
 
binarytree-5-MirrorOfATree.cpp
binarytree-5-MirrorOfATree.cpp
 
 
binarytree-6-LeftViewOfATree.cpp
binarytree-6-LeftViewOfATree.cpp
 
 
binarytree-7-RightViewOfATree.cpp
binarytree-7-RightViewOfATree.cpp
 
 
binarytree-8-topViewOfATree.cpp
binarytree-8-topViewOfATree.cpp
 
 
binarytree-9-bottomViewOfATree.cpp
binarytree-9-bottomViewOfATree.cpp
 
 
bipartaite.cpp
bipartaite.cpp
 
 
bst-1-SearchingAndInsetionInAbst.cpp
bst-1-SearchingAndInsetionInAbst.cpp
 
 
bst-10-MergeTwobst.cpp
bst-10-MergeTwobst.cpp
 
 
bst-11-FindTheKthLargestAndKthSmallestInABST.cpp
bst-11-FindTheKthLargestAndKthSmallestInABST.cpp
 
 
bst-12-CountPairsFromTwobstWhoseSumIsEqualToGivenValueX.cpp
bst-12-CountPairsFromTwobstWhoseSumIsEqualToGivenValueX.cpp
 
 
bst-13-FindMedianOfABSTInO(N)Time.cpp
bst-13-FindMedianOfABSTInO(N)Time.cpp
 
 
bst-14-ReplaceEveryElementWithTheLeastGreaterElementOnItsRight.cpp
bst-14-ReplaceEveryElementWithTheLeastGreaterElementOnItsRight.cpp
 
 
bst-15-CountbstNodesThatLieInTheGivenRange.cpp
bst-15-CountbstNodesThatLieInTheGivenRange.cpp
 
 
bst-16-CheckWhetherbstContainsDeadEnd.cpp
bst-16-CheckWhetherbstContainsDeadEnd.cpp
 
 
bst-17-LargestbstInABinaryTree.cpp
bst-17-LargestbstInABinaryTree.cpp
 
 
bst-18-FlattenbstToSortedList.cpp
bst-18-FlattenbstToSortedList.cpp
 
 
bst-2-FindMinAndMaxInAbst.cpp
bst-2-FindMinAndMaxInAbst.cpp
 
 
bst-3-FindInorderSuccesorAndPredecessorInAbst.cpp
bst-3-FindInorderSuccesorAndPredecessorInAbst.cpp
 
 
bst-4-DeletionOfANodeInbst.cpp
bst-4-DeletionOfANodeInbst.cpp
 
 
bst-5-CheckIfATreeIsAbstOrNot.cpp
bst-5-CheckIfATreeIsAbstOrNot.cpp
 
 
bst-6-PopulateInorederSuccesorOfAllNodes.cpp
bst-6-PopulateInorederSuccesorOfAllNodes.cpp
 
 
bst-7-FindLCAOf2NodesInAbst.cpp
bst-7-FindLCAOf2NodesInAbst.cpp
 
 
bst-8-ConvertBinaryTreeIntobst.cpp
bst-8-ConvertBinaryTreeIntobst.cpp
 
 
bst-9-ConvertNormalbstIntoABalncedbst.cpp
bst-9-ConvertNormalbstIntoABalncedbst.cpp
 
 
connectedcomponents.cpp
connectedcomponents.cpp
 
 
cpp14.sublime-build
cpp14.sublime-build
 
 
cycle detection.cpp
cycle detection.cpp
 
 
dfs.cpp
dfs.cpp
 
 
dfs_1.cpp
dfs_1.cpp
 
 
dp-1-KnapSackRecursion.cpp
dp-1-KnapSackRecursion.cpp
 
 
dp-10-RodCutting.cpp
dp-10-RodCutting.cpp
 
 
dp-11-CoinChangeProblemMaximumNumberOfWays.cpp
dp-11-CoinChangeProblemMaximumNumberOfWays.cpp
 
 
dp-12-CoinChangeProblemMinimumNumberOfCoins.cpp
dp-12-CoinChangeProblemMinimumNumberOfCoins.cpp
 
 
dp-13-LongestCommonSubSequenceRecursive.cpp
dp-13-LongestCommonSubSequenceRecursive.cpp
 
 
dp-13-LongestCommonSubSequenceRecursive.exe
dp-13-LongestCommonSubSequenceRecursive.exe
 
 
dp-14-LongestCommonSubSequenceMemoization.cpp
dp-14-LongestCommonSubSequenceMemoization.cpp
 
 
dp-14-LongestCommonSubSequenceMemoization.exe
dp-14-LongestCommonSubSequenceMemoization.exe
 
 
dp-15-LongestCommonSubSequenceTopDown.cpp
dp-15-LongestCommonSubSequenceTopDown.cpp
 
 

Repository files navigation

cp

This Repo contains codes of the book "GROKKING ALGORITHMS by Aditya Y Bhargava" and "competitive programming in python 128 algorithms to develop your coding skills" and DSA sheet of lovebabbar and striver and codencode

leetcode :- "https://leetcode.com/KanukolluGVT/"

250+problems on leetcode

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

6 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages