|
19 | 19 |
|
20 | 20 | ## Medium
|
21 | 21 |
|
22 |
| -| # | Problem | Solution | Time | Space | Tag | |
23 |
| -| --- | -------------------------------------------------------------------------------------------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------- | ---------------- | ---------- | ------------------------------------------------------------------------------- | |
24 |
| -| 1 | [String Compression](https://leetcode.com/problems/string-compression/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/stringCompression/README.md) | _O(n)_ | _O(n)_ | Two Pointers, String | |
25 |
| -| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/addTwoNumbers/README.md) | _O(n)_ | _O(1)_ | Linked List, Math, Recursion | |
26 |
| -| 3 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/insertDeleteGetRandom/README.md) | _O(1)_ | _O(n)_ | Array, Hash Table, Math, Design, Randomized | |
27 |
| -| 4 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/groupAnagrams/README.md) | _O(n\*k log(k))_ | _O(n\*K)_ | Array, Hash Table, String, Sorting | |
28 |
| -| 5 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/subarraySumEqualsK/README.md) | _O(n)_ | _O(n)_ | Array, Hash Table, Prefix Sum | |
29 |
| -| 6 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/mergeIntervals/README.md) | _O(n log n)_ | _O(n)_ | Array, Sorting | |
30 |
| -| 7 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/topkFrequentWords/README.md) | _O(n log n)_ | _O(n + k)_ | Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting | |
31 |
| -| 8 | [Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/longestSubarrayof1sAfterDeletingOneElement/README.md) | _O(n)_ | _O(1)_ | Array, Dynamic Programming, Sliding Window | |
32 |
| -| 9 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/maximizeDistanceToClosestPerson/README.md) | _O(n)_ | _O(1)_ | Array | |
33 |
| -| 10 | [Find the Prefix Common Array of Two Arrays](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/findThePrefixCommonArrayOfTwoArrays/README.md) | _O(n)_ | _O(n)_ | Array, Hash Table | |
34 |
| -| 11 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/findAllAnagramsInaString/README.md) | _O(n)_ | _O(1)_ | Hash Table, String, Sliding Window | |
35 |
| -| 12 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/binaryTreeLevelOrderTraversal/README.md) | _O(n)_ | _O(n)_ | Tree, Breadth-First, Search, Binary Tree | |
| 22 | +| # | Problem | Solution | Time | Space | Tag | |
| 23 | +| --- | -------------------------------------------------------------------------------------------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------- | ---------------- | ----------- | ------------------------------------------------------------------------------- | |
| 24 | +| 1 | [String Compression](https://leetcode.com/problems/string-compression/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/stringCompression/README.md) | _O(n)_ | _O(n)_ | Two Pointers, String | |
| 25 | +| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/addTwoNumbers/README.md) | _O(n)_ | _O(1)_ | Linked List, Math, Recursion | |
| 26 | +| 3 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/insertDeleteGetRandom/README.md) | _O(1)_ | _O(n)_ | Array, Hash Table, Math, Design, Randomized | |
| 27 | +| 4 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/groupAnagrams/README.md) | _O(n\*k log(k))_ | _O(n\*K)_ | Array, Hash Table, String, Sorting | |
| 28 | +| 5 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/subarraySumEqualsK/README.md) | _O(n)_ | _O(n)_ | Array, Hash Table, Prefix Sum | |
| 29 | +| 6 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/mergeIntervals/README.md) | _O(n log n)_ | _O(n)_ | Array, Sorting | |
| 30 | +| 7 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/topkFrequentWords/README.md) | _O(n log n)_ | _O(n + k)_ | Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting | |
| 31 | +| 8 | [Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/longestSubarrayof1sAfterDeletingOneElement/README.md) | _O(n)_ | _O(1)_ | Array, Dynamic Programming, Sliding Window | |
| 32 | +| 9 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/maximizeDistanceToClosestPerson/README.md) | _O(n)_ | _O(1)_ | Array | |
| 33 | +| 10 | [Find the Prefix Common Array of Two Arrays](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/findThePrefixCommonArrayOfTwoArrays/README.md) | _O(n)_ | _O(n)_ | Array, Hash Table | |
| 34 | +| 11 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/findAllAnagramsInaString/README.md) | _O(n)_ | _O(1)_ | Hash Table, String, Sliding Window | |
| 35 | +| 12 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/binaryTreeLevelOrderTraversal/README.md) | _O(n)_ | _O(n)_ | Tree, Breadth-First, Search, Binary Tree | |
| 36 | +| 13 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | [TypeScript](https://github.com/sandrig/leetcode/blob/master/typescript/src/numberOfIslands/README.md) | _O(m \* n)_ | _O(m \* n)_ | Array, Depth-First, Search Breadth-First Search, Union Find, Matrix | |
0 commit comments