File tree
396 files changed
+140
-86
lines changed- Go
- chapter01
- 1.1 - Is Unique
- 1.2 - Check Perm
- 1.3 - URLify
- 1.4 - PalinPerm
- 1.5 - OneAway
- 1.6 - String Compression
- 1.7 - Rotate Matrix
- 1.8 - Zero Matrix
- 1.9 - String Rotation
- chapter02
- 2.1 - Remove Dups
- 2.2 - Return Kth to Last
- 2.3 - Delete Middle Node
- 2.4 - Partition
- 2.5 - Sum Lists
- 2.6 - Palindrome
- 2.7 - Intersection
- 2.8 - Loop Detection
- chapter03
- 3.1 - Three in One
- 3.2 - Stack Min
- 3.3 - Stack of Plates
- 3.4 - Queue via Stacks
- 3.5 - Sort Stack
- 3.6 - Animal Shelter
- chapter04
- 4.01 - Route Between Nodes.1
- 4.02 - Minimal Tree
- 4.03 - List of Depths
- 4.04 - Check Balanced
- 4.05 - Validate BST
- 4.06 - Successor
- 4.07 - Build Order
- 4.08 - First Common Ancestor
- 4.09 - BST Sequences
- 4.10 - Check Subtree
- 4.11 - Random Node
- 4.12 - Paths with Sum
- chapter05
- 5.1 - Insertion
- 5.2 - Binary to String
- 5.3 - Flip Bit To Win
- 5.4 - Next Number
- 5.5 - Debugger
- 5.6 - Conversion
- 5.7 - Pairwise Swap
- 5.8 - Draw Line
- chapter06
- 6.01 - Heavy Pill
- 6.02 - Basketball
- 6.03 - Dominos
- 6.04 - Ants on a Triangle
- 6.05 - Jugs of Water
- 6.06 - Blue-Eyed Island
- 6.07 - The Apocalypse
- 6.08 - The Egg Drop Problem
- 6.09 - 100 Lockers
- 6.10 - Poison
- chapter07
- 7.01 - Deck of Cards
- 7.02 - Call Center
- 7.03 - Jukebox
- 7.04 - Parking Lot
- 7.05 - Online Book Reader
- 7.06 - Jigsaw
- 7.07 - Chat Server
- 7.08 - Othello
- 7.09 - Circular Array
- 7.10 - Minesweeper
- 7.11 - File System
- 7.12 - Hash Table
- chapter08
- 8.01 - Triple Step
- 8.02 - Robot in a Grid
- 8.03 - Magic Index
- 8.04 - Power Set
- 8.05 - Recursive Multiply
- 8.06 - Towers of Hanoi
- 8.07 - Permutations without Dups
- 8.08 - Permutations with Dups
- 8.09 - Parens
- 8.10 - Paint Fill
- 8.11 - Coins
- 8.12 - Eight Queens
- 8.13 - Stack Boxes
- chapter09
- 9.1 - Stock Data
- 9.2 - Social Network
- 9.3 - Web Crawler
- 9.4 - Duplicate URLs
- 9.5 - Cache
- 9.6 - Sales Rank
- 9.7 - Personal Financial Manager
- 9.8 - Paste Bin
- chapter10
- 10.01 - Sorted Merge
- 10.02 - Group Anagrams
- 10.03 - Search In Rotated Array
- 10.04 - Sorted Search No Size
- 10.05 - Sparse Search
- 10.06 - Sort Big File
- 10.07 - Missing Int
- 10.08 - Find Duplicates
- 10.09 - Sorted Matrix Search
- 10.10 - Rank From Stream
- 10.11 - Peaks And Valleys
- JavaScript
- chapter01
- 1.1 - Is Unique
- 1.2 - Check Perm
- 1.3 - URLify
- 1.4 - PalinPerm
- 1.5 - OneAway
- 1.6 - String Compression
- 1.7 - Rotate Matrix
- 1.8 - Zero Matrix
- 1.9 - String Rotation
- chapter02
- 2.1 - Remove Dups
- 2.2 - Return Kth to Last
- 2.3 - Delete Middle Node
- 2.4 - Partition
- 2.5 - Sum Lists
- 2.6 - Palindrome
- 2.7 - Intersection
- 2.8 - Loop Detection
- chapter03
- 3.1 - Three in One
- 3.2 - Stack Min
- 3.3 - Stack of Plates
- 3.4 - Queue via Stacks
- 3.5 - Sort Stack
- 3.6 - Animal Shelter
- chapter04
- 4.01 - Route Between Nodes
- 4.02 - Minimal Tree
- 4.03 - List of Depths
- 4.04 - Check Balanced
- 4.05 - Validate BST
- 4.06 - Successor
- 4.07 - Build Order
- 4.08 - First Common Ancestor
- 4.09 - BST Sequences
- 4.10 - Check Subtree
- 4.11 - Random Node
- 4.12 - Paths with Sum
- chapter05
- 5.1 - Insertion
- 5.2 - Binary to String
- 5.3 - Flip Bit To Win
- 5.4 - Next Number
- 5.5 - Debugger
- 5.6 - Conversion
- 5.7 - Pairwise Swap
- 5.8 - Draw Line
- chapter06
- 6.01 - Heavy Pill
- 6.02 - Basketball
- 6.03 - Dominos
- 6.04 - Ants on a Triangle
- 6.05 - Jugs of Water
- 6.06 - Blue-Eyed Island
- 6.07 - The Apocalypse
- 6.08 - The Egg Drop Problem
- 6.09 - 100 Lockers
- 6.10 - Poison
- chapter07
- 7.01 - Deck of Cards
- 7.02 - Call Center
- 7.03 - Jukebox
- 7.04 - Parking Lot
- 7.05 - Online Book Reader
- 7.06 - Jigsaw
- 7.07 - Chat Server
- 7.08 - Othello
- 7.09 - Circular Array
- 7.10 - Minesweeper
- 7.11 - File System
- 7.12 - Hash Table
- chapter08
- 8.01 - Triple Step
- 8.02 - Robot in a Grid
- 8.03 - Magic Index
- 8.04 - Power Set
- 8.05 - Recursive Multiply
- 8.06 - Towers of Hanoi
- 8.07 - Permutations without Dups
- 8.08 - Permutations with Dups
- 8.09 - Parens
- 8.10 - Paint Fill
- 8.11 - Coins
- 8.12 - Eight Queens
- 8.13 - Stack Boxes
- 8.14 - Boolean Eval
- chapter09
- 9.1 - Stock Data
- 9.2 - Social Network
- 9.3 - Web Crawler
- 9.4 - Duplicate URLs
- 9.5 - Cache
- 9.6 - Sales Rank
- 9.7 - Personal Financial Manager
- 9.8 - Paste Bin
- chapter10
- 10.01 - Sorted Merge
- 10.02 - Group Anagrams
- 10.03 - Search In Rotated Array
- 10.04 - Sorted Search No Size
- 10.05 - Sparse Search
- 10.06 - Sort Big File
- 10.07 - Missing Int
- 10.08 - Find Duplicates
- 10.09 - Sorted Matrix Search
- 10.10 - Rank From Stream
- 10.11 - Peaks And Valleys
- Python
- chapter01
- 1.1 - Is Unique
- 1.2 - Check Perm
- 1.3 - URLify
- 1.4 - PalinPerm
- 1.5 - OneAway
- 1.6 - String Compression
- 1.7 - Rotate Matrix
- 1.8 - Zero Matrix
- 1.9 - String Rotation
- chapter02
- 2.1 - Remove Dups
- 2.2 - Return Kth to Last
- 2.3 - Delete Middle Node
- 2.4 - Partition
- 2.5 - Sum Lists
- 2.6 - Palindrome
- 2.7 - Intersection
- 2.8 - Loop Detection
- chapter03
- 3.1 - Three in One
- 3.2 - Stack Min
- 3.3 - Stack of Plates
- 3.4 - Queue via Stacks
- 3.5 - Sort Stack
- 3.6 - Animal Shelter
- chapter04
- 4.01 - Route Between Nodes
- 4.02 - Minimal Tree
- 4.03 - List of Depths
- 4.04 - Check Balanced
- 4.05 - Validate BST
- 4.06 - Successor
- 4.07 - Build Order
- 4.08 - First Common Ancestor
- 4.09 - BST Sequences
- 4.10 - Check Subtree
- 4.11 - Random Node
- 4.12 - Paths with Sum
- chapter05
- 5.1 - Insertion
- 5.2 - Binary to String
- 5.3 - Flip Bit To Win
- 5.4 - Next Number
- 5.5 - Debugger
- 5.6 - Conversion
- 5.7 - Pairwise Swap
- 5.8 - Draw Line
- chapter06
- 6.01 - Heavy Pill
- 6.02 - Basketball
- 6.03 - Dominos
- 6.04 - Ants on a Triangle
- 6.05 - Jugs of Water
- 6.06 - Blue-Eyed Island
- 6.07 - The Apocalypse
- 6.08 - The Egg Drop Problem
- 6.09 - 100 Lockers
- 6.10 - Poison
- chapter07
- 7.01 - Deck of Cards
- 7.02 - Call Center
- 7.03 - Jukebox
- 7.04 - Parking Lot
- 7.05 - Online Book Reader
- 7.06 - Jigsaw
- 7.07 - Chat Server
- 7.08 - Othello
- 7.09 - Circular Array
- 7.10 - Minesweeper
- 7.11 - File System
- 7.12 - Hash Table
- chapter08
- 8.01 - Triple Step
- 8.02 - Robot in a Grid
- 8.03 - Magic Index
- 8.04 - Power Set
- 8.05 - Recursive Multiply
- 8.06 - Towers of Hanoi
- 8.07 - Permutations without Dups
- 8.08 - Permutations with Dups
- 8.09 - Parens
- 8.10 - Paint Fill
- 8.11 - Coins
- 8.12 - Eight Queens
- 8.13 - Stack Boxes
- 8.14 - Boolean Eval
- chapter09
- 9.1 - Stock Data
- 9.2 - Social Network
- 9.3 - Web Crawler
- 9.4 - Duplicate URLs
- 9.5 - Cache
- 9.6 - Sales Rank
- 9.7 - Personal Financial Manager
- 9.8 - Paste Bin
- chapter10
- 10.01 - Sorted Merge
- 10.02 - Group Anagrams
- 10.03 - Search In Rotated Array
- 10.04 - Sorted Search No Size
- 10.05 - Sparse Search
- 10.06 - Sort Big File
- 10.07 - Missing Int
- 10.08 - Find Duplicates
- 10.09 - Sorted Matrix Search
- 10.10 - Rank From Stream
- 10.11 - Peaks And Valleys
- Ruby
- chapter01
- 1.1 - Is Unique
- 1.2 - Check Perm
- 1.3 - URLify
- 1.4 - PalinPerm
- 1.5 - OneAway
- 1.6 - String Compression
- 1.7 - Rotate Matrix
- 1.8 - Zero Matrix
- 1.9 - String Rotation
- chapter02
- 2.1 - Remove Dups
- 2.2 - Return Kth to Last
- 2.3 - Delete Middle Node
- 2.4 - Partition
- 2.5 - Sum Lists
- 2.6 - Palindrome
- 2.7 - Intersection
- 2.8 - Loop Detection
- chapter03
- 3.1 - Three in One
- 3.2 - Stack Min
- 3.3 - Stack of Plates
- 3.4 - Queue via Stacks
- 3.5 - Sort Stack
- 3.6 - Animal Shelter
- chapter04
- 4.01 - Route Between Nodes
- 4.02 - Minimal Tree
- 4.03 - List of Depths
- 4.04 - Check Balanced
- 4.05 - Validate BST
- 4.06 - Successor
- 4.07 - Build Order
- 4.08 - First Common Ancestor
- 4.09 - BST Sequences
- 4.10 - Check Subtree
- 4.11 - Random Node
- 4.12 - Paths with Sum
- chapter05
- 5.1 - Insertion
- 5.2 - Binary to String
- 5.3 - Flip Bit To Win
- 5.4 - Next Number
- 5.5 - Debugger
- 5.6 - Conversion
- 5.7 - Pairwise Swap
- 5.8 - Draw Line
- chapter06
- 6.01 - Heavy Pill
- 6.02 - Basketball
- 6.03 - Dominos
- 6.04 - Ants on a Triangle
- 6.05 - Jugs of Water
- 6.06 - Blue-Eyed Island
- 6.07 - The Apocalypse
- 6.08 - The Egg Drop Problem
- 6.09 - 100 Lockers
- 6.10 - Poison
- chapter07
- 7.01 - Deck of Cards
- 7.02 - Call Center
- 7.03 - Jukebox
- 7.04 - Parking Lot
- 7.05 - Online Book Reader
- 7.06 - Jigsaw
- 7.07 - Chat Server
- 7.08 - Othello
- 7.09 - Circular Array
- 7.10 - Minesweeper
- 7.11 - File System
- 7.12 - Hash Table
- chapter08
- 8.01 - Triple Step
- 8.02 - Robot in a Grid
- 8.03 - Magic Index
- 8.04 - Power Set
- 8.05 - Recursive Multiply
- 8.06 - Towers of Hanoi
- 8.07 - Permutations without Dups
- 8.08 - Permutations with Dups
- 8.09 - Parens
- 8.10 - Paint Fill
- 8.11 - Coins
- 8.12 - Eight Queens
- 8.13 - Stack Boxes
- 8.14 - Boolean Eval
- chapter09
- 9.1 - Stock Data
- 9.2 - Social Network
- 9.3 - Web Crawler
- 9.4 - Duplicate URLs
- 9.5 - Cache
- 9.6 - Sales Rank
- 9.7 - Personal Financial Manager
- 9.8 - Paste Bin
- chapter10
- 10.01 - Sorted Merge
- 10.02 - Group Anagrams
- 10.03 - Search In Rotated Array
- 10.04 - Sorted Search No Size
- 10.05 - Sparse Search
- 10.06 - Sort Big File
- 10.07 - Missing Int
- 10.08 - Find Duplicates
- 10.09 - Sorted Matrix Search
- 10.10 - Rank From Stream
- 10.11 - Peaks And Valleys
Some content is hidden
Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
396 files changed
+140
-86
lines changedLines changed: 140 additions & 0 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
| 1 | + | |
| 2 | + | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
| 6 | + | |
| 7 | + | |
| 8 | + | |
| 9 | + | |
| 10 | + | |
| 11 | + | |
| 12 | + | |
| 13 | + | |
| 14 | + | |
| 15 | + | |
| 16 | + | |
| 17 | + | |
| 18 | + | |
| 19 | + | |
| 20 | + | |
| 21 | + | |
| 22 | + | |
| 23 | + | |
| 24 | + | |
| 25 | + | |
| 26 | + | |
| 27 | + | |
| 28 | + | |
| 29 | + | |
| 30 | + | |
| 31 | + | |
| 32 | + | |
| 33 | + | |
| 34 | + | |
| 35 | + | |
| 36 | + | |
| 37 | + | |
| 38 | + | |
| 39 | + | |
| 40 | + | |
| 41 | + | |
| 42 | + | |
| 43 | + | |
| 44 | + | |
| 45 | + | |
| 46 | + | |
| 47 | + | |
| 48 | + | |
| 49 | + | |
| 50 | + | |
| 51 | + | |
| 52 | + | |
| 53 | + | |
| 54 | + | |
| 55 | + | |
| 56 | + | |
| 57 | + | |
| 58 | + | |
| 59 | + | |
| 60 | + | |
| 61 | + | |
| 62 | + | |
| 63 | + | |
| 64 | + | |
| 65 | + | |
| 66 | + | |
| 67 | + | |
| 68 | + | |
| 69 | + | |
| 70 | + | |
| 71 | + | |
| 72 | + | |
| 73 | + | |
| 74 | + | |
| 75 | + | |
| 76 | + | |
| 77 | + | |
| 78 | + | |
| 79 | + | |
| 80 | + | |
| 81 | + | |
| 82 | + | |
| 83 | + | |
| 84 | + | |
| 85 | + | |
| 86 | + | |
| 87 | + | |
| 88 | + | |
| 89 | + | |
| 90 | + | |
| 91 | + | |
| 92 | + | |
| 93 | + | |
| 94 | + | |
| 95 | + | |
| 96 | + | |
| 97 | + | |
| 98 | + | |
| 99 | + | |
| 100 | + | |
| 101 | + | |
| 102 | + | |
| 103 | + | |
| 104 | + | |
| 105 | + | |
| 106 | + | |
| 107 | + | |
| 108 | + | |
| 109 | + | |
| 110 | + | |
| 111 | + | |
| 112 | + | |
| 113 | + | |
| 114 | + | |
| 115 | + | |
| 116 | + | |
| 117 | + | |
| 118 | + | |
| 119 | + | |
| 120 | + | |
| 121 | + | |
| 122 | + | |
| 123 | + | |
| 124 | + | |
| 125 | + | |
| 126 | + | |
| 127 | + | |
| 128 | + | |
| 129 | + | |
| 130 | + | |
| 131 | + | |
| 132 | + | |
| 133 | + | |
| 134 | + | |
| 135 | + | |
| 136 | + | |
| 137 | + | |
| 138 | + | |
| 139 | + | |
| 140 | + |
Lines changed: 0 additions & 12 deletions
This file was deleted.
Whitespace-only changes.
Whitespace-only changes.
Whitespace-only changes.
Whitespace-only changes.
Whitespace-only changes.
Whitespace-only changes.
Whitespace-only changes.
Whitespace-only changes.
0 commit comments