https://github.com/ashishpatel26/leetcode_solution
LeetCode Solution
https://github.com/ashishpatel26/leetcode_solution
deeplearning github leetcode machinelearning python scikit-learn
Last synced: 6 months ago
JSON representation
LeetCode Solution
- Host: GitHub
- URL: https://github.com/ashishpatel26/leetcode_solution
- Owner: ashishpatel26
- License: mit
- Created: 2022-01-21T05:46:43.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2022-01-21T10:51:09.000Z (almost 4 years ago)
- Last Synced: 2025-04-02T17:53:04.088Z (7 months ago)
- Topics: deeplearning, github, leetcode, machinelearning, python, scikit-learn
- Language: Jupyter Notebook
- Homepage:
- Size: 32.2 KB
- Stars: 10
- Watchers: 2
- Forks: 6
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LeetCode_Solution
LeetCode: https://leetcode.com/problemset/all/
| # | Title | Difficulty | Colab Code |
| ---- | ------------------------------------------------------------ | ---------- | ------------------------------------------------------------ |
| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | [](https://colab.research.google.com/github/ashishpatel26/LeetCode_Solution/blob/main/Notebooks/0001.%20Sum%20of%20Two%20Numbers.ipynb) |
| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | Medium | [](https://colab.research.google.com/github/ashishpatel26/LeetCode_Solution/blob/main/Notebooks/0002.Add%20Two%20Numbers.ipynb) |
| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 15 | [3Sum](https://leetcode.com/problems/3sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 18 | [4Sum](https://leetcode.com/problems/4sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 27 | [Remove Element](https://leetcode.com/problems/remove-element) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 30 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 37 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 40 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 44 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 45 | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 46 | [Permutations](https://leetcode.com/problems/permutations) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 47 | [Permutations II](https://leetcode.com/problems/permutations-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 51 | [N-Queens](https://leetcode.com/problems/n-queens) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 55 | [Jump Game](https://leetcode.com/problems/jump-game) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 61 | [Rotate List](https://leetcode.com/problems/rotate-list) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 66 | [Plus One](https://leetcode.com/problems/plus-one) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 67 | [Add Binary](https://leetcode.com/problems/add-binary) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 68 | [Text Justification](https://leetcode.com/problems/text-justification) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 74 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 76 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 77 | [Combinations](https://leetcode.com/problems/combinations) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 78 | [Subsets](https://leetcode.com/problems/subsets) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 79 | [Word Search](https://leetcode.com/problems/word-search) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 81 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 84 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 85 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 86 | [Partition List](https://leetcode.com/problems/partition-list) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 93 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 96 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 99 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 100 | [Same Tree](https://leetcode.com/problems/same-tree) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 120 | [Triangle](https://leetcode.com/problems/triangle) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 126 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 134 | [Gas Station](https://leetcode.com/problems/gas-station) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 135 | [Candy](https://leetcode.com/problems/candy) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 136 | [Single Number](https://leetcode.com/problems/single-number) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 139 | [Word Break](https://leetcode.com/problems/word-break) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 140 | [Word Break II](https://leetcode.com/problems/word-break-ii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 143 | [Reorder List](https://leetcode.com/problems/reorder-list) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 159 | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 169 | [Majority Element](https://leetcode.com/problems/majority-element) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 179 | [Largest Number](https://leetcode.com/problems/largest-number) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 198 | [House Robber](https://leetcode.com/problems/house-robber) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 211 | [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 212 | [Word Search II](https://leetcode.com/problems/word-search-ii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 244 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 258 | [Add Digits](https://leetcode.com/problems/add-digits) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 261 | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 268 | [Missing Number](https://leetcode.com/problems/missing-number) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 269 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 273 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 277 | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 285 | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 286 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 289 | [Game of Life](https://leetcode.com/problems/game-of-life) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 296 | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 322 | [Coin Change](https://leetcode.com/problems/coin-change) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 323 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 324 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 329 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 344 | [Reverse String](https://leetcode.com/problems/reverse-string) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 346 | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 348 | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 353 | [Design Snake Game](https://leetcode.com/problems/design-snake-game) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 354 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 355 | [Design Twitter](https://leetcode.com/problems/design-twitter) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 362 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 366 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 373 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 388 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 394 | [Decode String](https://leetcode.com/problems/decode-string) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 400 | [Nth Digit](https://leetcode.com/problems/nth-digit) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 402 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 403 | [Frog Jump](https://leetcode.com/problems/frog-jump) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 407 | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 410 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 415 | [Add Strings](https://leetcode.com/problems/add-strings) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 432 | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 443 | [String Compression](https://leetcode.com/problems/string-compression) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 449 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 454 | [4Sum II](https://leetcode.com/problems/4sum-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 456 | [132 Pattern](https://leetcode.com/problems/132-pattern) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 460 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 471 | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 472 | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 490 | [The Maze](https://leetcode.com/problems/the-maze) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 493 | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 494 | [Target Sum](https://leetcode.com/problems/target-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 498 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 503 | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 523 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 525 | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 535 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 540 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 542 | [01 Matrix](https://leetcode.com/problems/01-matrix) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 545 | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 547 | [Number of Provinces](https://leetcode.com/problems/number-of-provinces) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1730 | [Shortest Path to Get Food](https://leetcode.com/problems/shortest-path-to-get-food) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 564 | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 588 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 621 | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 632 | [Smallest Range Covering Elements from K Lists](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 635 | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 636 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 642 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 646 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 652 | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 675 | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 678 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 682 | [Baseball Game](https://leetcode.com/problems/baseball-game) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 684 | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 685 | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 688 | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 694 | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 713 | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 715 | [Range Module](https://leetcode.com/problems/range-module) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 716 | [Max Stack](https://leetcode.com/problems/max-stack) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 718 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 721 | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 726 | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 727 | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 733 | [Flood Fill](https://leetcode.com/problems/flood-fill) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 752 | [Open the Lock](https://leetcode.com/problems/open-the-lock) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 759 | [Employee Free Time](https://leetcode.com/problems/employee-free-time) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 428 | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 763 | [Partition Labels](https://leetcode.com/problems/partition-labels) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 590 | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 767 | [Reorganize String](https://leetcode.com/problems/reorganize-string) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 772 | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 775 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 790 | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 792 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 794 | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 796 | [Rotate String](https://leetcode.com/problems/rotate-string) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 815 | [Bus Routes](https://leetcode.com/problems/bus-routes) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 819 | [Most Common Word](https://leetcode.com/problems/most-common-word) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 826 | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 829 | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 641 | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 489 | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 836 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 853 | [Car Fleet](https://leetcode.com/problems/car-fleet) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 856 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 862 | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 863 | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 875 | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 528 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 887 | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 889 | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 895 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 898 | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 901 | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 909 | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 912 | [Sort an Array](https://leetcode.com/problems/sort-an-array) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 931 | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 937 | [Reorder Data in Log Files](https://leetcode.com/problems/reorder-data-in-log-files) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 939 | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 953 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 957 | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 970 | [Powerful Integers](https://leetcode.com/problems/powerful-integers) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 973 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 979 | [Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 980 | [Unique Paths III](https://leetcode.com/problems/unique-paths-iii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 981 | [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 986 | [Interval List Intersections](https://leetcode.com/problems/interval-list-intersections) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 987 | [Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 992 | [Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 993 | [Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 994 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1000 | [Minimum Cost to Merge Stones](https://leetcode.com/problems/minimum-cost-to-merge-stones) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1002 | [Find Common Characters](https://leetcode.com/problems/find-common-characters) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1008 | [Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1057 | [Campus Bikes](https://leetcode.com/problems/campus-bikes) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1010 | [Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1011 | [Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1060 | [Missing Element in Sorted Array](https://leetcode.com/problems/missing-element-in-sorted-array) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1087 | [Brace Expansion](https://leetcode.com/problems/brace-expansion) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1024 | [Video Stitching](https://leetcode.com/problems/video-stitching) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1099 | [Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1120 | [Maximum Average Subtree](https://leetcode.com/problems/maximum-average-subtree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1026 | [Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1031 | [Maximum Sum of Two Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1135 | [Connecting Cities With Minimum Cost](https://leetcode.com/problems/connecting-cities-with-minimum-cost) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1152 | [Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1160 | [Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1041 | [Robot Bounded In Circle](https://leetcode.com/problems/robot-bounded-in-circle) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1043 | [Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1044 | [Longest Duplicate Substring](https://leetcode.com/problems/longest-duplicate-substring) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1166 | [Design File System](https://leetcode.com/problems/design-file-system) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1167 | [Minimum Cost to Connect Sticks](https://leetcode.com/problems/minimum-cost-to-connect-sticks) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1047 | [Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1180 | [Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1197 | [Minimum Knight Moves](https://leetcode.com/problems/minimum-knight-moves) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1071 | [Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1229 | [Meeting Scheduler](https://leetcode.com/problems/meeting-scheduler) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1091 | [Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1244 | [Design A Leaderboard](https://leetcode.com/problems/design-a-leaderboard) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1105 | [Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1106 | [Parsing A Boolean Expression](https://leetcode.com/problems/parsing-a-boolean-expression) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1110 | [Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1122 | [Relative Sort Array](https://leetcode.com/problems/relative-sort-array) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1138 | [Alphabet Board Path](https://leetcode.com/problems/alphabet-board-path) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1313 | [Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1314 | [Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1143 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1328 | [Break a Palindrome](https://leetcode.com/problems/break-a-palindrome) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1329 | [Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1302 | [Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1156 | [Swap For Longest Repeated Character Substring](https://leetcode.com/problems/swap-for-longest-repeated-character-substring) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1155 | [Number of Dice Rolls With Target Sum](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1236 | [Web Crawler](https://leetcode.com/problems/web-crawler) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1169 | [Invalid Transactions](https://leetcode.com/problems/invalid-transactions) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1360 | [Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1382 | [Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1483 | [Kth Ancestor of a Tree Node](https://leetcode.com/problems/kth-ancestor-of-a-tree-node) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1190 | [Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1192 | [Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1405 | [Longest Happy String](https://leetcode.com/problems/longest-happy-string) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1209 | [Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1217 | [Minimum Cost to Move Chips to The Same Position](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1220 | [Count Vowels Permutation](https://leetcode.com/problems/count-vowels-permutation) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1222 | [Queens That Can Attack the King](https://leetcode.com/problems/queens-that-can-attack-the-king) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1233 | [Remove Sub-Folders from the Filesystem](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1235 | [Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1429 | [First Unique Number](https://leetcode.com/problems/first-unique-number) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1249 | [Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1254 | [Number of Closed Islands](https://leetcode.com/problems/number-of-closed-islands) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1255 | [Maximum Score Words Formed by Letters](https://leetcode.com/problems/maximum-score-words-formed-by-letters) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1268 | [Search Suggestions System](https://leetcode.com/problems/search-suggestions-system) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1275 | [Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1277 | [Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1293 | [Shortest Path in a Grid with Obstacles Elimination](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1312 | [Minimum Insertion Steps to Make a String Palindrome](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1344 | [Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1345 | [Jump Game IV](https://leetcode.com/problems/jump-game-iv) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1335 | [Minimum Difficulty of a Job Schedule](https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1351 | [Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1365 | [How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1386 | [Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1376 | [Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1395 | [Count Number of Teams](https://leetcode.com/problems/count-number-of-teams) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1431 | [Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1448 | [Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1465 | [Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1491 | [Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1480 | [Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1481 | [Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1487 | [Making File Names Unique](https://leetcode.com/problems/making-file-names-unique) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1496 | [Path Crossing](https://leetcode.com/problems/path-crossing) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1539 | [Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1559 | [Detect Cycles in 2D Grid](https://leetcode.com/problems/detect-cycles-in-2d-grid) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1547 | [Minimum Cost to Cut a Stick](https://leetcode.com/problems/minimum-cost-to-cut-a-stick) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1603 | [Design Parking System](https://leetcode.com/problems/design-parking-system) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1600 | [Throne Inheritance](https://leetcode.com/problems/throne-inheritance) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1597 | [Build Binary Expression Tree From Infix Expression](https://leetcode.com/problems/build-binary-expression-tree-from-infix-expression) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1636 | [Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1629 | [Slowest Key](https://leetcode.com/problems/slowest-key) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1641 | [Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1670 | [Design Front Middle Back Queue](https://leetcode.com/problems/design-front-middle-back-queue) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1628 | [Design an Expression Tree With Evaluate Function](https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1647 | [Minimum Deletions to Make Character Frequencies Unique](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1648 | [Sell Diminishing-Valued Colored Balls](https://leetcode.com/problems/sell-diminishing-valued-colored-balls) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1650 | [Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1673 | [Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1710 | [Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1751 | [Maximum Number of Events That Can Be Attended II](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1740 | [Find Distance in a Binary Tree](https://leetcode.com/problems/find-distance-in-a-binary-tree) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1761 | [Minimum Degree of a Connected Trio in a Graph](https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1770 | [Maximum Score from Performing Multiplication Operations](https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1799 | [Maximize Score After N Operations](https://leetcode.com/problems/maximize-score-after-n-operations) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1869 | [Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 176 | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 180 | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 184 | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 185 | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 196 | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 262 | [Trips and Users](https://leetcode.com/problems/trips-and-users) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 579 | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 615 | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 626 | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1164 | [Product Price at a Given Date](https://leetcode.com/problems/product-price-at-a-given-date) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1270 | [All People Report to the Given Manager](https://leetcode.com/problems/all-people-report-to-the-given-manager) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1479 | [Sales by Day of the Week](https://leetcode.com/problems/sales-by-day-of-the-week) | Hard | [](https://colab.research.google.com/github/Naereen/badges) |
| 1511 | [Customer Order Frequency](https://leetcode.com/problems/customer-order-frequency) | Easy | [](https://colab.research.google.com/github/Naereen/badges) |
| 1596 | [The Most Frequently Ordered Products for Each Customer](https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |
| 1783 | [Grand Slam Titles](https://leetcode.com/problems/grand-slam-titles) | Medium | [](https://colab.research.google.com/github/Naereen/badges) |