{"id":19637371,"url":"https://github.com/stuymedova/cracking-the-coding-interview","last_synced_at":"2025-11-05T03:03:30.521Z","repository":{"id":173681938,"uuid":"565592665","full_name":"stuymedova/cracking-the-coding-interview","owner":"stuymedova","description":"[LEARNING] Solutions to problems from \"Cracking the Coding Interview\"","archived":false,"fork":false,"pushed_at":"2023-10-09T11:21:37.000Z","size":116,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-09T17:04:38.483Z","etag":null,"topics":["cracking-the-coding-interview"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/stuymedova.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":"2022-11-13T21:56:28.000Z","updated_at":"2024-06-25T20:51:13.000Z","dependencies_parsed_at":null,"dependency_job_id":"5da4b5ba-1023-4cb2-b736-d36b45ffce97","html_url":"https://github.com/stuymedova/cracking-the-coding-interview","commit_stats":null,"previous_names":["stuymedova/cracking-the-coding-interview"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stuymedova%2Fcracking-the-coding-interview","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stuymedova%2Fcracking-the-coding-interview/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stuymedova%2Fcracking-the-coding-interview/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stuymedova%2Fcracking-the-coding-interview/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/stuymedova","download_url":"https://codeload.github.com/stuymedova/cracking-the-coding-interview/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240941510,"owners_count":19882062,"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":["cracking-the-coding-interview"],"created_at":"2024-11-11T12:34:14.532Z","updated_at":"2025-11-05T03:03:30.461Z","avatar_url":"https://github.com/stuymedova.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Cracking the Coding Interview\n\n#### Chapter 1 — Arrays and Strings\n- [X] 1.1 - Is Unique\n- [X] 1.2 - Check Permutation\n- [X] 1.3 - URLify\n- [X] 1.4 - Palindrome Permutation\n- [X] 1.5 - One Away\n- [X] 1.6 - String Compression\n- [X] 1.7 - Rotate Matrix\n- [X] 1.8 - Zero Matrix\n- [X] 1.9 - String Rotation\n\n#### Chapter 2 — Linked Lists\n- [X] 2.1 - Remove Dups\n- [X] 2.2 - Return Kth to Last\n- [X] 2.3 - Delete Middle Node\n- [X] 2.4 - Partition\n- [X] 2.5 - Sum Lists\n- [X] 2.6 - Palindrome\n- [X] 2.7 - Intersection\n- [X] 2.8 - Loop Detection\n\n#### Chapter 3 — Stacks and Queues\n- [X] 3.1 - Three in One\n- [X] 3.2 - Stack Min\n- [X] 3.3 - Stack of Plates\n- [X] 3.4 - Queue via Stacks\n- [X] 3.5 - Sort Stack\n- [X] 3.6 - Animal Shelter\n\n#### Chapter 4 — Trees and Graphs\n- [X] 4.1 - Route Between Nodes\n- [X] 4.2 - Minimal Tree\n- [X] 4.3 - List of Depths\n- [X] 4.4 - Check Balanced\n- [X] 4.5 - Validate BST\n- [X] 4.6 - Successor\n- [X] 4.7 - Build Order\n- [X] 4.8 - First Common Ancestor\n- [X] 4.9 - BST Sequences\n- [X] 4.10 - Check Subtree\n- [X] 4.11 - Random Node\n- [X] 4.12 - Paths with Sum\n\n#### Chapter 8 — Recursion and Dynamic Programming\n- [X] 8.1 - Triple Step\n- [X] 8.2 - Robot in a Grid\n- [X] 8.3 - Magic Index\n- [X] 8.4 - Power Set\n- [X] 8.5 - Recursive Multiply\n- [X] 8.6 - Towers of Hanoi\n- [X] 8.7 - Permutations without Dups\n- [X] 8.8 - Permutations with Dups\n- [X] 8.9 - Parens\n- [X] 8.10 - Paint Fill\n- [X] 8.11 - Coins\n- [X] 8.12 - Eight Queens\n- [X] 8.13 - Stack of Boxes\n- [ ] 8.14 - Boolean Eval\n\n#### Chapter 10 — Sorting and Searching\n- [X] 10.1 - Sorted Merge\n- [X] 10.2 - Group Anagrams\n- [X] 10.3 - Search In Rotated Array\n- [X] 10.4 - Sorted Search No Size\n- [X] 10.5 - Sparse Search\n- [ ] 10.6 - Sort Big File\n- [X] 10.7 - Missing Int\n- [X] 10.8 - Find Duplicates\n- [X] 10.9 - Sorted Matrix Search\n- [ ] 10.10 - Rank From Stream\n- [X] 10.11 - Peaks And Valleys\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstuymedova%2Fcracking-the-coding-interview","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fstuymedova%2Fcracking-the-coding-interview","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstuymedova%2Fcracking-the-coding-interview/lists"}