{"id":20271715,"url":"https://github.com/rodneyshag/interview_solutions","last_synced_at":"2025-03-04T00:05:24.764Z","repository":{"id":123421794,"uuid":"168899763","full_name":"RodneyShag/Interview_solutions","owner":"RodneyShag","description":"Efficient solutions to must-know interview problems","archived":false,"fork":false,"pushed_at":"2019-12-23T05:47:24.000Z","size":697,"stargazers_count":115,"open_issues_count":0,"forks_count":78,"subscribers_count":14,"default_branch":"master","last_synced_at":"2025-01-14T05:49:48.354Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/RodneyShag.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"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}},"created_at":"2019-02-03T02:02:23.000Z","updated_at":"2024-12-29T18:50:24.000Z","dependencies_parsed_at":null,"dependency_job_id":"aed69c88-55fc-448f-bae7-3929e68f17f0","html_url":"https://github.com/RodneyShag/Interview_solutions","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RodneyShag%2FInterview_solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RodneyShag%2FInterview_solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RodneyShag%2FInterview_solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RodneyShag%2FInterview_solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/RodneyShag","download_url":"https://codeload.github.com/RodneyShag/Interview_solutions/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241758964,"owners_count":20015251,"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","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":[],"created_at":"2024-11-14T12:39:10.091Z","updated_at":"2025-03-04T00:05:24.735Z","avatar_url":"https://github.com/RodneyShag.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"- [LeetCode](#leetcode)\n- [LeetFree](#leetfree)\n- [Cracking the Coding Interview](#cracking-the-coding-interview)\n- [HackerRank](#hackerrank)\n- [Custom](#custom)\n\n\nMost interviewers select their questions from LeetCode, so do the LeetCode questions first. The remaining questions below are either not on LeetCode for free, or are a better version of a LeetCode question.\n\n## LeetCode\n\n[LeetCode solutions](https://github.com/RodneyShag/LeetCode_solutions)\n\n## LeetFree\n\n|  #  |                                                Question                                               |                                                               Solution                                                               | Difficulty | Great Problem |\n|:---:|:-----------------------------------------------------------------------------------------------------:|:------------------------------------------------------------------------------------------------------------------------------------:|:----------:|:-------------:|\n| 694 | [Number of Distinct Islands](https://www.leetfree.com/problems/number-of-distinct-islands.html)       | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/LeetFree/Number%20of%20Distinct%20Islands.md)     |   Medium   |       *       |\n| 711 | [Number of Distinct Islands II](https://www.leetfree.com/problems/number-of-distinct-islands-ii.html) | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/LeetFree/Number%20of%20Distinct%20Islands%202.md) |    Hard    |               |\n\n\n## [Cracking the Coding Interview](https://www.amazon.com/Cracking-Coding-Interview-Programming-Questions/dp/0984782850/ref=sr_1_2?keywords=cracking+the+coding+interview\u0026qid=1574974814\u0026sr=8-2)\n\n\n|   Section  |                                                                                          Question                                                                                         |                                                                              Solution                                                                              | Difficulty | Great Problem |\n|:----------:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:----------:|:-------------:|\n|     1.1    | [Is Unique](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Is%20Unique.md)                                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Is%20Unique.md)                             |    Easy    |       *       |\n|     1.3    | [URLify](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/URLify.md)                                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/URLify.md)                                  |    Easy    |       *       |\n|     1.4    | [Palindrome Permutation](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Palindrome%20Permutation.md)                         | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Palindrome%20Permutation.md)                |    Easy    |       *       |\n|     1.5    | [One Away](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/One%20Away.md)                                                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/One%20Away.md)                              |   Medium   |       *       |\n|     1.9    | [String Rotation](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/String%20Rotation.md)                                       | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/String%20Rotation.md)                       |    Easy    |               |\n|     2.1    | [Remove Dups](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Remove%20Dups.md)                                               | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Remove%20Dups.md)                           |    Easy    |       *       |\n|     2.4    | [Partition](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Partition.md)                                                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Partition.md)                               |   Medium   |       *       |\n|  3 - Intro | [Implement a Stack](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Implement%20a%20Stack.md)                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Implement%20a%20Stack.md)                   |    Easy    |       *       |\n|  3 - Intro | [Implement a Queue](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Implement%20a%20Queue.md)                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Implement%20a%20Queue.md)                   |    Easy    |       *       |\n|     3.1    | [Three in One](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Three%20In%20One.md)                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Three%20In%20One.md)                        |   Medium   |               |\n|     3.2    | [Stack Min](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Stack%20Min.md)                                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Stack%20Min.md)                             |   Medium   |       *       |\n|     3.4    | [Queue via Stacks](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Queue%20via%20Stacks.md)                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Queue%20via%20Stacks.md)                    |   Medium   |       *       |\n|     3.5    | [Sort Stack](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Sort%20Stack.md)                                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Sort%20Stack.md)                            |   Medium   |       *       |\n|  4 - Intro | [Implement a TreeNode](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Implement%20a%20TreeNode.md)                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Implement%20a%20TreeNode.md)                |    Easy    |       *       |\n|  4 - Intro | [Implement a GraphNode](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Implement%20a%20GraphNode.md)                         | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Implement%20a%20GraphNode.md)               |    Easy    |       *       |\n|  4 - Intro | [Breadth-First Search (BFS)](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Breadth-First%20Search.md)                       | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Breadth-First%20Search.md)                  |   Medium   |       *       |\n|  4 - Intro | [Depth-First Search (DFS)](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Depth-First%20Search.md)                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Depth-First%20Search.md)                    |   Medium   |       *       |\n|    4.01    | [Route Between Nodes](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Route%20Between%20Nodes.md)                             | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Route%20Between%20Nodes.md)                 |    Easy    |       *       |\n|    4.05    | [Validate BST](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Validate%20BST.md)                                             | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Validate%20BST.md)                          |   Medium   |       *       |\n|    4.06    | [Successor](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Successor.md)                                                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Successor.md)                               |   Medium   |       *       |\n|    4.07    | [Build Order](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Build%20Order.md)                                               | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Build%20Order.md)                           |    Hard    |       *       |\n|    4.09    | [BST Sequences](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/BST%20Sequences.md)                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/BST%20Sequences.md)                         |    Hard    |               |\n|    4.11    | [Random Node](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Random%20Node.md)                                               | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Random%20Node.md)                           |    Hard    |       *       |\n|  5 - Intro | [BitFunctions: getBit](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/BitFunctions%20-%20getBit.md)                          | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/BitFunctions%20-%20getBit.md)               |    Easy    |               |\n|  5 - Intro | [BitFunctions: setBit](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/BitFunctions%20-%20setBit.md)                          | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/BitFunctions%20-%20setBit.md)               |    Easy    |               |\n|  5 - Intro | [BitFunctions: clearBit](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/BitFunctions%20-%20clearBit.md)                      | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/BitFunctions%20-%20clearBit.md)             |    Easy    |               |\n|     5.2    | [Binary to String](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Binary%20to%20String.md)                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Binary%20to%20String.md)                    |   Medium   |               |\n|     5.3    | [Flip Bit to Win](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Flip%20Bit%20to%20Win.md)                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Flip%20Bit%20to%20Win.md)                   |   Medium   |               |\n|     5.4    | [Next Number](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Next%20Number.md)                                               | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Next%20Number.md)                           |    Hard    |               |\n|     5.6    | [Conversion](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Conversion.md)                                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Conversion.md)                              |    Easy    |               |\n|     5.7    | [Pairwise Swap](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Pairwise%20Swap.md)                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Pairwise%20Swap.md)                         |   Medium   |               |\n|  6 - Intro | [Prime - isPrime](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Prime%20-%20isPrime.md)                                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Prime%20-%20isPrime.md)                     |    Easy    |               |\n|    7.09    | [Circular Array](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Circular%20Array.md)                                         | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Circular%20Array.md)                        |   Medium   |       *       |\n|    8.02    | [Robot in a Grid](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Robot%20in%20a%20Grid.md)                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Robot%20in%20a%20Grid.md)                   |    Hard    |               |\n|    8.03    | [Magic Index](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Magic%20Index.md)                                               | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Magic%20Index.md)                           |   Medium   |       *       |\n|    8.05    | [Recursive Multiply](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Recursive%20Multiply.md)                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Recursive%20Multiply.md)                    |   Medium   |       *       |\n|    8.06    | [Towers of Hanoi](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Towers%20of%20Hanoi.md)                                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Towers%20of%20Hanoi.md)                     |    Hard    |       *       |\n|    8.13    | [Stack of Boxes](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Stack%20of%20Boxes.md)                                       | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Stack%20of%20Boxes.md)                      |    Hard    |       *       |\n| 10 - Intro | [Merge Sort](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Merge%20Sort.md)                                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Merge%20Sort.md)                            |    Hard    |               |\n|    10.04   | [Sorted Search No Size](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Sorted%20Search%20No%20Size.md)                       | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Sorted%20Search%20No%20Size.md)             |   Medium   |       *       |\n|    10.06   | [Sort Big File](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Sort%20Big%20File.md)                                         | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Sort%20Big%20File.md)                       |   Medium   |       *       |\n|    10.07   | [Missing Int](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Missing%20Int.md)                                               | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Missing%20Int.md)                           |    Hard    |               |\n|    10.08   | [Find Duplicates](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Find%20Duplicates.md)                                       | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Find%20Duplicates.md)                       |    Easy    |       *       |\n|    10.10   | [Rank from Stream](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Rank%20from%20Stream.md)                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Rank%20from%20Stream.md)                    |    Hard    |       *       |\n|    10.11   | [Peaks and Valleys](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Peaks%20and%20Valleys.md)                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Peaks%20and%20Valleys.md)                   |    Easy    |       *       |\n|    13.5    | [TreeMap, HashMap, LinkedHashMap](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/TreeMap%2C%20HashMap%2C%20LinkedHashMap.md) | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/TreeMap%2C%20HashMap%2C%20LinkedHashMap.md) |    Easy    |       *       |\n|    16.01   | [Number Swapper](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Number%20Swapper.md)                                         | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Number%20Swapper.md)                        |   Medium   |               |\n|    16.04   | [Tic Tac Win](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Tic%20Tac%20Win.md)                                             | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Tic%20Tac%20Win.md)                         |   Medium   |       *       |\n|    16.06   | [Smallest Difference](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Smallest%20Difference.md)                               | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Smallest%20Difference.md)                   |   Medium   |       *       |\n|    16.10   | [Living People](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Living%20People.md)                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Living%20People.md)                         |   Medium   |       *       |\n|    16.11   | [Diving Board](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Diving%20Board.md)                                             | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Diving%20Board.md)                          |    Easy    |       *       |\n|    16.15   | [Master Mind](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Master%20Mind.md)                                               | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Master%20Mind.md)                           |   Medium   |               |\n|    16.18   | [Pattern Matching](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Pattern%20Matching.md)                                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Pattern%20Matching.md)                      |    Hard    |       *       |\n|    16.19   | [Pond Sizes](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Pond%20Sizes.md)                                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Pond%20Sizes.md)                            |   Medium   |       *       |\n|    16.20   | [T9](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/T9.md)                                                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/T9.md)                                      |   Medium   |       *       |\n|    16.21   | [Sum Swap](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Sum%20Swap.md)                                                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Sum%20Swap.md)                              |   Medium   |       *       |\n|    16.22   | [Langtons Ant](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Langtons%20Ant.md)                                             | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Langtons%20Ant.md)                          |    Easy    |       *       |\n|    17.03   | [Random Set](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Random%20Set.md)                                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Random%20Set.md)                            |    Hard    |       *       |\n|    17.07   | [Baby Names](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Baby%20Names.md)                                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Baby%20Names.md)                            |    Easy    |       *       |\n|    17.11   | [Word Distance](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Word%20Distance.md)                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Word%20Distance.md)                         |   Medium   |       *       |\n|    17.12   | [BiNode](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/BiNode.md)                                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/BiNode.md)                                  |    Hard    |       *       |\n|    17.14   | [Smallest K](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Smallest%20K.md)                                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Smallest%20K.md)                            |   Medium   |       *       |\n|    17.15   | [Longest Word](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Longest%20Word.md)                                             | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Longest%20Word.md)                          |    Hard    |       *       |\n|    17.16   | [The Masseuse](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/The%20Masseuse.md)                                             | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/The%20Masseuse.md)                          |   Medium   |       *       |\n|    17.18   | [Shortest Supersequence](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Shortest%20Supersequence.md)                         | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Shortest%20Supersequence.md)                |    Hard    |       *       |\n|    17.19   | [Missing Two](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Missing%20Two.md)                                               | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Missing%20Two.md)                           |   Medium   |       *       |\n|    17.24   | [Max Submatrix](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Cracking%20the%20Coding%20Interview/Max%20Submatrix.md)                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Cracking%20the%20Coding%20Interview/Max%20Submatrix.md)                         |    Hard    |       *       |\n\n\n## HackerRank\n\n|                                                                                                   Question                                                                                                   |                                                                               Solution                                                                              | Difficulty | Great Problem |\n|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:----------:|:-------------:|\n| [Linked List - Print in Reverse](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Linked%20List%20-%20Print%20in%20Reverse.md)                                             | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Linked%20List%20-%20Print%20in%20Reverse.md)                          |    Easy    |       *       |\n| [Counting Sort](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Counting%20Sort.md)                                                                                       | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Counting%20Sort.md)                                                   |   Medium   |       *       |\n| [Reverse a Doubly Linked List](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Reverse%20a%20Doubly%20Linked%20List.md)                                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Reverse%20a%20Doubly%20Linked%20List.md)                              |   Medium   |       *       |\n| [Java 1D Array](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Java%201D%20Array.md)                                                                                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Java%201D%20Array.md)                                                 |   Medium   |       *       |\n| [Java Dequeue](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Java%20Dequeue.md)                                                                                         | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Java%20Dequeue.md)                                                    |   Medium   |       *       |\n| [Contacts](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Contacts.md)                                                                                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Contacts.md)                                                          |    Hard    |       *       |\n| [Array Manipulation](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Array%20Manipulation.md)                                                                             | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Array%20Manipulation.md)                                              |    Hard    |       *       |\n| [Picking Numbers](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Picking%20Numbers.md)                                                                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Picking%20Numbers.md)                                                 |    Easy    |       *       |\n| [Electronics Shop](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Electronics%20Shop.md)                                                                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Electronics%20Shop.md)                                                |    Easy    |               |\n| [Minimum Distances](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Minimum%20Distances.md)                                                                               | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Minimum%20Distances.md)                                               |    Easy    |               |\n| [Find Digits](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Find%20Digits.md)                                                                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Find%20Digits.md)                                                     |    Easy    |               |\n| [Sansa and XOR](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Sansa%20and%20XOR.md)                                                                                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Sansa%20and%20XOR.md)                                                 |    Easy    |               |\n| [Making Anagrams](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Making%20Anagrams.md)                                                                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Making%20Anagrams.md)                                                 |   Medium   |               |\n| [Repeated String](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Repeated%20String.md)                                                                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Repeated%20String.md)                                                 |   Medium   |               |\n| [Inserting a Node Into a Sorted Doubly Linked List](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Inserting%20a%20Node%20Into%20a%20Sorted%20Doubly%20Linked%20List.md) | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Inserting%20a%20Node%20Into%20a%20Sorted%20Doubly%20Linked%20List.md) |   Medium   |               |\n| [Super Reduced String](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Super%20Reduced%20String.md)                                                                       | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Super%20Reduced%20String.md)                                          |   Medium   |               |\n| [Caesar Cipher](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Caesar%20Cipher.md)                                                                                       | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Caesar%20Cipher.md)                                                   |   Medium   |               |\n| [Gemstones](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Gemstones.md)                                                                                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Gemstones.md)                                                         |   Medium   |               |\n| [Maximizing XOR](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Maximizing%20XOR.md)                                                                                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Maximizing%20XOR.md)                                                  |   Medium   |               |\n| [Sum vs XOR](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/HackerRank/Sum%20vs%20XOR.md)                                                                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/HackerRank/Sum%20vs%20XOR.md)                                                    |    Hard    |               |\n\n\n## Custom\n\n|                                                                                           Question                                                                                           |                                                                         Solution                                                                        | Difficulty | Great Problem |\n|:--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------------------------------------:|:----------:|:-------------:|\n| [Dijkstra's Algorithm](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Custom/Dijkstra%27s%20Algorithm.md)                                                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Custom/Dijkstra%27s%20Algorithm.md)                                  |    Hard    |       *       |\n| [Arithmetic Progression Missing Element](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Custom/Arithmetic%20Progression%20Missing%20Element.md)                     | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Custom/Arithmetic%20Progression%20Missing%20Element.md)              |    Easy    |               |\n| [Shortest Common SuperSequence](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Custom/Shortest%20Common%20SuperSequence.md)                                         | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Custom/Shortest%20Common%20SuperSequence.md)                         |    Hard    |               |\n| [2 Coins on Graph](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Custom/2%20Coins%20on%20Graph.md)                                                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Custom/2%20Coins%20on%20Graph.md)                                    |   Medium   |               |\n| [Find Cycles in Graph](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Custom/Find%20Cycles%20in%20Graph.md)                                                         | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Custom/Find%20Cycles%20in%20Graph.md)                                |   Medium   |               |\n| [Shortest Cycle in Graph Containing Given Node](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Custom/Shortest%20Cycle%20in%20Graph%20Containing%20Given%20Node.md) | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Custom/Shortest%20Cycle%20in%20Graph%20Containing%20Given%20Node.md) |   Medium   |               |\n| [Risky Edges in Graph](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Custom/Risky%20Edges%20in%20Graph.md)                                                         | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Custom/Risky%20Edges%20in%20Graph.md)                                |   Medium   |               |\n| [Number of Shortest Paths](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Custom/Number%20of%20Shortest%20Paths.md)                                                 | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Custom/Number%20of%20Shortest%20Paths.md)                            |   Medium   |               |\n| [Ethnographers Births and Deaths](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Custom/Ethnographers%20Births%20and%20Deaths.md)                                   | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Custom/Ethnographers%20Births%20and%20Deaths.md)                     |   Medium   |               |\n| [Adding and Removing Edges in MSTs](https://github.com/RodneyShag/Interview_solutions/blob/master/Questions/Custom/Adding%20and%20Removing%20Edges%20in%20MSTs.md)                           | [Solution](https://github.com/RodneyShag/Interview_solutions/blob/master/Solutions/Custom/Adding%20and%20Removing%20Edges%20in%20MSTs.md)               |   Medium   |               |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frodneyshag%2Finterview_solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frodneyshag%2Finterview_solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frodneyshag%2Finterview_solutions/lists"}