GitHub - bhumikamudgal/DS-in-C-: Coding Ninja Course: Data Structures in C++

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 139 Commits
AllWays(DP)		AllWays(DP)
AppendLastNToFirst		AppendLastNToFirst
BFS(Graph)		BFS(Graph)
BSTClass		BSTClass
BSTtoSortedLL		BSTtoSortedLL
BalancedParenthesis		BalancedParenthesis
BinaryTree		BinaryTree
CheckRedundantBrackets		CheckRedundantBrackets
ComplexNumClass		ComplexNumClass
ConstructBST		ConstructBST
ContainsX		ContainsX
CountLeafNodes		CountLeafNodes
CountNodes		CountNodes
DFS		DFS
DFS-BFS(Discon)		DFS-BFS(Discon)
DeleteEveryNNodes		DeleteEveryNNodes
DeleteLL(Rec)		DeleteLL(Rec)
Destructor		Destructor
DynamicQueue		DynamicQueue
DynamicStack		DynamicStack
EditDist(DP)		EditDist(DP)
EditDist(Memo)		EditDist(Memo)
EditDist(Rec)		EditDist(Rec)
EvenAfterOddLL		EvenAfterOddLL
ExtractUniqueChar		ExtractUniqueChar
Fibonacci1		Fibonacci1
Fibonacci2		Fibonacci2
FindHeight		FindHeight
FindNode(BT)		FindNode(BT)
FindNodeLL		FindNodeLL
FindNodeLL(Rec)		FindNodeLL(Rec)
FindPathBST		FindPathBST
GetPath(BFS)		GetPath(BFS)
GetPath(DFS)		GetPath(DFS)
HasPath(Graph)		HasPath(Graph)
HeightBT		HeightBT
InsertDuplNode		InsertDuplNode
InsertLL(Rec)		InsertLL(Rec)
IsBST-2		IsBST-2
IsBST-3		IsBST-3
IsBST-I		IsBST-I
IsBalanced		IsBalanced
IsConnected		IsConnected
LCA(BT)		LCA(BT)
LCAofBST		LCAofBST
LCS(DP)		LCS(DP)
LCS(Memo)		LCS(Memo)
LCS(Recursion)		LCS(Recursion)
LIS(DP)		LIS(DP)
LargestBST		LargestBST
LengthLL		LengthLL
LengthLL(Rec)		LengthLL(Rec)
LevelOrderTrav		LevelOrderTrav
LongestIncreasingSubsequence		LongestIncreasingSubsequence
LootHouses(DP)		LootHouses(DP)
LootHouses(Memo)		LootHouses(Memo)
MaxDataNode		MaxDataNode
MaxFreqNumber		MaxFreqNumber
Merge2SortedLL		Merge2SortedLL
MergeSort		MergeSort
MidLL		MidLL
MinBracketReversal		MinBracketReversal
MinCostPath(Brute Force)		MinCostPath(Brute Force)
MinCostPath(DP)		MinCostPath(DP)
MinCostPath(memoization)		MinCostPath(memoization)
MinCount(DP)		MinCount(DP)
MinCount(Recursion)		MinCount(Recursion)
MinMaxBT		MinMaxBT
MinStepsTo1(Brute Force)		MinStepsTo1(Brute Force)
MinStepsTo1(DP)		MinStepsTo1(DP)
MinStepsTo1(Memoization)		MinStepsTo1(Memoization)
Mirror		Mirror
NextLarger		NextLarger
NoOfBalancedBTs		NoOfBalancedBTs
NoOfBalancedBTs(DP)		NoOfBalancedBTs(DP)
NodeMaxSum		NodeMaxSum
NodesWithoutSibling		NodesWithoutSibling
NumNodes		NumNodes
PairSum(BT)		PairSum(BT)
PairSumTo0		PairSumTo0
PalindromeLL		PalindromeLL
PathSumRootToLeaf		PathSumRootToLeaf
PointIntersection		PointIntersection
PostOrder		PostOrder
Print-ith-node		Print-ith-node
PrintElemRange		PrintElemRange
PrintLevelWise		PrintLevelWise
PrintLevelWise(BT)		PrintLevelWise(BT)
PrintNodesAtLevelK		PrintNodesAtLevelK
PrintReverseLL		PrintReverseLL
QueueUsingArray		QueueUsingArray
QueueUsingLL		QueueUsingLL
QuickSort		QuickSort
README.md		README.md
RemoveDuplicates		RemoveDuplicates
RemoveLeafNodes		RemoveLeafNodes
ReplaceWithSumofGreaterNodes		ReplaceWithSumofGreaterNodes
ReverseLL		ReverseLL
ReverseLL(Better)		ReverseLL(Better)
ReverseLL(Rec)		ReverseLL(Rec)

Repository files navigation

This Repository Contains all my codes which I wrote during the data strucutre and algorithm programming course with Coding Ninjas

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Releases

Packages

Contributors 7

bhumikamudgal/DS-in-C-

Folders and files

Latest commit

History

Repository files navigation

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Contributors 7

Packages