{"id":15068766,"url":"https://github.com/turingfly/cracking-the-coding-interview","last_synced_at":"2025-08-20T12:32:05.029Z","repository":{"id":46587225,"uuid":"93950532","full_name":"Turingfly/cracking-the-coding-interview","owner":"Turingfly","description":"Java solutions and explanations to problems in the book Cracking the Coding Interview(6th Edition).","archived":false,"fork":false,"pushed_at":"2019-03-13T01:17:56.000Z","size":67,"stargazers_count":178,"open_issues_count":4,"forks_count":94,"subscribers_count":8,"default_branch":"master","last_synced_at":"2024-12-19T11:12:46.929Z","etag":null,"topics":["algorithm","interview","java","java8"],"latest_commit_sha":null,"homepage":"","language":"Java","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/Turingfly.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}},"created_at":"2017-06-10T16:08:33.000Z","updated_at":"2024-12-18T15:41:35.000Z","dependencies_parsed_at":"2022-07-20T03:48:17.129Z","dependency_job_id":null,"html_url":"https://github.com/Turingfly/cracking-the-coding-interview","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/Turingfly%2Fcracking-the-coding-interview","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Turingfly%2Fcracking-the-coding-interview/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Turingfly%2Fcracking-the-coding-interview/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Turingfly%2Fcracking-the-coding-interview/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Turingfly","download_url":"https://codeload.github.com/Turingfly/cracking-the-coding-interview/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":230423564,"owners_count":18223435,"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":["algorithm","interview","java","java8"],"created_at":"2024-09-25T01:39:10.931Z","updated_at":"2024-12-19T11:12:50.951Z","avatar_url":"https://github.com/Turingfly.png","language":"Java","readme":"# Cracking the Coding Interview (6th Edition) \n\n![Language](https://img.shields.io/badge/language-Java%20-red.svg) \u003c/br\u003e\nJava solutions to problems in the book Cracking the Coding Interview(6th Edition). \n\n## Table of Contents\n\n* **[Arrays and Strings](#arrays-and-strings)**\n* **[LinkedList](#linkedlist)**\n* **[Stacks and Queues](#stacks-and-queues)**\n* **[Trees and Graphs](#trees-and-graphs)**\n* **[Bit Manipulation](#bit-manipulation)**\n* **[Math and Logic Puzzles](#math-and-logic-puzzles)**\n* **[Object Oriented Design](#object-oriented-design)**\n* **[Recursion and Dynamic Programming](#recursion-and-dynamic-programming)**\n* **[System Design and Scalability](#system-design-and-scalability)**\n* **[Sorting and Searching](#sorting-and-searching)**\n* **[Testing](#testing)**\n* **[Additional Review Problems](#additional-review-problems)**\n\n### Arrays and Strings\n\n- [Check Permutation](./src/chapter01ArraysAndStrings/CheckPermutation.java) \u003cbr /\u003e\n- [Is Unique](./src/chapter01ArraysAndStrings/IsUnique.java) \u003cbr /\u003e\n- [One Away](./src/chapter01ArraysAndStrings/OneAway.java) \u003cbr /\u003e\n- [Palindrome Permutation](./src/chapter01ArraysAndStrings/PalindromePermutation.java) \u003cbr /\u003e\n- [Rotate Matrix](./src/chapter01ArraysAndStrings/RotateMatrix.java) \u003cbr /\u003e\n- [String Compression](./src/chapter01ArraysAndStrings/StringCompression.java) \u003cbr /\u003e\n- [String Rotation](./src/chapter01ArraysAndStrings/StringRotation.java) \u003cbr /\u003e\n- [Urlify](./src/chapter01ArraysAndStrings/Urlify.java) \u003cbr /\u003e\n- [Zero Matrix](./src/chapter01ArraysAndStrings/ZeroMatrix.java) \u003cbr /\u003e\n\n### LinkedList\n\n- [Delete Middle Node](./src/chapter02LinkedList/DeleteMiddleNode.java) \u003cbr /\u003e\n- [Intersection](./src/chapter02LinkedList/Intersection.java) \u003cbr /\u003e\n- [ListNode](./src/chapter02LinkedList/ListNode.java) \u003cbr /\u003e\n- [Loop Detection](./src/chapter02LinkedList/LoopDetection.java) \u003cbr /\u003e\n- [Palindrome](./src/chapter02LinkedList/Palindrome.java) \u003cbr /\u003e\n- [Partition](./src/chapter02LinkedList/Partition.java) \u003cbr /\u003e\n- [Remove Duplicates](./src/chapter02LinkedList/RemoveDuplicates.java) \u003cbr /\u003e\n- [Return Kth To Last](./src/chapter02LinkedList/ReturnKthToLast.java) \u003cbr /\u003e\n- [Sum Lists](./src/chapter02LinkedList/SumLists.java) \u003cbr /\u003e\n\n### Stacks and Queues\n\n- [Animal Shelter](./src/chapter03StacksAndQueues/AnimalShelter.java) \u003cbr /\u003e\n- [Three Stacks in One Array](./src/chapter03StacksAndQueues/ArrayToStack.java) \u003cbr /\u003e\n- [Implement Queue Using Stacks](./src/chapter03StacksAndQueues/ImplementQueueUsingStacks.java) \u003cbr /\u003e\n- [Min Stack](./src/chapter03StacksAndQueues/MinStack.java) \u003cbr /\u003e\n- [Sort Stack](./src/chapter03StacksAndQueues/SortStack.java) \u003cbr /\u003e\n\n### Trees and Graphs\n\n- [Check Balanced Tree](./src/chapter04TreesAndGraphs/CheckBalancedTree.java) \u003cbr /\u003e\n- [First Common Ancestor](./src/chapter04TreesAndGraphs/FirstCommonAncestor.java) \u003cbr /\u003e\n- [List of Depths](./src/chapter04TreesAndGraphs/ListOfDepths.java) \u003cbr /\u003e\n- [Minimal Tree](./src/chapter04TreesAndGraphs/MinimalTree.java) \u003cbr /\u003e\n- [Paths with Sum](./src/chapter04TreesAndGraphs/PathsWithSum.java) \u003cbr /\u003e\n- [Random Node](./src/chapter04TreesAndGraphs/RandomNode.java) \u003cbr /\u003e\n- [Route between Nodes](./src/chapter04TreesAndGraphs/RouteBetweenNodes.java) \u003cbr /\u003e\n- [Successor](./src/chapter04TreesAndGraphs/Successor.java) \u003cbr /\u003e\n- [Tree Node](./src/chapter04TreesAndGraphs/TreeNode.java) \u003cbr /\u003e\n- [Validate BST](./src/chapter04TreesAndGraphs/ValidateBST.java) \u003cbr /\u003e\n\n### Bit Manipulation\n\n- [Binary to String](./src/chapter05BitManipulation/BinaryToString.java) \u003cbr /\u003e\n- [Conversion](./src/chapter05BitManipulation/Conversion.java) \u003cbr /\u003e\n- [Flip Bit to Win](./src/chapter05BitManipulation/FlipBitToWin.java) \u003cbr /\u003e\n- [Insertion](./src/chapter05BitManipulation/Insertion.java) \u003cbr /\u003e\n- [Introduction](./src/chapter05BitManipulation/Intro.java) \u003cbr /\u003e\n- [Next Number](./src/chapter05BitManipulation/Intro.java) \u003cbr /\u003e\n- [Pairwise Swap](./src/chapter05BitManipulation/PairwiseSwap.java) \u003cbr /\u003e\n\n### Math and Logic Puzzles\n\n- [Generate a List of Primes](./src/chapter06MathAndLogicPuzzles/GenerateAListOfPrimes.java) \u003cbr /\u003e\n\n### Object Oriented Design\n\n### Recursion and Dynamic Programming\n\n- [Boolean Evaluation](./src/chapter08RecursionAndDynamicProgramming/BooleanEvaluation.java) \u003cbr /\u003e\n- [Coins](./src/chapter08RecursionAndDynamicProgramming/Coins.java) \u003cbr /\u003e\n- [Eight Queues](./src/chapter08RecursionAndDynamicProgramming/EightQueues.java) \u003cbr /\u003e\n- [Fibonacci](./src/chapter08RecursionAndDynamicProgramming/Fibonacci.java) \u003cbr /\u003e\n- [Magic Index](./src/chapter08RecursionAndDynamicProgramming/MagicIndex.java) \u003cbr /\u003e\n- [Paint Fill](./src/chapter08RecursionAndDynamicProgramming/PaintFill.java) \u003cbr /\u003e\n- [Parenthesis](./src/chapter08RecursionAndDynamicProgramming/Parenthesis.java) \u003cbr /\u003e\n- [Permutations with Duplicates](./src/chapter08RecursionAndDynamicProgramming/PermutationsWithDuplicates.java) \u003cbr /\u003e\n- [Permutations without Duplicates](./src/chapter08RecursionAndDynamicProgramming/PermutationsWithoutDups.java) \u003cbr /\u003e\n- [Power Set](./src/chapter08RecursionAndDynamicProgramming/PowerSet.java) \u003cbr /\u003e\n- [Recursive Multiply](./src/chapter08RecursionAndDynamicProgramming/RecursiveMultiply.java) \u003cbr /\u003e\n- [Robot In a Grid](./src/chapter08RecursionAndDynamicProgramming/RobotInAGrid.java) \u003cbr /\u003e\n- [Stack of Boxes](./src/chapter08RecursionAndDynamicProgramming/StackOfBoxes.java) \u003cbr /\u003e\n- [Towers of Hanoi](./src/chapter08RecursionAndDynamicProgramming/TowersOfHanoi.java) \u003cbr /\u003e\n- [Triple Steps](./src/chapter08RecursionAndDynamicProgramming/TripleSteps.java) \u003cbr /\u003e\n\n### System Design and Scalability\n\n### Sorting and Searching\n\n- [Group Anagrams](./src/chapter10SortingAndSearching/GroupAnagrams.java) \u003cbr /\u003e\n- [Merge Sort](./src/chapter10SortingAndSearching/MergeSort.java) \u003cbr /\u003e\n- [Quick Sort](./src/chapter10SortingAndSearching/QuickSort.java) \u003cbr /\u003e\n- [Search in Rotated Array](./src/chapter10SortingAndSearching/SearchInRotatedArray.java) \u003cbr /\u003e\n- [Sort Big File](./src/chapter10SortingAndSearching/SortBigFile.java) \u003cbr /\u003e\n- [Sorted Merge](./src/chapter10SortingAndSearching/SortedMerge.java) \u003cbr /\u003e\n- [Sorted Search No Size](./src/chapter10SortingAndSearching/SortedSearchNoSize.java) \u003cbr /\u003e\n- [Sparse Search](./src/chapter10SortingAndSearching/SparseSearch.java) \u003cbr /\u003e\n\n### Testing\n\n### Additional Review Problems (Moderate)\n\n### Additional Review Problems (Hard)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fturingfly%2Fcracking-the-coding-interview","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fturingfly%2Fcracking-the-coding-interview","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fturingfly%2Fcracking-the-coding-interview/lists"}