{"id":20372631,"url":"https://github.com/txchen/localleet","last_synced_at":"2026-05-21T16:44:23.164Z","repository":{"id":26258930,"uuid":"29706146","full_name":"txchen/localleet","owner":"txchen","description":null,"archived":false,"fork":false,"pushed_at":"2016-06-29T22:31:48.000Z","size":324,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-15T06:47:44.522Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/txchen.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-01-22T23:35:49.000Z","updated_at":"2016-01-12T00:49:46.000Z","dependencies_parsed_at":"2022-08-26T17:23:27.264Z","dependency_job_id":null,"html_url":"https://github.com/txchen/localleet","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/txchen%2Flocalleet","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/txchen%2Flocalleet/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/txchen%2Flocalleet/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/txchen%2Flocalleet/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/txchen","download_url":"https://codeload.github.com/txchen/localleet/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241921840,"owners_count":20042763,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-15T01:14:11.875Z","updated_at":"2026-05-21T16:44:18.127Z","avatar_url":"https://github.com/txchen.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Localleet - leetcode on your desktop\n\n## csharp\n```bash\n$ cd csharp\n# restore nuget package\n$ dotnet restore\n# to run all the tests:\n$ dotnet test\n# To test only one class:\n$ dotnet test -class LocalLeet.QXXX\n```\n\n## Puzzles:\n\n| # | Title | Case count | Difficulty |\n|-----|---------------------------------------------------------------------------------------------------------------------------------------------------------|------------|------------|\n| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | 26 | Easy |\n| 241 | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/) | 24 | Medium |\n| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | 127 | Medium |\n| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | 18 | Hard |\n| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | 17 | Medium |\n| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | 83 | Easy |\n| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | 31 | Medium |\n| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | 27 | Easy |\n| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | 21 | Easy |\n| 233 | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one/) | 40 | Medium |\n| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | 17 | Easy |\n| 231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | 1108 | Easy |\n| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | 91 | Medium |\n| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii/) | 64 | Medium |\n| 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges/) | 26 | Easy |\n| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | 109 | Medium |\n| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | 68 | Easy |\n| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | 16 | Easy |\n| 224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator/) | 36 | Medium |\n| 223 | [Rectangle Area](https://leetcode.com/problems/rectangle-area/) | 3081 | Easy |\n| 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) | 18 | Medium |\n| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | 67 | Medium |\n| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/) | 29 | Medium |\n| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | 19 | Easy |\n| 218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/) | 33 | Hard |\n| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | 16 | Easy |\n| 216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii/) | 18 | Medium |\n| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | 27 | Medium |\n| 214 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/) | 116 | Hard |\n| 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii/) | 74 | Medium |\n| 212 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | 35 | Hard |\n| 211 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/) | 13 | Medium |\n| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | 34 | Medium |\n| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | 13 | Medium |\n| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) | 14 | Medium |\n| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule/) | 33 | Medium |\n| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | 27 | Easy |\n| 205 | [Isomorphic Strings](Isomorphic Strings) | 30 | Easy |\n| 204 | [Count Primes](https://leetcode.com/problems/count-primes/) | 20 | Easy |\n| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | 63 | Easy |\n| 202 | [Happy Number](https://leetcode.com/problems/happy-number/) | 400 | Easy |\n| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | 8266 | Medium |\n| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | 45 | Medium |\n| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | 210 | Medium |\n| 198 | [House Robber](https://leetcode.com/problems/house-robber/) | 69 | Easy |\n| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | 600 | Easy |\n| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | 600 | Easy |\n| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array/) | 33 | Easy |\n| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | 211 | Hard |\n| 187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/) | 30 | Medium |\n| 186 | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/) \u0026yen; | 0 | Medium |\n| 179 | [Largest Number](https://leetcode.com/problems/largest-number/) | 221 | Medium |\n| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game/) | 44 | Hard |\n| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | 61 | Medium |\n| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) | 502 | Easy |\n| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) | 1000 | Easy |\n| 170 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/) \u0026yen; | 0 | Easy |\n| 169 | [Majority Element](https://leetcode.com/problems/majority-element/) | 42 | Easy |\n| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | 18 | Easy |\n| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) \u0026yen; | 0 | Medium |\n| 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) | 35 | Medium |\n| 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | 69 | Easy |\n| 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap/) | 16 | Hard |\n| 163 | [Missing Ranges](https://leetcode.com/problems/missing-ranges/) \u0026yen; | 0 | Medium |\n| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | 58 | Medium |\n| 161 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance/)\u0026yen; | 0 | Medium |\n| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | 42 | Easy |\n| 159 | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/) \u0026yen; | 0 | Hard |\n| 158 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/) \u0026yen; | 0 | Hard |\n| 157 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/) \u0026yen; | 0 | Easy |\n| 156 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/) \u0026yen; | 0 | Medium |\n| 155 | [Min Stack](https://leetcode.com/problems/min-stack/) | 17 | Easy |\n| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) | 188 | Hard |\n| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | 146 | Medium |\n| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | 183 | Medium |\n| 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | 22 | Medium |\n| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | 20 | Medium |\n| 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/) | 27 | Hard |\n| 148 | [Sort List](https://leetcode.com/problems/sort-list/) | 15 | Medium |\n| 147 | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/) | 21 | Medium |\n| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | 17 | Hard |\n| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | 67 | Hard |\n| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | 67 | Medium |\n| 143 | [Reorder List](https://leetcode.com/problems/reorder-list/) | 13 | Medium |\n| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | 16 | Medium |\n| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | 16 | Medium |\n| 140 | [Word Break II](https://leetcode.com/problems/word-break-ii/) | 29 | Hard |\n| 139 | [Word Break](https://leetcode.com/problems/word-break/) | 26 | Medium |\n| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) | 11 | Hard |\n| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii/) | 11 | Medium |\n| 136 | [Single Number](https://leetcode.com/problems/single-number/) | 15 | Medium |\n| 135 | [Candy](https://leetcode.com/problems/candy/) | 28 | Hard |\n| 134 | [Gas Station](https://leetcode.com/problems/gas-station/) | 16 | Medium |\n| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph/) | 12 | Medium |\n| 132 | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/) | 27 | Hard |\n| 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | 20 | Medium |\n| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) | 56 | Medium |\n| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | 109 | Medium |\n| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | 67 | Hard |\n| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | 37 | Medium |\n| 126 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii/) | 37 | Hard |\n| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | 475 | Easy |\n| 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | 92 | Hard |\n| 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) | 198 | Hard |\n| 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | 198 | Medium |\n| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | 198 | Medium |\n| 120 | [Triangle](https://leetcode.com/problems/triangle/) | 43 | Medium |\n| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) | 34 | Easy |\n| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | 15 | Easy |\n| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | 61 | Hard |\n| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | 14 | Medium |\n| 115 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/) | 63 | Hard |\n| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) | 225 | Medium |\n| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii/) | 114 | Medium |\n| 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | 114 | Easy |\n| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | 41 | Easy |\n| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | 226 | Easy |\n| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) | 32 | Medium |\n| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | 32 | Medium |\n| 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/) | 34 | Easy |\n| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | 202 | Medium |\n| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | 202 | Medium |\n| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | 38 | Easy |\n| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | 33 | Medium |\n| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | 33 | Easy |\n| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | 190 | Easy |\n| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | 52 | Easy |\n| 099 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/) | 2516 | Hard |\n| 098 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | 54 | Medium |\n| 097 | [Interleaving String](https://leetcode.com/problems/interleaving-string/) | 99 | Hard |\n| 096 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) | 14 | Medium |\n| 095 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/) | 9 | Medium |\n| 094 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | 67 | Medium |\n| 093 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | 147 | Medium |\n| 092 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | 44 | Medium |\n| 091 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | 255 | Medium |\n| 090 | [Subsets II](https://leetcode.com/problems/subsets-ii/) | 19 | Medium |\n| 089 | [Gray Code](https://leetcode.com/problems/gray-code/) | 12 | Medium |\n| 088 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | 59 | Easy |\n| 087 | [Scramble String](https://leetcode.com/problems/scramble-string/) | 281 | Hard |\n| 086 | [Partition List](https://leetcode.com/problems/partition-list/) | 166 | Medium |\n| 085 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/) | 57 | Hard |\n| 084 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | 94 | Hard |\n| 083 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | 164 | Easy |\n| 082 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | 166 | Medium |\n| 081 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) | 271 | Medium |\n| 080 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | 164 | Medium |\n| 079 | [Word Search](https://leetcode.com/problems/word-search/) | 76 | Medium |\n| 078 | [Subsets](https://leetcode.com/problems/subsets/) | 10 | Medium |\n| 077 | [Combinations](https://leetcode.com/problems/combinations/) | 26 | Medium |\n| 076 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | 266 | Hard |\n| 075 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | 86 | Medium |\n| 074 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | 134 | Medium |\n| 073 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | 154 | Medium |\n| 072 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | 1145 | Hard |\n| 071 | [Simplify Path](https://leetcode.com/problems/simplify-path/) | 243 | Medium |\n| 070 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | 45 | Easy |\n| 069 | [Sqrt(x)](https://leetcode.com/problems/sqrtx/) | 1016 | Medium |\n| 068 | [Text Justification](https://leetcode.com/problems/text-justification/) | 24 | Hard |\n| 067 | [Add Binary](https://leetcode.com/problems/add-binary/) | 294 | Easy |\n| 066 | [Plus One](https://leetcode.com/problems/plus-one/) | 108 | Easy |\n| 065 | [Valid Number](https://leetcode.com/problems/valid-number/) | 1479 | Hard |\n| 064 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | 61 | Medium |\n| 063 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | 42 | Medium |\n| 062 | [Unique Paths](https://leetcode.com/problems/unique-paths/) | 61 | Medium |\n| 061 | [Rotate List](https://leetcode.com/problems/rotate-list/) | 229 | Medium |\n| 060 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence/) | 200 | Medium |\n| 059 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | 21 | Medium |\n| 058 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word/) | 59 | Easy |\n| 057 | [Insert Interval](https://leetcode.com/problems/insert-interval/) | 151 | Hard |\n| 056 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | 168 | Hard |\n| 055 | [Jump Game](https://leetcode.com/problems/jump-game/) | 66 | Medium |\n| 054 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | 21 | Medium |\n| 053 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | 200 | Medium |\n| 052 | [N-Queens II](https://leetcode.com/problems/n-queens-ii/) | 12 | Hard |\n| 051 | [N-Queens](https://leetcode.com/problems/n-queens/) | 9 | Hard |\n| 050 | [\"Pow(x, n)\"](https://leetcode.com/problems/powx-n/) | 299 | Medium |\n| 049 | [Anagrams](https://leetcode.com/problems/anagrams/) | 100 | Medium |\n| 048 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | 20 | Medium |\n| 047 | [Permutations II](https://leetcode.com/problems/permutations-ii/) | 30 | Hard |\n| 046 | [Permutations](https://leetcode.com/problems/permutations/) | 25 | Medium |\n| 045 | [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | 88 | Hard |\n| 044 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) | 1800 | Hard |\n| 043 | [Multiply Strings](https://leetcode.com/problems/multiply-strings/) | 311 | Medium |\n| 042 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | 314 | Hard |\n| 041 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | 156 | Hard |\n| 040 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | 172 | Medium |\n| 039 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | 168 | Medium |\n| 038 | [Count and Say](https://leetcode.com/problems/count-and-say/) | 18 | Easy |\n| 037 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | 6 | Hard |\n| 036 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | 500 | Easy |\n| 035 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | 62 | Medium |\n| 034 | [Search for a Range](https://leetcode.com/problems/search-for-a-range/) | 81 | Medium |\n| 033 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | 194 | Hard |\n| 032 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | 229 | Hard |\n| 031 | [Next Permutation](https://leetcode.com/problems/next-permutation/) | 265 | Medium |\n| 030 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/) | 160 | Hard |\n| 029 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | 987 | Medium |\n| 028 | [Implement strStr()](https://leetcode.com/problems/implement-strstr/) | 67 | Easy |\n| 027 | [Remove Element](https://leetcode.com/problems/remove-element/) | 112 | Easy |\n| 026 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | 160 | Easy |\n| 025 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | 81 | Hard |\n| 024 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | 55 | Medium |\n| 023 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | 129 | Hard |\n| 022 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | 8 | Medium |\n| 021 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | 208 | Easy |\n| 020 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | 61 | Easy |\n| 019 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | 207 | Easy |\n| 018 | [4Sum](https://leetcode.com/problems/4sum/) | 282 | Medium |\n| 017 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | 25 | Medium |\n| 016 | [3Sum Closest](https://leetcode.com/problems/3sum-closest/) | 119 | Medium |\n| 015 | [3Sum](https://leetcode.com/problems/3sum/) | 311 | Medium |\n| 014 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | 117 | Easy |\n| 013 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | 3999 | Easy |\n| 012 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | 3999 | Medium |\n| 011 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | 45 | Medium |\n| 010 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | 439 | Hard |\n| 009 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | 11499 | Easy |\n| 008 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | 1039 | Easy |\n| 007 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | 1020 | Easy |\n| 006 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/) | 1158 | Easy |\n| 005 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | 86 | Medium |\n| 004 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | 2078 | Hard |\n| 003 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | 1001 | Medium |\n| 002 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | 1555 | Medium |\n| 001 | [Two Sum](https://leetcode.com/problems/two-sum/) | 10 | Medium |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftxchen%2Flocalleet","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftxchen%2Flocalleet","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftxchen%2Flocalleet/lists"}