{"id":21590565,"url":"https://github.com/anishlearnstocode/hackerrank-data-structures","last_synced_at":"2025-08-02T14:05:33.172Z","repository":{"id":98361692,"uuid":"134163131","full_name":"anishLearnsToCode/hackerrank-data-structures","owner":"anishLearnsToCode","description":"Data Structures 👩‍💻 Domain on HackerRank  - Problems \u0026 Solutions 📑📘","archived":false,"fork":false,"pushed_at":"2021-01-03T18:47:48.000Z","size":349,"stargazers_count":22,"open_issues_count":0,"forks_count":10,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-10T22:11:24.184Z","etag":null,"topics":["algorithms","arrays","balanced-trees","data-structures","disjoint-set","graph","hackerrank","hackerrank-data-structures","hackerrank-solutions","heap","java","linked-lists","online-judge","queues","reference","solutions","stacks","trees","trie"],"latest_commit_sha":null,"homepage":"https://www.hackerrank.com/domains/data-structures","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/anishLearnsToCode.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2018-05-20T15:35:42.000Z","updated_at":"2025-01-24T06:39:33.000Z","dependencies_parsed_at":"2023-07-10T14:15:39.854Z","dependency_job_id":null,"html_url":"https://github.com/anishLearnsToCode/hackerrank-data-structures","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/anishLearnsToCode/hackerrank-data-structures","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fhackerrank-data-structures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fhackerrank-data-structures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fhackerrank-data-structures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fhackerrank-data-structures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anishLearnsToCode","download_url":"https://codeload.github.com/anishLearnsToCode/hackerrank-data-structures/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fhackerrank-data-structures/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":268401584,"owners_count":24244461,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-02T02:00:12.353Z","response_time":74,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","arrays","balanced-trees","data-structures","disjoint-set","graph","hackerrank","hackerrank-data-structures","hackerrank-solutions","heap","java","linked-lists","online-judge","queues","reference","solutions","stacks","trees","trie"],"created_at":"2024-11-24T16:19:12.442Z","updated_at":"2025-08-02T14:05:33.160Z","avatar_url":"https://github.com/anishLearnsToCode.png","language":"Java","readme":"# HackerRank Data Structures Solutions\n\n![problems-solved](https://img.shields.io/badge/Problems%20Solved-57/121-1f425f.svg)\n![java](https://img.shields.io/badge/Java-51/121-1abc9c.svg)\n![python](https://img.shields.io/badge/Python-3/121-1abc9c.svg)\n![cpp](https://img.shields.io/badge/C++-2/121-1abc9c.svg)\n![md](https://img.shields.io/badge/Markdown-3/3-1abc9c.svg)\n[![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)\n[![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)\n[![cp](https://img.shields.io/badge/also%20see-My%20Hackerrank%20Profile-1f72ff.svg)](https://www.hackerrank.com/anishviewer)\n\nThis repository contains solutions to the \n[Data Structures domain](https://www.hackerrank.com/domains/data-structures) part of HackerRank.\nThe Data Structures Domain Falls under a broader Problem Solving Skill Set in HackerRank\nwhich consists of both \n[Data Structures](https://www.hackerrank.com/domains/data-structures) \nand [Algorithms](https://www.hackerrank.com/domains/algorithms).\n\nThe Data Structures Domain is further Divided into the following sub-domains.\nTo Contribute have a look at \n[Contributing.md](Contributing.md) \nand happy coding 😀 🐱‍💻.\n\n## Sub Domains \u0026 Problems (+Solutions) in the Data Structures Domain\n\n⚡ Quick Links: \n[Arrays](#arrays-) |\n[Linked Lists](#linked-lists-) |\n[Trees](#trees-) |\n[Balanced Trees](#balanced-trees-) |\n[Stacks](#stacks-) |\n[Queues](#queues-) |\n[Heap](#heap-) |\n[Disjoint Set](#disjoint-set-) |\n[Multiple Choice](#multiple-choice-) |\n[Trie](#trie-) |\n[Advanced](#advanced-) |\n \n### Arrays ![problems-solved](https://img.shields.io/badge/Solved-6/6-1abc9c.svg)\n\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|:-------------:|\n| [Arrays - DS](https://www.hackerrank.com/challenges/arrays-ds) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/arrays/ArraysDS.java) |\n| [2D Arrays - DS](https://www.hackerrank.com/challenges/2d-array) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/arrays/TwoDArrays.java) |\n| [Dynamic Array](https://www.hackerrank.com/challenges/dynamic-array) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/arrays/DynamicArray.java) |\n| [Left Rotation](https://www.hackerrank.com/challenges/array-left-rotation) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/arrays/LeftRotation.java) |\n| [Sparse Arrays](https://www.hackerrank.com/challenges/arrays-ds) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/arrays/SparseArrays.java) |\n| [Array Manipulation](https://www.hackerrank.com/challenges/crush) | Hard | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/arrays/ArrayManipulation.java) |\n\n### Linked Lists ![problems-solved](https://img.shields.io/badge/Solved-15/15-1abc9c.svg)\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|:-------------:|\n| [Print the Elements of a Linked List](https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/PrintElementsOfLinkedList.java) |\n| [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) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/InsertNodeAtTailOfLinkedList.java) |\n| [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) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/InsertNodeAtHeadOfLinkedList.java) |\n| [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) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/InsertNodeAtSpecificPosition.java) |\n| [Delete a Node](https://www.hackerrank.com/challenges/delete-a-node-from-a-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/DeleteANode.java) |\n| [Print in Reverse](https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list-in-reverse) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/PrintInReverse.java) |\n| [Reverse a Linked List](https://www.hackerrank.com/challenges/reverse-a-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/ReverseALinkedList.java) |\n| [Compare two Linked Lists](https://www.hackerrank.com/challenges/compare-two-linked-lists) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/Compare2LinkedList.java) |\n| [Merge two sorted Linked Lists](https://www.hackerrank.com/challenges/merge-two-sorted-linked-lists) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/Merge2SortedLinkedList.java) |\n| [Get Node Value](https://www.hackerrank.com/challenges/get-the-value-of-the-node-at-a-specific-position-from-the-tail) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/GetNodeValue.java) |\n| [Delete Duplicate Value Nodes from a sorted Linked List](https://www.hackerrank.com/challenges/delete-duplicate-value-nodes-from-a-sorted-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/DeleteDuplicateValueNodesFromSortedLinkedList.java) |\n| [Cycle Detection](https://www.hackerrank.com/challenges/detect-whether-a-linked-list-contains-a-cycle) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/CycleDetection.java) |\n| [Find Merge Points of Two Lists](https://www.hackerrank.com/challenges/find-the-merge-point-of-two-joined-linked-lists) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/FindMergePointOf2Lists.java) |\n| [Inserting a Node Into a Sorted Double Linked List](https://www.hackerrank.com/challenges/insert-a-node-into-a-sorted-doubly-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/InsertANodeInSortedDoublyLinkedList.java) |\n| [Reverse a Doubly Linked List](https://www.hackerrank.com/challenges/reverse-a-doubly-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/linkedlist/ReverseDoublyLinkedList.java) |\n\n### Trees ![problems-solved](https://img.shields.io/badge/Solved-14/17-1abc9c.svg)\n\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|:-------------:|\n| [Tree: Preorder Traversal](https://www.hackerrank.com/challenges/tree-preorder-traversal) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/PreorderTraversal.java) |\n| [Tree: Postorder Traversal](https://www.hackerrank.com/challenges/tree-postorder-traversal) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/PostOrderTraversal.java) |\n| [Tree: Inorder Traversal](https://www.hackerrank.com/challenges/tree-inorder-traversal) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/InorderTraversal.java) |\n| [Tree: Height of Binary Tree](https://www.hackerrank.com/challenges/tree-height-of-a-binary-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/HeightOfBinaryTree.java) |\n| [Tree: Level Order Traversal](https://www.hackerrank.com/challenges/tree-level-order-traversal) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/LevelOrderTraversal.java) |\n| [Binary Search Tree: Insertion](https://www.hackerrank.com/challenges/binary-search-tree-insertion) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/BST_Insertion.java) |\n| [Tree: Huffman Decoding](https://www.hackerrank.com/challenges/tree-huffman-decoding) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/TreeHuffmanDecoding.java) |\n| [Binary Search Tree: Lowest Common Ancestor](https://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/LowestCommonAncestor.java) |\n| [Swap Nodes [Algo]](https://www.hackerrank.com/challenges/swap-nodes-algo) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/SwapNodes_Algo.java) |\n| [Is There a Binary Search Tree](https://www.hackerrank.com/challenges/is-binary-search-tree) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/IsThisBinarySearchTree.java) |\n| [Tree: Top View](https://www.hackerrank.com/challenges/tree-top-view) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trees/TreesTopView.java) |\n| [Kitty's Calculations on a Tree](https://www.hackerrank.com/challenges/kittys-calculations-on-a-tree) | Advanced | [![C++](https://img.icons8.com/color/35/000000/c-plus-plus-logo.png)](src/trees/KitysCalculationOnATree.cpp) |\n| [Square Ten Tree](https://www.hackerrank.com/challenges/square-ten-tree) | Hard |[![C++](https://img.icons8.com/color/35/000000/c-plus-plus-logo.png)](src/trees/SquareTenTree.cpp) |\n| [Balanced Forest](https://www.hackerrank.com/challenges/balanced-forest) | Hard | [![Python](https://img.icons8.com/color/35/000000/python.png)](python/trees/balanced-forest.py) |\n| [Jenny's Subtrees](https://www.hackerrank.com/challenges/jenny-subtrees) | Hard | |\n| [Tree Coordinates](https://www.hackerrank.com/challenges/tree-coordinates) | Expert | |\n| [Array Pairs](https://www.hackerrank.com/challenges/array-pairs) | Advanced | |\n\n\n### Balanced Trees ![problems-solved](https://img.shields.io/badge/Solved-0/3-1abc9c.svg)\n\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|---------------|\n| [Self Balancing Tree](https://www.hackerrank.com/challenges/self-balancing-tree) | Medium | |\n| [Array and Simple Queries](https://www.hackerrank.com/challenges/array-and-simple-queries) | Hard | |\n| [Median Updates](https://www.hackerrank.com/challenges/median) | Hard | |\n\n\n### Stacks ![problems-solved](https://img.shields.io/badge/Solved-8/9-1abc9c.svg)\n\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|:-------------:|\n| [Maximum Element](https://www.hackerrank.com/challenges/maximum-element) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/stacks/MaximumElement.java) |\n| [Balanced Brackets](https://www.hackerrank.com/challenges/balanced-brackets) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/stacks/BalancedBrackets.java) |\n| [Equal Stacks](https://www.hackerrank.com/challenges/equal-stacks) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/stacks/EqualStacks.java) |\n| [Game of Two Stacks](https://www.hackerrank.com/challenges/game-of-two-stacks) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/stacks/GameOfTwoStacks.java) |\n| [Simple Text Editor](https://www.hackerrank.com/challenges/simple-text-editor) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/stacks/SimpleTextEditor.java) |\n| [Waiter](https://www.hackerrank.com/challenges/waiter) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/stacks/Waiter.java) |\n| [Largest Rectangle](https://www.hackerrank.com/challenges/largest-rectangle) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/stacks/LargestRectangle.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/stacks/largest-rectangle.py) |\n| [Poisonous Plants](https://www.hackerrank.com/challenges/poisonous-plants) | Hard | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/stacks/PoisonousPlants.java) |\n| [AND xor OR](https://www.hackerrank.com/challenges/and-xor-or) | Hard | |\n\n\n### Queues ![problems-solved](https://img.shields.io/badge/Solved-5/5-1abc9c.svg)\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|---------------|\n| [Queue Using Two Stacks](https://www.hackerrank.com/challenges/queue-using-two-stacks) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/queues/QueueUsingTwoStacks.java) |\n| [Castle on The Grid](https://www.hackerrank.com/challenges/castle-on-the-grid) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/queues/CastleOnTheGrid.java) |\n| [Down to Zero II](https://www.hackerrank.com/challenges/down-to-zero-ii) | Medium  | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/queues/DownToZeroII.java) |\n| [Truck Tour](https://www.hackerrank.com/challenges/truck-tour) | Hard | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/queues/TruckTourProblem.java) |\n| [Queries with Fixed Length](https://www.hackerrank.com/challenges/queries-with-fixed-length) | Hard | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/queues/QueriesWithFixedLength.java) |\n\n\n### Heap ![problems-solved](https://img.shields.io/badge/Solved-4/4-1abc9c.svg)\n\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|---------------|\n| [QHEAP1](https://www.hackerrank.com/challenges/qheap1) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/heap/QHEAP1.java) |\n| [Jessie and Cookies](https://www.hackerrank.com/challenges/jesse-and-cookies) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/heap/JesseAndCookies.java) |\n| [Find the Running Median](https://www.hackerrank.com/challenges/find-the-running-median) | Hard | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/heap/FindTheRunningMedian.java) |\n| [Minimum Average Wait Time](https://www.hackerrank.com/challenges/minimum-average-waiting-time) | Hard | [![Python](https://img.icons8.com/color/35/000000/python.png)](python/heap/minimum-average-waiting-time.py) |\n\n\n### Disjoint Set ![problems-solved](https://img.shields.io/badge/Solved-1/4-1abc9c.svg)\n\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|---------------|\n| [Components In A Graph](https://www.hackerrank.com/challenges/components-in-graph) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/disjoint_set/ComponentsInAGraph.java) |\n| [Kundu and Tree](https://www.hackerrank.com/challenges/kundu-and-tree) | Hard | |\n| [Super Maximum Cost Queries](https://www.hackerrank.com/challenges/maximum-cost-queries) | Hard | |\n| [Merging Communities](https://www.hackerrank.com/challenges/merging-communities) | Hard | |\n\n\n### Multiple Choice ![problems-solved](https://img.shields.io/badge/Solved-3/3-1abc9c.svg)\n\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|:-------------:|\n| [Data Structures MCQ1](https://www.hackerrank.com/challenges/how-well-do-you-know-trees) | Multiple Choice Question | [![Markdown](https://img.icons8.com/office/35/000000/markdown.png)](src/mcq/Data%20Structure%20MCQ%201.md) |\n| [Data Structures MCQ2](https://www.hackerrank.com/challenges/are-you-an-expert-on-data-structures) | Multiple Choice Question | [![Markdown](https://img.icons8.com/office/35/000000/markdown.png)](src/mcq/Data%20Structure%20MCQ%202.md) |\n| [Data Structures MCQ3](https://www.hackerrank.com/challenges/are-you-an-expert-on-data-structures-1) | Multiple Choice Question | [![Markdown](https://img.icons8.com/office/35/000000/markdown.png)](src/mcq/Data%20Structure%20MCQ%203.md) |\n\n\n### Trie ![problems-solved](https://img.shields.io/badge/Solved-1/2-1abc9c.svg)\n\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|:-------------:|\n| [Contacts]() | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/trie/Contacts.java) |\n| [No Prefix Set](https://www.hackerrank.com/challenges/no-prefix-set) | Hard | |\n\n\n### Advanced ![problems-solved](https://img.shields.io/badge/Solved-0/53-1abc9c.svg)\n\n| Problem | Difficulty Level | Solution Link |\n|---------|------------------|---------------|\n| [Kindergarten Adventures](https://www.hackerrank.com/challenges/kindergarten-adventures) | Medium | |\n| [Mr. X and his Shots](https://www.hackerrank.com/challenges/x-and-his-shots) | Medium | |\n| [Cube Summation](https://www.hackerrank.com/challenges/cube-summation) | Hard | |\n| [Direct Connections](https://www.hackerrank.com/challenges/direct-connections) | Hard | |\n| [Subsequence Weighting](https://www.hackerrank.com/challenges/subsequence-weighting) | Advanced | |\n| [Jim and the Skyscrapers](https://www.hackerrank.com/challenges/jim-and-the-skyscrapers) | Medium | |\n| [Palindromic Subsets](https://www.hackerrank.com/challenges/palindromic-subsets) | Hard | |\n| [Counting On A Tree](https://www.hackerrank.com/challenges/counting-on-a-tree) | Expert | |\n| [Polynomial Division](https://www.hackerrank.com/challenges/polynomial-division) | Hard |\n| [Costly Intervals](https://www.hackerrank.com/challenges/costly-intervals) | Hard |\n| [The Strange Function](https://www.hackerrank.com/challenges/the-strange-function) | Hard |\n| [Self-Driving Bus](https://www.hackerrank.com/challenges/self-driving-bus) | Advanced |\n| [Unique Colors](https://www.hackerrank.com/challenges/unique-colors) | Advanced |\n| [Fibonacci Numbers Tree](https://www.hackerrank.com/challenges/fibonacci-numbers-tree) | Expert |\n| [Pair Sums](https://www.hackerrank.com/challenges/pair-sums) | Expert |\n| [Functional Palindromes](https://www.hackerrank.com/challenges/functional-palindromes) | Advanced |\n| [Lazy White Falcon](https://www.hackerrank.com/challenges/lazy-white-falcon) | Hard |\n| [Ticket To Ride](https://www.hackerrank.com/challenges/ticket-to-ride) | Expert |\n| [Heavy Light White Falcon](https://www.hackerrank.com/challenges/heavy-light-white-falcon) | Hard |\n| [Sum of The Maximums](https://www.hackerrank.com/challenges/little-alexey-and-sum-of-maximums) | Advanced |\n| [Number Game On A Tree](https://www.hackerrank.com/challenges/number-game-on-a-tree) | Expert |\n| [Heavy Light 2 White Falcon](https://www.hackerrank.com/challenges/heavy-light-2-white-falcon) | Hard |\n| [Library Query](https://www.hackerrank.com/challenges/library-query) | Advanced |\n| [Starfleet](https://www.hackerrank.com/challenges/starfleet) | Advanced |\n| [Almost Equal - Advanced](https://www.hackerrank.com/challenges/almost-equal-advanced) | Expert |\n| [Almost Sorted Interval](https://www.hackerrank.com/challenges/almost-sorted-interval) | Expert |\n| [Burger Happiness](https://www.hackerrank.com/challenges/burger-happiness) | Hard |\n| [Roy and Alpha Beta Trees](https://www.hackerrank.com/challenges/roy-and-alpha-beta-trees) | Hard |\n| [Coloring Tree](https://www.hackerrank.com/challenges/coloring-tree) | Hard |\n| [Recalling Early Days GP With Trees](https://www.hackerrank.com/challenges/recalling-early-days-gp-with-trees) | Hard |\n| [Swaps and Sums](https://www.hackerrank.com/challenges/swaps-and-sum) | Advanced |\n| [Arithmetic Progressions](https://www.hackerrank.com/challenges/arithmetic-progressions) | Advanced |\n| [Coolguy And Two Subsequences](https://www.hackerrank.com/challenges/coolguy-and-two-subsequences) | Advanced |\n| [White Falcon and Tree](https://www.hackerrank.com/challenges/white-falcon-and-tree) | Hard |\n| [Subtrees and Paths](https://www.hackerrank.com/challenges/subtrees-and-paths) | Advanced |\n| [Triplets](https://www.hackerrank.com/challenges/triplets) | Advanced |\n| [Beautiful Segments](https://www.hackerrank.com/challenges/beautiful-segments) | Expert | |\n| [Divisibility](https://www.hackerrank.com/challenges/ab0) | Expert |\n| [BST Maintenance](https://www.hackerrank.com/challenges/bst-maintenance) | Advanced |\n| [Find Maximum Index Product](https://www.hackerrank.com/challenges/find-maximum-index-product) | Medium |\n| [Taxicab Driver's Problem](https://www.hackerrank.com/challenges/taxicab-drivers-problem) | Advanced |\n| [Jaggu Playing With Balloons](https://www.hackerrank.com/challenges/jagia-playing-with-numbers) | Advanced |\n| [Dynamic Summation](https://www.hackerrank.com/challenges/dynamic-summation) | Hard |\n| [Two Array Problem](https://www.hackerrank.com/challenges/weird-queries) | Hard | |\n| [Rooted Tree](https://www.hackerrank.com/challenges/rooted-tree) | Hard | |\n| [The Crazy Helix](https://www.hackerrank.com/challenges/helix) | Advanced | |\n| [Network Administration](https://www.hackerrank.com/challenges/net-admin) | Hard | |\n| [Easy Addition](https://www.hackerrank.com/challenges/easy-addition) | Expert | |\n| [Find The Permutation]() | Expert | |\n| [Company Retreat](https://www.hackerrank.com/challenges/company-retreat) | Advanced  | |\n| [Box Operations](https://www.hackerrank.com/challenges/box-operations) | Expert | |\n| [Max Transform](https://www.hackerrank.com/challenges/max-transform) | Expert | |\n| [Array and Queries](https://www.hackerrank.com/challenges/array-and-queries-1) | Hard | |\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanishlearnstocode%2Fhackerrank-data-structures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanishlearnstocode%2Fhackerrank-data-structures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanishlearnstocode%2Fhackerrank-data-structures/lists"}