Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/braden1996/cracking-the-coding-interview-typescript
Cracking the Coding Interview 6th Ed. TypeScript Solutions
https://github.com/braden1996/cracking-the-coding-interview-typescript
algorithms cracking-the-coding-interview data-structures logic prettier ts-jest tslint typescript
Last synced: 10 days ago
JSON representation
Cracking the Coding Interview 6th Ed. TypeScript Solutions
- Host: GitHub
- URL: https://github.com/braden1996/cracking-the-coding-interview-typescript
- Owner: Braden1996
- Created: 2019-01-26T10:19:43.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2019-03-31T14:43:42.000Z (over 5 years ago)
- Last Synced: 2024-10-11T20:45:52.987Z (27 days ago)
- Topics: algorithms, cracking-the-coding-interview, data-structures, logic, prettier, ts-jest, tslint, typescript
- Language: TypeScript
- Size: 145 KB
- Stars: 27
- Watchers: 4
- Forks: 6
- Open Issues: 4
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Cracking the Coding Interview - TypeScript
> Cracking the Coding Interview 6th Ed. TypeScript Solutions.
## Table of Contents 📚
- [Instructions](#instructions-)
- [List of Coding Questions](#list-of-coding-questions-)
## Instructions 👨🏼💻
- This repository contains TypeScript attempts on questions listed in the book.
- Under the directory for each question, you will find:
- an `index.test.ts` containing unit-tests;
- an `index.ts` containing devised solution(s).
- As a standard, we use [gitmoji](https://gitmoji.carloscuesta.me/) for all commit messages. ✨
## List of Coding Questions 🗂
| Chapter 1 | Chapter 2 | Chapter 3 |
| ---------------------------------------------------------------------------------------------- | -------------------------------------------------------------------------------- | --------------------------------------------------------------------------------- |
| ✅ [1.1 - Is Unique](src/chapter01_arrays-and-strings/1.1_is-unique) | ✅ [2.1 - Remove Dups](src/chapter02_linked-lists/2.1_remove-dups) | ✅ [3.1 - Three in One](src/chapter03_stacks-and-queues/3.1_three-in-one) |
| ✅ [1.2 - Check Permutation](src/chapter01_arrays-and-strings/1.2_check-permutation) | ✅ [2.2 - Return Kth to Last](src/chapter02_linked-lists/2.2_return-kth-to-last) | ✅ [3.2 - Stack Min](src/chapter03_stacks-and-queues/3.2_stack-min) |
| ✅ [1.3 - URLify](src/chapter01_arrays-and-strings/1.3_urlify) | ✅ [2.3 - Delete Middle Node](src/chapter02_linked-lists/2.3_delete-middle-node) | ✅ [3.3 - Stack of Plates](src/chapter03_stacks-and-queues/3.3_stack-of-plates) |
| ✅ [1.4 - Palindrome Permutation](src/chapter01_arrays-and-strings/1.4_palindrome_permutation) | ✅ [2.4 - Partition](src/chapter02_linked-lists/2.4_partition) | ✅ [3.4 - Queue via Stacks](src/chapter03_stacks-and-queues/3.4_queue-via-stacks) |
| ✅ [1.5 - One Away](src/chapter01_arrays-and-strings/1.5_one-away) | ✅ [2.5 - Sum Lists](src/chapter02_linked-lists/2.5_sum-lists) | ✅ [3.5 - Sort Stack](src/chapter03_stacks-and-queues/3.5_sort-stacks) |
| ✅ [1.6 - String Compression](src/chapter01_arrays-and-strings/1.6_string-compression) | ✅ [2.6 - Palindrome](src/chapter02_linked-lists/2.5_is-palindrome) | ✅ [3.6 - Animal Shelter](src/chapter03_stacks-and-queues/3.6_animal_shelter) |
| ✅ [1.7 - Rotate Matrix](src/chapter01_arrays-and-strings/1.7_rotate-matrix) | ✅ [2.7 - Intersection](src/chapter02_linked-lists/2.7_intersection) | |
| ✅ [1.8 - Zero Matrix](src/chapter01_arrays-and-strings/1.8_zero-matrix) | ✅ [2.8 - Loop Detection](src/chapter02_linked-lists/2.8_loop-detection) | |
| ✅ [1.9 - String Rotation](src/chapter01_arrays-and-strings/1.9_string-rotation) | | |
| ![]()
| ![]()
| ![]()
|
| Chapter 4 | Chapter 5 | Chapter 6 |
| ------------------------------------------------------------------------------------------ | -------------------------------------------------------------------------------- | ----------------------------- |
| ✅ [4.1 - Route Between Nodes](src/chapter04_trees-and-graphs/4.1_route-between-nodes) | ✅ [5.1 - Insertion](src/chapter05_bit-manipulation/5.1_insertion) | ☑️ 6.1 - Heavy Pill |
| ✅ [4.2 - Minimal Tree](src/chapter04_trees-and-graphs/4.2_minimal-tree) | ✅ [5.2 - Binary to String](src/chapter05_bit-manipulation/5.2_binary-to-string) | ️️️️️☑️ 6.2 - Basketball |
| ✅ [4.3 - List of Depths](src/chapter04_trees-and-graphs/4.3_list-of-depths) | ✅ [5.3 - Flip Bit To Win](src/chapter05_bit-manipulation/5.3_flip-bit-to-win) | ☑️ 6.3 - Dominos |
| ✅ [4.4 - Check Balanced](src/chapter04_trees-and-graphs/4.4_check-balanced) | ✅ [5.4 - Next Number](src/chapter05_bit-manipulation/5.4_next-number) | ☑️ 6.4 - Ants on a Triangle |
| ✅ [4.5 - Validate BST](src/chapter04_trees-and-graphs/4.5_validate-bst) | ✅ [5.5 - Debugger](src/chapter05_bit-manipulation/5.5_debugger) | ☑️ 6.5 - Jugs of Water |
| ✅ [4.6 - Successor](src/chapter04_trees-and-graphs/4.6_successor) | ✅ [5.6 - Conversion](src/chapter05_bit-manipulation/5.6_conversion) | ☑️ 6.6 - Blue-Eyed Island |
| ✅ [4.7 - Build Order](src/chapter04_trees-and-graphs/4.7_build-order) | ✅ [5.7 - Pairwise Swap](src/chapter05_bit-manipulation/5.7_pairwise-swap) | ☑️ 6.7 - The Apocalypse |
| ✅ [4.8 - First Common Ancestor](src/chapter04_trees-and-graphs/4.8_first-common-ancestor) | ✅ [5.8 - Draw Line](src/chapter05_bit-manipulation/5.8_draw-line) | ☑️ 6.8 - The Egg Drop Problem |
| ✅ [4.9 - BST Sequences](src/chapter04_trees-and-graphs/4.9_bst-sequences) | | ☑️ 6.9 - 100 Lockers |
| ✅ [4.10 - Check Subtree](src/chapter04_trees-and-graphs/4.10_check-subtree) | | ☑️ 6.10 - Poison |
| ✅ [4.11 - Random Node](src/chapter04_trees-and-graphs/4.11_random-node) | | |
| ✅ [4.12 - Paths with Sum](src/chapter04_trees-and-graphs/4.12_paths-with-sum) | | |
| ![]()
| ![]()
| ![]()
|
| Chapter 7 | Chapter 8 | Chapter 9 |
| -------------------------------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------------- | ----------------------------------- |
| ✅ [7.1 - Deck of Cards](src/chapter07_object-oriented-design/7.1_deck-of-cards) | ✅ [8.1 - Triple Step](src/chapter08_recursion-and-dynamic-programming/8.1_triple-step) | ❌ 9.1 - Stock Data |
| ✅ [7.2 - Call Center](src/chapter07_object-oriented-design/7.2_call-center) | ✅ [8.2 - Robot in a Grid](src/chapter08_recursion-and-dynamic-programming/8.2_robot-in-a-grid) | ❌ 9.2 - Social Network |
| ✅ [7.3 - Jukebox](src/chapter07_object-oriented-design/7.3_jukebox) | ✅ [8.3 - Magic Index](src/chapter08_recursion-and-dynamic-programming/8.3_magic-index) | ❌ 9.3 - Web Crawler |
| ✅ [7.4 - Parking Lot](src/chapter07_object-oriented-design/7.4_parking-lot) | ✅ [8.4 - Power Set](src/chapter08_recursion-and-dynamic-programming/8.4_power-set) | ❌ 9.4 - Duplicate URLs |
| ❌ 7.5 - Online Book Reader | ✅ [8.5 - Recursive Multiply](src/chapter08_recursion-and-dynamic-programming/8.5_recursive-multiply) | ❌ 9.5 - Cache |
| ❌ 7.6 - Jigsaw | ✅ [8.6 - Towers of Hanoi](src/chapter08_recursion-and-dynamic-programming/8.6_towers-of-hanoi) | ❌ 9.6 - Sales Rank |
| ❌ 7.7 - Chat Server | ✅ [8.7 - Permutations without Dups](src/chapter08_recursion-and-dynamic-programming/8.7_permutations-without-dups) | ❌ 9.7 - Personal Financial Manager |
| ❌ 7.8 - Othello | ✅ [8.8 - Permutations with Dups](src/chapter08_recursion-and-dynamic-programming/8.8_permutations-with-dups) | ❌ 9.8 - Paste Bin |
| ❌ 7.9 - Circular Array | ✅ [8.9 - Parens](src/chapter08_recursion-and-dynamic-programming/8.9_parens) | |
| ❌ 7.10 - Minesweeper | ✅ [8.10 - Paint Fill](src/chapter08_recursion-and-dynamic-programming/8.10_paint-fill) | |
| ❌ 7.11 - File System | ✅ [8.11 - Coins](src/chapter08_recursion-and-dynamic-programming/8.11_coins) | |
| ❌ 7.12 - Hash Table | ✅ [8.12 - Eight Queens](src/chapter08_recursion-and-dynamic-programming/8.12_eight-queens) | |
| ❌ 7.11 - File System | ✅ [8.13 - Stack Boxes](src/chapter08_recursion-and-dynamic-programming/8.13_stack-of-boxes) | |
| ❌ 7.12 - Hash Table | ✅ [8.14 - Boolean Evaluation](src/chapter08_recursion-and-dynamic-programming/8.14_boolean-evaluation) | |
| ![]()
| ![]()
| ![]()
|
| Chapter 10 | | |
| --------------------------------- | ------------------- | ------------------- |
| ❌ 10.1 - Sorted Merge |
| ❌ 10.2 - Group Anagrams |
| ❌ 10.3 - Search In Rotated Array |
| ❌ 10.4 - Sorted Search No Size |
| ❌ 10.5 - Sparse Search |
| ❌ 10.6 - Sort Big File |
| ❌ 10.7 - Missing Int |
| ❌ 10.8 - Find Duplicates |
| ❌ 10.9 - Sorted Matrix Search |
| ❌ 10.10 - Rank From Stream |
| ❌ 10.11 - Peaks And Valleys |
| ![]()
| ![]()
| ![]()
|