GitHub - ParmodKumar28/CodingNinjas_DSA: This Repository contains my practice solution's of Coding Ninjas Java DSA assignments Questions.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 110 Commits
.gitignore		.gitignore
AppendLastNtoFirst.java		AppendLastNtoFirst.java
ArrayIntersection.java		ArrayIntersection.java
BSTClass.java		BSTClass.java
BSTToLL.java		BSTToLL.java
BracketsBalanced.java		BracketsBalanced.java
BubbleSort(Iterative)LinkedList.java		BubbleSort(Iterative)LinkedList.java
BuyTheTicket.java		BuyTheTicket.java
CalculatePower.java		CalculatePower.java
CheckAB.java		CheckAB.java
CheckIfGenericTreeContainElementX.java		CheckIfGenericTreeContainElementX.java
CheckMax-Heap.java		CheckMax-Heap.java
CheckNumberInArray.java		CheckNumberInArray.java
CheckPalindromeRecursive.java		CheckPalindromeRecursive.java
CodeCountLeafNodes.java		CodeCountLeafNodes.java
CodeFindHeight.java		CodeFindHeight.java
CodeMaxPriorityQueue.java		CodeMaxPriorityQueue.java
CodeNumberOfNodesGreaterThanX.java		CodeNumberOfNodesGreaterThanX.java
CodePost-OrderTraversal.java		CodePost-OrderTraversal.java
CodeRemoveMin.java		CodeRemoveMin.java
CodeSearchWordInTrie.java		CodeSearchWordInTrie.java
ComplexNumberProblem.java		ComplexNumberProblem.java
ConstructBST.java		ConstructBST.java
CountLeafNodes.java		CountLeafNodes.java
CountWordsInTrie.java		CountWordsInTrie.java
CountZeros.java		CountZeros.java
Create&InsertDuplicateNode.java		Create&InsertDuplicateNode.java
DeleteNodeInLL.java		DeleteNodeInLL.java
DeleteNodeRecursively.java		DeleteNodeRecursively.java
DeleteeveryNnodes.java		DeleteeveryNnodes.java
DiameterOfBinaryTree.java		DiameterOfBinaryTree.java
ElementsBetweenK1AndK2.java		ElementsBetweenK1AndK2.java
EliminateDuplicates.java		EliminateDuplicates.java
Even afterOddLinkedList.java		Even afterOddLinkedList.java
ExtractUniqueCharacters.java		ExtractUniqueCharacters.java
FindANodeInLL(Recursive).java		FindANodeInLL(Recursive).java
FindANodeInLinkedList.java		FindANodeInLinkedList.java
FindIndexOfANumberInAnArray_Question.java		FindIndexOfANumberInAnArray_Question.java
FindPathInBST.java		FindPathInBST.java
GeomatricSum.java		GeomatricSum.java
GetAllUniqueSubsets.java		GetAllUniqueSubsets.java
HeightOfTree.java		HeightOfTree.java
InplaceHeapSort.java		InplaceHeapSort.java
InserNodeInLL.java		InserNodeInLL.java
IsNodePresent.java		IsNodePresent.java
KLargestElements.java		KLargestElements.java
KSmallestElements.java		KSmallestElements.java
KthLargestElement.java		KthLargestElement.java
LCAOfBST.java		LCAOfBST.java
LargestBST.java		LargestBST.java
LastIndexOfANumberInAnArray_Question.java		LastIndexOfANumberInAnArray_Question.java
LengthOfLL.java		LengthOfLL.java
LevelOrderTraversal.java		LevelOrderTraversal.java
LevelWiseLinkedlist.java		LevelWiseLinkedlist.java
LongestConsecutiveSequence.java		LongestConsecutiveSequence.java
LongestSubarrayZeroSum.java		LongestSubarrayZeroSum.java
MaximumFrequencyNumber.java		MaximumFrequencyNumber.java
MergeSort.java		MergeSort.java
MergeSortLL.java		MergeSortLL.java
MergeTwoSortedLL.java		MergeTwoSortedLL.java
Merge_Sort_ProblemStatement.java		Merge_Sort_ProblemStatement.java
MidPointLinkedList.java		MidPointLinkedList.java
MinimumAndMaximumInTheBinaryTree.java		MinimumAndMaximumInTheBinaryTree.java
MirrorBinaryTree.java		MirrorBinaryTree.java
MultiplicationRecursive.java		MultiplicationRecursive.java
NQueens.java		NQueens.java
NextLargerElement.java		NextLargerElement.java
NodeHavingSumOfChildrenAndNodeIsMax.java		NodeHavingSumOfChildrenAndNodeIsMax.java
NodesGreaterThanX.java		NodesGreaterThanX.java
Nodeswithoutsibling.java		Nodeswithoutsibling.java
NumberOfDigits.java		NumberOfDigits.java
PairStar.java		PairStar.java
PairSumInABST.java		PairSumInABST.java
PairSumto0.java		PairSumto0.java
PairswithdifferenceK.java		PairswithdifferenceK.java
PalindromeLinkedList.java		PalindromeLinkedList.java
PathSumRootToLeaf.java		PathSumRootToLeaf.java
PatternMatching.java		PatternMatching.java
PostOrderBinaryTree.java		PostOrderBinaryTree.java
PreOrderBinaryTree.java		PreOrderBinaryTree.java
Print ReversedLinkedList.java		Print ReversedLinkedList.java
PrintFirstNNaturalNumbers_Code.java		PrintFirstNNaturalNumbers_Code.java
PrintIntersection.java		PrintIntersection.java
PrintLevelwise.java		PrintLevelwise.java
PrintPermutationsOfAString.java		PrintPermutationsOfAString.java
PrintSubsetSumToK.java		PrintSubsetSumToK.java
PrintTreeLevel-wise.java		PrintTreeLevel-wise.java
PrintithNode.java		PrintithNode.java
QueueUsingLL.java		QueueUsingLL.java
RatInAMaze.java		RatInAMaze.java
RateInMazeAllPath.java		RateInMazeAllPath.java
RemoveConsecutiveDuplicates.java		RemoveConsecutiveDuplicates.java
RemoveDuplicates.java		RemoveDuplicates.java
RemoveDuplicatesRecursuvely.java		RemoveDuplicatesRecursuvely.java
RemoveX.java		RemoveX.java
ReplaceNodeWithDepth.java		ReplaceNodeWithDepth.java
ReplaceNodeWithDepth2.java		ReplaceNodeWithDepth2.java
ReplaceWithSumOfGreaterNodes.java		ReplaceWithSumOfGreaterNodes.java
ReturnPermutationsOfAString.java		ReturnPermutationsOfAString.java
ReturnSubsetOfAnArray.java		ReturnSubsetOfAnArray.java