# Data Structures | Subdomain | Challenge | Points | Solution | |:---------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------:|:------:|:----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:| | Arrays | [Arrays - DS](https://www.hackerrank.com/challenges/arrays-ds) | 10 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Arrays/Arrays%20-%20DS/Solution.java) | | Arrays | [2D Array - DS](https://www.hackerrank.com/challenges/2d-array) | 15 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Arrays/2D%20Array%20-%20DS/Solution.java) | | Arrays | [Dynamic Array](https://www.hackerrank.com/challenges/dynamic-array) | 15 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Arrays/Dynamic%20Array/Solution.java) | | Arrays | [Left Rotation](https://www.hackerrank.com/challenges/array-left-rotation) | 20 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Arrays/Left%20Rotation/Solution.java) | | Arrays | [Sparse Arrays](https://www.hackerrank.com/challenges/sparse-arrays) | 25 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Arrays/Sparse%20Arrays/Solution.java) | | Arrays | [Algorithmic Crush](https://www.hackerrank.com/challenges/crush) | 60 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Arrays/Algorithmic%20Crush/Solution.java) | | Stacks | [Maximum Element](https://www.hackerrank.com/challenges/maximum-element) | 20 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Stacks/Maximum%20Element/Solution.java) | | Stacks | [Balanced Brackets](https://www.hackerrank.com/challenges/balanced-brackets) | 25 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Stacks/Balanced%20Brackets/Solution.java) | | Trees | [Tree: Preorder Traversal](https://www.hackerrank.com/challenges/tree-preorder-traversal) | 10 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Tree%20-%20Preorder%20Traversal/Solution.java) | | Trees | [Tree: Inorder Traversal](https://www.hackerrank.com/challenges/tree-inorder-traversal) | 10 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Tree%20-%20Inorder%20Traversal/Solution.java) | | Trees | [Tree: Postorder Traversal](https://www.hackerrank.com/challenges/tree-postorder-traversal) | 10 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Tree%20-%20Postorder%20Traversal/Solution.java) | | Trees | [Tree: Height of a Binary Tree](https://www.hackerrank.com/challenges/tree-height-of-a-binary-tree) | 10 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Tree%20-%20Height%20of%20a%20Binary%20Tree/Solution.java) | | Trees | [Tree: Level Order Traversal](https://www.hackerrank.com/challenges/tree-level-order-traversal) | 20 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Tree%20-%20Level%20Order%20Traversal/Solution.java) | | Trees | [Tree: Huffman Decoding](https://www.hackerrank.com/challenges/tree-huffman-decoding) | 20 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Tree%20-%20Huffman%20Decoding/Solution.java) | | Trees | [Tree: Top View](https://www.hackerrank.com/challenges/tree-top-view) | 20 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Tree%20-%20Top%20View/Solution.java) | | Trees | [Binary Search Tree: Insertion](https://www.hackerrank.com/challenges/binary-search-tree-insertion) | 20 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Binary%20Search%20Tree%20-%20Insertion/Solution.java) | | Trees | [Binary Search Tree: Lowest Common Ancestor](https://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Binary%20Search%20Tree%20-%20Lowest%20Common%20Ancestor/Solution.java) | | Trees | [Is This a Binary Search Tree?](https://www.hackerrank.com/challenges/is-binary-search-tree) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Is%20This%20a%20Binary%20Search%20Tree/Solution.java) | | Trees | [Swap Nodes [Algo]](https://www.hackerrank.com/challenges/swap-nodes-algo) | 40 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Swap%20Nodes%20%5BAlgo%5D/Solution.java) | | Trees | [Square-Ten Tree](https://www.hackerrank.com/challenges/square-ten-tree) | 60 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trees/Square-Ten%20Tree/Solution.java) | | Linked List | [Print the Elements of a Linked List](https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Print%20the%20Elements%20of%20a%20Linked%20List/Solution.java) | | Linked List | [Insert a node at the head of a linked list](https://www.hackerrank.com/challenges/insert-a-node-at-the-head-of-a-linked-list) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Insert%20a%20node%20at%20the%20head%20of%20a%20linked%20list/Solution.java) | | Linked List | [Insert a Node at the Tail of a Linked List](https://www.hackerrank.com/challenges/insert-a-node-at-the-tail-of-a-linked-list) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Insert%20a%20Node%20at%20the%20Tail%20of%20a%20Linked%20List/Solution.java) | | Linked List | [Insert a node at a specific position in a linked list](https://www.hackerrank.com/challenges/insert-a-node-at-a-specific-position-in-a-linked-list) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Insert%20a%20node%20at%20a%20specific%20position%20in%20a%20linked%20list/Solution.java) | | Linked List | [Delete a Node](https://www.hackerrank.com/challenges/delete-a-node-from-a-linked-list) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Delete%20a%20Node/Solution.java) | | Linked List | [Print in Reverse](https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list-in-reverse) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Print%20in%20Reverse/Solution.java) | | Linked List | [Reverse a linked list](https://www.hackerrank.com/challenges/reverse-a-linked-list) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Reverse%20a%20linked%20list/Solution.java) | | Linked List | [Compare two linked lists](https://www.hackerrank.com/challenges/compare-two-linked-lists) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Compare%20two%20linked%20lists/Solution.java) | | Linked List | [Merge two sorted linked lists](https://www.hackerrank.com/challenges/merge-two-sorted-linked-lists) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Merge%20two%20sorted%20linked%20lists/Solution.java) | | Linked List | [Get Node Value](https://www.hackerrank.com/challenges/get-the-value-of-the-node-at-a-specific-position-from-the-tail) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Get%20Node%20Value/Solution.java) | | Linked List | [Delete duplicate-value nodes from a sorted linked list](https://www.hackerrank.com/challenges/delete-duplicate-value-nodes-from-a-sorted-linked-list) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Delete%20duplicate-value%20nodes%20from%20a%20sorted%20linked%20list/Solution.java) | | Linked List | [Cycle Detection](https://www.hackerrank.com/challenges/detect-whether-a-linked-list-contains-a-cycle) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Cycle%20Detection/Solution.java) | | Linked List | [Find Merge Point of Two Lists](https://www.hackerrank.com/challenges/find-the-merge-point-of-two-joined-linked-lists) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Find%20Merge%20Point%20of%20Two%20Lists/Solution.java) | | Linked List | [Inserting a Node Into a Sorted Doubly Linked List](https://www.hackerrank.com/challenges/insert-a-node-into-a-sorted-doubly-linked-list) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Inserting%20a%20Node%20Into%20a%20Sorted%20Doubly%20Linked%20List/Solution.java) | | Linked List | [Reverse a doubly linked list](https://www.hackerrank.com/challenges/reverse-a-doubly-linked-list) | 5 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Linked%20Lists/Reverse%20a%20doubly%20linked%20list/Solution.java) | | Tries | [Contacts](https://www.hackerrank.com/challenges/contacts) | 40 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Trie/Contacts/Solution.java) | | Queues | [Queue using Two Stacks](https://www.hackerrank.com/challenges/queue-using-two-stacks) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Queues/Queue%20using%20Two%20Stacks/Solution.java) | | Heaps | [Find the Running Median](https://www.hackerrank.com/challenges/find-the-running-median) | 50 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Heaps/Find%20the%20Running%20Median/Solution.java) | | Multiple Choice | [Data Structures MCQ 1](https://www.hackerrank.com/challenges/how-well-do-you-know-trees) | 5 | [Solution](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Multiple%20Choice/Data%20Structures%20MCQ%201/Solution.txt) | | Multiple Choice | [Data Structures MCQ 2](https://www.hackerrank.com/challenges/are-you-an-expert-on-data-structures) | 5 | [Solution](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Multiple%20Choice/Data%20Structures%20MCQ%202/Solution.txt) | | Multiple Choice | [Data Structures MCQ 3](https://www.hackerrank.com/challenges/are-you-an-expert-on-data-structures-1) | 5 | [Solution](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Data%20Structures/Multiple%20Choice/Data%20Structures%20MCQ%203/Solution.txt) |