The utility data structures are missing tests

Cracking the Coding Interview - TypeScript

Cracking the Coding Interview 6th Ed. TypeScript Solutions.

Table of Contents 📚

Instructions
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 for all commit messages. ✨

List of Coding Questions 🗂

Chapter 1	Chapter 2	Chapter 3
✅ 1.1 - Is Unique	✅ 2.1 - Remove Dups	✅ 3.1 - Three in One
✅ 1.2 - Check Permutation	✅ 2.2 - Return Kth to Last	✅ 3.2 - Stack Min
✅ 1.3 - URLify	✅ 2.3 - Delete Middle Node	✅ 3.3 - Stack of Plates
✅ 1.4 - Palindrome Permutation	✅ 2.4 - Partition	✅ 3.4 - Queue via Stacks
✅ 1.5 - One Away	✅ 2.5 - Sum Lists	✅ 3.5 - Sort Stack
✅ 1.6 - String Compression	✅ 2.6 - Palindrome	✅ 3.6 - Animal Shelter
✅ 1.7 - Rotate Matrix	✅ 2.7 - Intersection
✅ 1.8 - Zero Matrix	✅ 2.8 - Loop Detection
✅ 1.9 - String Rotation

Chapter 4	Chapter 5	Chapter 6
✅ 4.1 - Route Between Nodes	✅ 5.1 - Insertion	☑️ 6.1 - Heavy Pill
✅ 4.2 - Minimal Tree	✅ 5.2 - Binary to String	️️️️️☑️ 6.2 - Basketball
✅ 4.3 - List of Depths	✅ 5.3 - Flip Bit To Win	☑️ 6.3 - Dominos
✅ 4.4 - Check Balanced	✅ 5.4 - Next Number	☑️ 6.4 - Ants on a Triangle
✅ 4.5 - Validate BST	✅ 5.5 - Debugger	☑️ 6.5 - Jugs of Water
✅ 4.6 - Successor	✅ 5.6 - Conversion	☑️ 6.6 - Blue-Eyed Island
✅ 4.7 - Build Order	✅ 5.7 - Pairwise Swap	☑️ 6.7 - The Apocalypse
✅ 4.8 - First Common Ancestor	✅ 5.8 - Draw Line	☑️ 6.8 - The Egg Drop Problem
✅ 4.9 - BST Sequences		☑️ 6.9 - 100 Lockers
✅ 4.10 - Check Subtree		☑️ 6.10 - Poison
✅ 4.11 - Random Node
✅ 4.12 - Paths with Sum

Chapter 7	Chapter 8	Chapter 9
✅ 7.1 - Deck of Cards	✅ 8.1 - Triple Step	❌ 9.1 - Stock Data
✅ 7.2 - Call Center	✅ 8.2 - Robot in a Grid	❌ 9.2 - Social Network
✅ 7.3 - Jukebox	✅ 8.3 - Magic Index	❌ 9.3 - Web Crawler
✅ 7.4 - Parking Lot	✅ 8.4 - Power Set	❌ 9.4 - Duplicate URLs
❌ 7.5 - Online Book Reader	✅ 8.5 - Recursive Multiply	❌ 9.5 - Cache
❌ 7.6 - Jigsaw	✅ 8.6 - Towers of Hanoi	❌ 9.6 - Sales Rank
❌ 7.7 - Chat Server	✅ 8.7 - Permutations without Dups	❌ 9.7 - Personal Financial Manager
❌ 7.8 - Othello	✅ 8.8 - Permutations with Dups	❌ 9.8 - Paste Bin
❌ 7.9 - Circular Array	✅ 8.9 - Parens
❌ 7.10 - Minesweeper	✅ 8.10 - Paint Fill
❌ 7.11 - File System	✅ 8.11 - Coins
❌ 7.12 - Hash Table	✅ 8.12 - Eight Queens
❌ 7.11 - File System	✅ 8.13 - Stack Boxes
❌ 7.12 - Hash Table	✅ 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

braden1996 / cracking-the-coding-interview-typescript Goto Github PK

cracking-the-coding-interview-typescript's Introduction

Cracking the Coding Interview - TypeScript

Table of Contents 📚

Instructions 👨🏼‍💻

List of Coding Questions 🗂

cracking-the-coding-interview-typescript's People

Contributors

Stargazers

Watchers

Forkers

cracking-the-coding-interview-typescript's Issues

The utility data structures are missing tests

Why is position of rightmost non-trailing zero equal to c0 + c1?

Node.isBinarySearchTree, from Adjacency List, doesn't work if the node is not a valid tree

Ch-4_Ex-4.2 - Test does nothing to ensure the produced tree is of minimal height

Refactor Ch-4_Ex-4.2 through to Ch-4_Ex-4.6 (inclusively) to utilise new Graph util

Recommend Projects

React

Vue.js

Typescript

TensorFlow

Django

Laravel

D3

Recommend Topics

javascript

web

server

Machine learning

Visualization

Game

Recommend Org

Facebook

Microsoft

Google

Alibaba

D3

Tencent