|
65 | 65 | | **0160** | [Intersection of Two Linked Lists][160] | Hash Table, Linked List, 2P | ![][easy] | |
|
66 | 66 | | **0169** | [Majority Element][169] | Array, Hash Table, Divide and Conquer, Sorting, Counting | ![][easy] | |
|
67 | 67 | | **0172** | [Factorial Trailing Zeroes][172] | Math | ![][medium] | |
|
| 68 | +| **0190** | [Reverse Bits][190] | Divide and Conquer, Bit Manip | ![][easy] | | |
68 | 69 | | **0191** | [Number of 1 Bits][191] | Divide & Conquer, Bit Manipulation | ![][easy] | |
|
69 | 70 | | **0193** | [Valid Phone Numbers][193] | Shell | ![][easy] | |
|
70 | 71 | | **0195** | [Tenth Line][195] | Shell | ![][easy] | |
|
|
103 | 104 | | **0344** | [Reverse String][344] | Two Pointers, String, Recursion | ![][easy] | |
|
104 | 105 | | **0345** | [Reverse Vowels of a String][345] | Two Pointers, String | ![][easy] | |
|
105 | 106 | | **0349** | [Intersection of Two Arrays][349] | Array, Hash Table, Two Pointers, Binary Search, Sorting | ![][easy] | |
|
| 107 | +| **0350** | [Intersection of Two Arrays II][350] | Array, Hash Table, Two Pointers, Binary Search, Sorting | ![][easy] | | |
106 | 108 | | **0367** | [Valid Perfect Square][367] | Math, Binary Search | ![][easy] | |
|
107 | 109 | | **0369** | [Plus One Linked List][369] | Linked List, Math | ![][medium] | 🔒 |
|
| 110 | +| **0374** | [Guess Number Higher or Lower][374] | Binary Search, Interactive | ![][easy] | | |
| 111 | +| **0383** | [Ransom Note][383] | Hash Table, String, Counting | ![][easy] | | |
108 | 112 | | **0387** | [First Unique Character in a String][387] | Hash Table, String, Queue, Counting | ![][easy] | |
|
109 | 113 | | **0389** | [Find the Difference][389] | Hash Table, String, Bit Manipulation, Sorting | ![][easy] | |
|
| 114 | +| **0392** | [Is Subsequence][392] | Two Pointers, String, DP | ![][easy] | | |
110 | 115 | | **0438** | [Find All Anagrams in a String][438] | Hash Table, String, Sliding Window | ![][medium] | |
|
111 | 116 | | **0442** | [Find All Duplicates][442] | Array, Hash Table | ![][medium] | |
|
112 | 117 | | **0445** | [Add Two Numbers II][445] | Linked List, Math, Stack | ![][medium] | |
|
|
199 | 204 | [160]: ./solution/0101-0200/160%20-%20Intersection%20of%20Two%20Linked%20Lists.md
|
200 | 205 | [169]: ./solution/0101-0200/169%20-%20Majority%20Element.md
|
201 | 206 | [172]: ./solution/0101-0200/172%20-%20Factorial%20Trailing%20Zeroes.md
|
| 207 | +[190]: ./solution/0101-0200/190%20-%20Reverse%20Bits.md |
202 | 208 | [191]: ./solution/0101-0200/191%20-%20Number%20of%201%20Bits.md
|
203 | 209 | [193]: ./solution/0101-0200/193%20-%20Valid%20Phone%20Numbers.md
|
204 | 210 | [195]: ./solution/0101-0200/195%20-%20Tenth%20Line.md
|
|
239 | 245 | [344]: ./solution/0301-0400/344%20-%20Reverse%20String.md
|
240 | 246 | [345]: ./solution/0301-0400/345%20-%20Reverse%20Vowels%20of%20a%20String.md
|
241 | 247 | [349]: ./solution/0301-0400/349%20-%20Intersection%20of%20Two%20Arrays.md
|
| 248 | +[350]: ./solution/0301-0400/350%20-%20Intersection%20of%20Two%20Arrays%20II.md |
242 | 249 | [367]: ./solution/0301-0400/367%20-%20Valid%20Perfect%20Square.md
|
243 | 250 | [369]: ./solution/0301-0400/369%20-%20Plus%20One%20Linked%20List.md
|
| 251 | +[374]: ./solution/0301-0400/374%20-%20Guess%20Number%20Higher%20or%20Lower.md |
| 252 | +[383]: ./solution/0301-0400/383%20-%20Ransom%20Note.md |
244 | 253 | [387]: ./solution/0301-0400/387%20-%20First%20Unique%20Character%20in%20a%20String.md
|
245 | 254 | [387]: ./solution/0301-0400/387%20-%20First%20Unique%20Character%20in%20a%20String.md
|
246 | 255 | [389]: ./solution/0301-0400/389%20-%20Find%20the%20Difference.md
|
| 256 | +[392]: ./solution/0301-0400/392%20-%20Is%20Subsequence.md |
247 | 257 | [438]: ./solution/0401-0500/438%20-%20Find%20All%20Anagrams%20in%20a%20String.md
|
248 | 258 | [442]: ./solution/0401-0500/442%20-%20Find%20All%20Duplicates%20in%20an%20Array.md
|
249 | 259 | [445]: ./solution/0401-0500/445%20-%20Add%20Two%20Numbers%20II.md
|
|
0 commit comments