GitHub - SumanSudhir/HackerRank-DataStructures

My solution of Hacker Rank Data Structure Problems

Name		Name	Last commit message	Last commit date
001.Array		001.Array
002.2DArray		002.2DArray
003.DynamicArray		003.DynamicArray
004.LeftRotation		004.LeftRotation
005.SparseArrays		005.SparseArrays
006.ArrayManipulation		006.ArrayManipulation
007.ElementsOfLinkedList		007.ElementsOfLinkedList
008.NodeAtTailOfLinkedList		008.NodeAtTailOfLinkedList
009.NodeAtHeadOfLinkedList		009.NodeAtHeadOfLinkedList
010.NodeAtSpecificPosition		010.NodeAtSpecificPosition
011.DeleteNode		011.DeleteNode
012.PrintInReverse		012.PrintInReverse
013.ReverseLinkedList		013.ReverseLinkedList
014.CompareLinkedList		014.CompareLinkedList
015.MergeSortedLinkedList		015.MergeSortedLinkedList
016.NodeValue		016.NodeValue
017.DeleteDuplicateNode		017.DeleteDuplicateNode
018.CycleDetection		018.CycleDetection
019.MergePointOfLinkedList		019.MergePointOfLinkedList
020.InsertingNodeInSortedDoublyLinkedList		020.InsertingNodeInSortedDoublyLinkedList
021.ReverseDoublyLinkedList		021.ReverseDoublyLinkedList
022.PreorderTraversal		022.PreorderTraversal
023.PostorderTranversal		023.PostorderTranversal
024.InorderTranversal		024.InorderTranversal
025.HeightOfBinaryTree		025.HeightOfBinaryTree
026.TreeTopView		026.TreeTopView
027.LevelOrderTransversal		027.LevelOrderTransversal
028.BinarySearchTreeInsertion		028.BinarySearchTreeInsertion
029.HuffmanDecoding		029.HuffmanDecoding
030.BSTLowestCommonAncestor		030.BSTLowestCommonAncestor
031.SwapNodes		031.SwapNodes
033.IsBinarySearchTree		033.IsBinarySearchTree
042.MaximumElement		042.MaximumElement
043.BalancedBrackets		043.BalancedBrackets
044.EqualStacks		044.EqualStacks
046.LargestRectangle		046.LargestRectangle
README.md		README.md

Navigation Menu

Repository files navigation

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages