Home

welocome

1. Eggdrop dynamic programingEggDrop.java

2.Edit Distance Dynamic programmingEditDistance.java

3.Graph traversalBFS

4.Graph traversalDFS

5.MST(greedy algo)PRIM"S

6.Binary Search TreeBST

7.hasPathSum(BST)HasPathSum NumberOfLeafNodes 8.isBalancedBstIsBalancedBst

9.NumberOfFullNodesNumberOfFullNodes

10.NumberOFLeafNodesNumberOfLeafNodes

11.PrintAllAncestorprintAllAncestor

12.sortedArrayToBstSortedArrayToBSt

13.TreeToLinkedListTreeToLinkedLIst

14.DistanceRootToGivenNodeDistanceRootToGivenNode

15.FractionalKnapsack(greedy)FractionalKnapsack

16.ActivitySelectionProblem(greedy)ActivitySelection

17.JobsequencingWithDeadLine(greedy)JobSequencing