{"id":13702087,"url":"https://github.com/lennylxx/leetcode","last_synced_at":"2026-01-21T20:46:46.669Z","repository":{"id":28294104,"uuid":"31806626","full_name":"lennylxx/leetcode","owner":"lennylxx","description":"Pure C solution for LeetCode","archived":false,"fork":false,"pushed_at":"2022-11-30T16:09:13.000Z","size":414,"stargazers_count":334,"open_issues_count":3,"forks_count":119,"subscribers_count":25,"default_branch":"master","last_synced_at":"2024-11-13T09:40:35.282Z","etag":null,"topics":["leetcode","leetcode-c"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lennylxx.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-03-07T08:55:42.000Z","updated_at":"2024-11-03T16:58:27.000Z","dependencies_parsed_at":"2023-01-14T08:34:20.332Z","dependency_job_id":null,"html_url":"https://github.com/lennylxx/leetcode","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/lennylxx%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lennylxx%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lennylxx%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lennylxx%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lennylxx","download_url":"https://codeload.github.com/lennylxx/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252439393,"owners_count":21747998,"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":["leetcode","leetcode-c"],"created_at":"2024-08-02T21:00:31.020Z","updated_at":"2026-01-21T20:46:46.628Z","avatar_url":"https://github.com/lennylxx.png","language":"C","funding_links":[],"categories":["C"],"sub_categories":[],"readme":"Pure C solution for LeetCode\n============================\n\nThis project aims at solving [LeetCode algorithm problems] with pure C Language \nusing as little library functions as I can, which means except memory management\nfunctions and few string functions I will implement everything I need such\nas trees, stacks, queues and hash tables.\n\nParts of the problems don't provide C interface for solution, so I accomplished\nthem with C++ Language.\n\nCompile **C** files using command:\n\n    gcc -std=c99 -Wall src/foo.c -o foo\n\nCompile **C++** files using command:\n\n    g++ -std=c++11 -Wall src/bar.cpp -o bar\n\n**OR**\n\nYou can build all the files using `make` (Use MinGW GCC and GNU Make on Windows).\n\nThe `☢` means that you need to have a LeetCode Premium Subscription.\n\n|     | Problem                                                      | Solution           |\n| --- | ------------------------------------------------------------ | ------------------ |\n| 315 | [Count of Smaller Numbers After Self]                        |                    |\n| 314 | [Binary Tree Vertical Order Traversal] ☢                     |                    |\n| 313 | [Super Ugly Number]                                          | [C](src/313.c)     |\n| 312 | [Burst Balloons]                                             |                    |\n| 311 | [Sparse Matrix Multiplication] ☢                             |                    |\n| 310 | [Minimum Height Trees]                                       |                    |\n| 309 | [Best Time to Buy and Sell Stock with Cooldown]              |                    |\n| 308 | [Range Sum Query 2D - Mutable] ☢                             |                    |\n| 307 | [Range Sum Query - Mutable]                                  |                    |\n| 306 | [Additive Number]                                            |                    |\n| 305 | [Number of Islands II] ☢                                     |                    |\n| 304 | [Range Sum Query 2D - Immutable]                             |                    |\n| 303 | [Range Sum Query - Immutable]                                |                    |\n| 302 | [Smallest Rectangle Enclosing Black Pixels] ☢                |                    |\n| 301 | [Remove Invalid Parentheses]                                 |                    |\n| 300 | [Longest Increasing Subsequence]                             | [C](src/300.c)     |\n| 299 | [Bulls and Cows]                                             | [C](src/299.c)     |\n| 298 | [Binary Tree Longest Consecutive Sequence] ☢                 |                    |\n| 297 | [Serialize and Deserialize Binary Tree]                      | [C++](src/297.cpp) |\n| 296 | [Best Meeting Point] ☢                                       |                    |\n| 295 | [Find Median from Data Stream]                               | [C](src/295.c)     |\n| 294 | [Flip Game II] ☢                                             |                    |\n| 293 | [Flip Game] ☢                                                |                    |\n| 292 | [Nim Game]                                                   | [C](src/292.c)     |\n| 291 | [Word Pattern II] ☢                                          |                    |\n| 290 | [Word Pattern]                                               | [C++](src/290.cpp) |\n| 289 | [Game of Life]                                               | [C](src/289.c)     |\n| 288 | [Unique Word Abbreviation] ☢                                 |                    |\n| 287 | [Find the Duplicate Number]                                  |                    |\n| 286 | [Walls and Gates] ☢                                          |                    |\n| 285 | [Inorder Successor in BST] ☢                                 |                    |\n| 284 | [Peeking Iterator]                                           | [C++](src/284.cpp) |\n| 283 | [Move Zeroes]                                                | [C](src/283.c)     |\n| 282 | [Expression Add Operators]                                   |                    |\n| 281 | [Zigzag Iterator] ☢                                          |                    |\n| 280 | [Wiggle Sort] ☢                                              |                    |\n| 279 | [Perfect Squares]                                            | [C](src/279.c)     |\n| 278 | [First Bad Version]                                          | [C](src/278.c)     |\n| 277 | [Find the Celebrity] ☢                                       |                    |\n| 276 | [Paint Fence] ☢                                              |                    |\n| 275 | [H-Index II]                                                 | [C](src/275.c)     |\n| 274 | [H-Index]                                                    | [C](src/274.c)     |\n| 273 | [Integer to English Words]                                   |                    |\n| 272 | [Closest Binary Search Tree Value II] ☢                      |                    |\n| 271 | [Encode and Decode Strings] ☢                                |                    |\n| 270 | [Closest Binary Search Tree Value] ☢                         |                    |\n| 269 | [Alien Dictionary] ☢                                         |                    |\n| 268 | [Missing Number]                                             | [C](src/268.c)     |\n| 267 | [Palindrome Permutation II] ☢                                |                    |\n| 266 | [Palindrome Permutation] ☢                                   |                    |\n| 265 | [Paint House II] ☢                                           |                    |\n| 264 | [Ugly Number II]                                             | [C](src/264.c)     |\n| 263 | [Ugly Number]                                                | [C](src/263.c)     |\n| 261 | [Graph Valid Tree] ☢                                         |                    |\n| 260 | [Single Number III]                                          | [C](src/260.c)     |\n| 259 | [3Sum Smaller] ☢                                             |                    |\n| 258 | [Add Digits]                                                 | [C](src/258.c)     |\n| 257 | [Binary Tree Paths]                                          | [C++](src/257.cpp) |\n| 256 | [Paint House] ☢                                              |                    |\n| 255 | [Verify Preorder Sequence in Binary Search Tree] ☢           |                    |\n| 254 | [Factor Combinations] ☢                                      |                    |\n| 253 | [Meeting Rooms II] ☢                                         |                    |\n| 252 | [Meeting Rooms] ☢                                            |                    |\n| 251 | [Flatten 2D Vector] ☢                                        |                    |\n| 250 | [Count Univalue Subtrees] ☢                                  |                    |\n| 249 | [Group Shifted Strings] ☢                                    |                    |\n| 248 | [Strobogrammatic Number III] ☢                               |                    |\n| 247 | [Strobogrammatic Number II] ☢                                |                    |\n| 246 | [Strobogrammatic Number] ☢                                   |                    |\n| 245 | [Shortest Word Distance III] ☢                               |                    |\n| 244 | [Shortest Word Distance II] ☢                                |                    |\n| 243 | [Shortest Word Distance] ☢                                   |                    |\n| 242 | [Valid Anagram]                                              | [C](src/242.c)     |\n| 241 | [Different Ways to Add Parentheses]                          | [C++](src/241.cpp) |\n| 240 | [Search a 2D Matrix II]                                      | [C](src/240.c)     |\n| 239 | [Sliding Window Maximum]                                     |                    |\n| 238 | [Product of Array Except Self]                               | [C](src/238.c)     |\n| 237 | [Delete Node in a Linked List]                               | [C](src/237.c)     |\n| 236 | [Lowest Common Ancestor of a Binary Tree]                    | [C++](src/236.cpp) |\n| 235 | [Lowest Common Ancestor of a Binary Search Tree]             | [C](src/235.c)     |\n| 234 | [Palindrome Linked List]                                     | [C](src/234.c)     |\n| 233 | [Number of Digit One]                                        | [C](src/233.c)     |\n| 232 | [Implement Queue using Stacks]                               | [C](src/232.c)     |\n| 231 | [Power of Two]                                               | [C](src/231.c)     |\n| 230 | [Kth Smallest Element in a BST]                              | [C](src/230.c)     |\n| 229 | [Majority Element II]                                        |                    |\n| 228 | [Summary Ranges]                                             | [C](src/228.c)     |\n| 227 | [Basic Calculator II]                                        |                    |\n| 226 | [Invert Binary Tree]                                         | [C](src/226.c)     |\n| 225 | [Implement Stack using Queues]                               | [C](src/225.c)     |\n| 224 | [Basic Calculator]                                           | [C](src/224.c)     |\n| 223 | [Rectangle Area]                                             | [C](src/223.c)     |\n| 222 | [Count Complete Tree Nodes]                                  | [C](src/222.c)     |\n| 221 | [Maximal Square]                                             | [C++](src/221.cpp) |\n| 220 | [Contains Duplicate III]                                     |                    |\n| 219 | [Contains Duplicate II]                                      | [C](src/219.c)     |\n| 218 | [The Skyline Problem]                                        |                    |\n| 217 | [Contains Duplicate]                                         | [C](src/217.c)     |\n| 216 | [Combination Sum III]                                        | [C++](src/216.cpp) |\n| 215 | [Kth Largest Element in an Array]                            | [C](src/215.c)     |\n| 214 | [Shortest Palindrome]                                        |                    |\n| 213 | [House Robber II]                                            | [C](src/213.c)     |\n| 212 | [Word Search II]                                             | [C](src/212.c)     |\n| 211 | [Add and Search Word - Data structure design]                | [C](src/211.c)     |\n| 210 | [Course Schedule II]                                         |                    |\n| 209 | [Minimum Size Subarray Sum]                                  | [C](src/209.c)     |\n| 208 | [Implement Trie (Prefix Tree)]                               | [C](src/208.c)     |\n| 207 | [Course Schedule]                                            |                    |\n| 206 | [Reverse Linked List]                                        | [C](src/206.c)     |\n| 205 | [Isomorphic Strings]                                         | [C](src/205.c)     |\n| 204 | [Count Primes]                                               | [C](src/204.c)     |\n| 203 | [Remove Linked List Elements]                                | [C](src/203.c)     |\n| 202 | [Happy Number]                                               | [C](src/202.c)     |\n| 201 | [Bitwise AND of Numbers Range]                               | [C](src/201.c)     |\n| 200 | [Number of Islands]                                          | [C](src/200.c)     |\n| 199 | [Binary Tree Right Side View]                                | [C](src/199.c)     |\n| 198 | [House Robber]                                               | [C](src/198.c)     |\n| 191 | [Number of 1 Bits]                                           | [C](src/191.c)     |\n| 190 | [Reverse Bits]                                               | [C](src/190.c)     |\n| 189 | [Rotate Array]                                               | [C](src/189.c)     |\n| 188 | [Best Time to Buy and Sell Stock IV]                         |                    |\n| 187 | [Repeated DNA Sequences]                                     |                    |\n| 186 | [Reverse Words in a String II] ☢                             |                    |\n| 179 | [Largest Number]                                             | [C](src/179.c)     |\n| 174 | [Dungeon Game]                                               |                    |\n| 173 | [Binary Search Tree Iterator]                                | [C++](src/173.cpp) |\n| 172 | [Factorial Trailing Zeroes]                                  | [C](src/172.c)     |\n| 171 | [Excel Sheet Column Number]                                  | [C](src/171.c)     |\n| 170 | [Two Sum III - Data structure design] ☢                      |                    |\n| 169 | [Majority Element]                                           | [C](src/169.c)     |\n| 168 | [Excel Sheet Column Title]                                   | [C](src/168.c)     |\n| 167 | [Two Sum II - Input array is sorted] ☢                       |                    |\n| 166 | [Fraction to Recurring Decimal]                              |                    |\n| 165 | [Compare Version Numbers]                                    | [C](src/165.c)     |\n| 164 | [Maximum Gap]                                                | [C](src/164.c)     |\n| 163 | [Missing Ranges] ☢                                           |                    |\n| 162 | [Find Peak Element]                                          | [C](src/162.c)     |\n| 161 | [One Edit Distance] ☢                                        |                    |\n| 160 | [Intersection of Two Linked Lists]                           | [C](src/160.c)     |\n| 159 | [Longest Substring with At Most Two Distinct Characters] ☢   |                    |\n| 158 | [Read N Characters Given Read4 II - Call multiple times] ☢   |                    |\n| 157 | [Read N Characters Given Read4] ☢                            |                    |\n| 156 | [Binary Tree Upside Down] ☢                                  |                    |\n| 155 | [Min Stack]                                                  | [C](src/155.c)     |\n| 154 | [Find Minimum in Rotated Sorted Array II]                    | [C](src/154.c)     |\n| 153 | [Find Minimum in Rotated Sorted Array]                       | [C](src/153.c)     |\n| 152 | [Maximum Product Subarray]                                   | [C](src/152.c)     |\n| 151 | [Reverse Words in a String]                                  | [C](src/151.c)     |\n| 150 | [Evaluate Reverse Polish Notation]                           | [C](src/150.c)     |\n| 149 | [Max Points on a Line]                                       |                    |\n| 148 | [Sort List]                                                  | [C](src/148.c)     |\n| 147 | [Insertion Sort List]                                        | [C](src/147.c)     |\n| 146 | [LRU Cache]                                                  | [C](src/146.c)     |\n| 145 | [Binary Tree Postorder Traversal]                            | [C](src/145.c)     |\n| 144 | [Binary Tree Preorder Traversal]                             | [C++](src/144.cpp) |\n| 143 | [Reorder List]                                               | [C](src/143.c)     |\n| 142 | [Linked List Cycle II]                                       | [C](src/142.c)     |\n| 141 | [Linked List Cycle]                                          | [C](src/141.c)     |\n| 140 | [Word Break II]                                              |                    |\n| 139 | [Word Break]                                                 | [C++](src/139.cpp) |\n| 138 | [Copy List with Random Pointer]                              | [C](src/138.c)     |\n| 137 | [Single Number II]                                           |                    |\n| 136 | [Single Number]                                              | [C](src/136.c)     |\n| 135 | [Candy]                                                      |                    |\n| 134 | [Gas Station]                                                | [C](src/134.c)     |\n| 133 | [Clone Graph]                                                | [C++](src/133.cpp) |\n| 132 | [Palindrome Partitioning II]                                 | [C++](src/132.cpp) |\n| 131 | [Palindrome Partitioning]                                    | [C++](src/131.cpp) |\n| 130 | [Surrounded Regions]                                         |                    |\n| 129 | [Sum Root to Leaf Numbers]                                   | [C](src/129.c)     |\n| 128 | [Longest Consecutive Sequence]                               | [C](src/128.c)     |\n| 127 | [Word Ladder]                                                | [C++](src/127.cpp) |\n| 126 | [Word Ladder II]                                             |                    |\n| 125 | [Valid Palindrome]                                           | [C](src/125.c)     |\n| 124 | [Binary Tree Maximum Path Sum]                               |                    |\n| 123 | [Best Time to Buy and Sell Stock III]                        |                    |\n| 122 | [Best Time to Buy and Sell Stock II]                         | [C](src/122.c)     |\n| 121 | [Best Time to Buy and Sell Stock]                            | [C](src/121.c)     |\n| 120 | [Triangle]                                                   | [C](src/120.c)     |\n| 119 | [Pascal's Triangle II]                                       | [C](src/119.c)     |\n| 118 | [Pascal's Triangle]                                          | [C](src/118.c)     |\n| 117 | [Populating Next Right Pointers in Each Node II]             |                    |\n| 116 | [Populating Next Right Pointers in Each Node]                | [C](src/116.c)     |\n| 115 | [Distinct Subsequences]                                      | [C](src/115.c)     |\n| 114 | [Flatten Binary Tree to Linked List]                         | [C](src/114.c)     |\n| 113 | [Path Sum II]                                                | [C++](src/113.cpp) |\n| 112 | [Path Sum]                                                   | [C](src/112.c)     |\n| 111 | [Minimum Depth of Binary Tree]                               | [C](src/111.c)     |\n| 110 | [Balanced Binary Tree]                                       | [C](src/110.c)     |\n| 109 | [Convert Sorted List to Binary Search Tree]                  | [C++](src/109.cpp) |\n| 108 | [Convert Sorted Array to Binary Search Tree]                 | [C](src/108.c)     |\n| 107 | [Binary Tree Level Order Traversal II]                       | [C++](src/107.cpp) |\n| 106 | [Construct Binary Tree from Inorder and Postorder Traversal] | [C](src/106.c)     |\n| 105 | [Construct Binary Tree from Preorder and Inorder Traversal]  | [C](src/105.c)     |\n| 104 | [Maximum Depth of Binary Tree]                               | [C](src/104.c)     |\n| 103 | [Binary Tree Zigzag Level Order Traversal]                   | [C++](src/103.cpp) |\n| 102 | [Binary Tree Level Order Traversal]                          | [C](src/102.c)     |\n| 101 | [Symmetric Tree]                                             | [C](src/101.c)     |\n| 100 | [Same Tree]                                                  | [C](src/100.c)     |\n| 99  | [Recover Binary Search Tree]                                 |                    |\n| 98  | [Validate Binary Search Tree]                                | [C](src/98.c)      |\n| 97  | [Interleaving String]                                        |                    |\n| 96  | [Unique Binary Search Trees]                                 | [C](src/96.c)      |\n| 95  | [Unique Binary Search Trees II]                              | [C++](src/95.cpp)  |\n| 94  | [Binary Tree Inorder Traversal]                              | [C](src/94.c)      |\n| 93  | [Restore IP Addresses]                                       | [C++](src/93.cpp)  |\n| 92  | [Reverse Linked List II]                                     | [C](src/92.c)      |\n| 91  | [Decode Ways]                                                | [C](src/91.c)      |\n| 90  | [Subsets II]                                                 | [C++](src/90.cpp)  |\n| 89  | [Gray Code]                                                  | [C](src/89.c)      |\n| 88  | [Merge Sorted Array]                                         | [C](src/88.c)      |\n| 87  | [Scramble String]                                            |                    |\n| 86  | [Partition List]                                             | [C](src/86.c)      |\n| 85  | [Maximal Rectangle]                                          |                    |\n| 84  | [Largest Rectangle in Histogram]                             |                    |\n| 83  | [Remove Duplicates from Sorted List]                         | [C](src/83.c)      |\n| 82  | [Remove Duplicates from Sorted List II]                      | [C](src/82.c)      |\n| 81  | [Search in Rotated Sorted Array II]                          | [C](src/81.c)      |\n| 80  | [Remove Duplicates from Sorted Array II]                     | [C](src/80.c)      |\n| 79  | [Word Search]                                                | [C](src/79.c)      |\n| 78  | [Subsets]                                                    | [C++](src/78.cpp)  |\n| 77  | [Combinations]                                               | [C++](src/77.cpp)  |\n| 76  | [Minimum Window Substring]                                   |                    |\n| 75  | [Sort Colors]                                                | [C](src/75.c)      |\n| 74  | [Search a 2D Matrix]                                         | [C](src/74.c)      |\n| 73  | [Set Matrix Zeroes]                                          | [C](src/73.c)      |\n| 72  | [Edit Distance]                                              | [C](src/72.c)      |\n| 71  | [Simplify Path]                                              |                    |\n| 70  | [Climbing Stairs]                                            | [C](src/70.c)      |\n| 69  | [Sqrt(x)]                                                    | [C](src/69.c)      |\n| 68  | [Text Justification]                                         |                    |\n| 67  | [Add Binary]                                                 | [C](src/67.c)      |\n| 66  | [Plus One]                                                   | [C](src/66.c)      |\n| 65  | [Valid Number]                                               | [C](src/65.c)      |\n| 64  | [Minimum Path Sum]                                           | [C](src/64.c)      |\n| 63  | [Unique Paths II]                                            | [C](src/63.c)      |\n| 62  | [Unique Paths]                                               | [C](src/62.c)      |\n| 61  | [Rotate List]                                                | [C](src/61.c)      |\n| 60  | [Permutation Sequence]                                       | [C++](src/60.cpp)  |\n| 59  | [Spiral Matrix II]                                           | [C](src/59.c)      |\n| 58  | [Length of Last Word]                                        | [C](src/58.c)      |\n| 57  | [Insert Interval]                                            |                    |\n| 56  | [Merge Intervals]                                            |                    |\n| 55  | [Jump Game]                                                  | [C](src/55.c)      |\n| 54  | [Spiral Matrix]                                              | [C](src/54.c)      |\n| 53  | [Maximum Subarray]                                           | [C](src/53.c)      |\n| 52  | [N-Queens II]                                                | [C](src/52.c)      |\n| 51  | [N-Queens]                                                   | [C++](src/51.cpp)  |\n| 50  | [Pow(x, n)]                                                  | [C](src/50.c)      |\n| 49  | [Anagrams]                                                   | [C++](src/49.cpp)  |\n| 48  | [Rotate Image]                                               | [C](src/48.c)      |\n| 47  | [Permutations II]                                            |                    |\n| 46  | [Permutations]                                               | [C](src/46.c)      |\n| 45  | [Jump Game II]                                               |                    |\n| 44  | [Wildcard Matching]                                          | [C](src/44.c)      |\n| 43  | [Multiply Strings]                                           | [C](src/43.c)      |\n| 42  | [Trapping Rain Water]                                        |                    |\n| 41  | [First Missing Positive]                                     | [C](src/41.c)      |\n| 40  | [Combination Sum II]                                         | [C++](src/40.cpp)  |\n| 39  | [Combination Sum]                                            | [C++](src/39.cpp)  |\n| 38  | [Count and Say]                                              | [C](src/38.c)      |\n| 37  | [Sudoku Solver]                                              | [C++](src/37.cpp)  |\n| 36  | [Valid Sudoku]                                               | [C](src/36.c)      |\n| 35  | [Search Insert Position]                                     | [C](src/35.c)      |\n| 34  | [Search for a Range]                                         | [C++](src/34.cpp)  |\n| 33  | [Search in Rotated Sorted Array]                             | [C](src/33.c)      |\n| 32  | [Longest Valid Parentheses]                                  |                    |\n| 31  | [Next Permutation]                                           | [C](src/31.c)      |\n| 30  | [Substring with Concatenation of All Words]                  |                    |\n| 29  | [Divide Two Integers]                                        |                    |\n| 28  | [Implement strStr()]                                         | [C](src/28.c)      |\n| 27  | [Remove Element]                                             | [C](src/27.c)      |\n| 26  | [Remove Duplicates from Sorted Array]                        | [C](src/26.c)      |\n| 25  | [Reverse Nodes in k-Group]                                   | [C](src/25.c)      |\n| 24  | [Swap Nodes in Pairs]                                        | [C](src/24.c)      |\n| 23  | [Merge k Sorted Lists]                                       | [C](src/23.c)      |\n| 22  | [Generate Parentheses]                                       | [C++](src/22.cpp)  |\n| 21  | [Merge Two Sorted Lists]                                     | [C](src/21.c)      |\n| 20  | [Valid Parentheses]                                          | [C](src/20.c)      |\n| 19  | [Remove Nth Node From End of List]                           | [C](src/19.c)      |\n| 18  | [4Sum]                                                       |                    |\n| 17  | [Letter Combinations of a Phone Number]                      | [C++](src/17.cpp)  |\n| 16  | [3Sum Closest]                                               |                    |\n| 15  | [3Sum]                                                       | [C++](src/15.cpp)  |\n| 14  | [Longest Common Prefix]                                      | [C](src/14.c)      |\n| 13  | [Roman to Integer]                                           | [C](src/13.c)      |\n| 12  | [Integer to Roman]                                           | [C](src/12.c)      |\n| 11  | [Container With Most Water]                                  |                    |\n| 10  | [Regular Expression Matching]                                |                    |\n| 9   | [Palindrome Number]                                          | [C](src/9.c)       |\n| 8   | [String to Integer (atoi)]                                   | [C](src/8.c)       |\n| 7   | [Reverse Integer]                                            | [C](src/7.c)       |\n| 6   | [ZigZag Conversion]                                          | [C](src/6.c)       |\n| 5   | [Longest Palindromic Substring]                              | [C++](src/5.cpp)   |\n| 4   | [Median of Two Sorted Arrays]                                |                    |\n| 3   | [Longest Substring Without Repeating Characters]             |                    |\n| 2   | [Add Two Numbers]                                            | [C](src/2.c)       |\n| 1   | [Two Sum]                                                    | [C](src/1.c)       |\n\n\n[LeetCode algorithm problems]: https://leetcode.com/problemset/algorithms/\n\n\n[Count of Smaller Numbers After Self]: https://leetcode.com/problems/count-of-smaller-numbers-after-self/\n[Binary Tree Vertical Order Traversal]: https://leetcode.com/problems/binary-tree-vertical-order-traversal/\n[Super Ugly Number]: https://leetcode.com/problems/super-ugly-number/\n[Burst Balloons]: https://leetcode.com/problems/burst-balloons/\n[Sparse Matrix Multiplication]: https://leetcode.com/problems/sparse-matrix-multiplication/\n[Minimum Height Trees]: https://leetcode.com/problems/minimum-height-trees/\n[Best Time to Buy and Sell Stock with Cooldown]: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/\n[Range Sum Query 2D - Mutable]: https://leetcode.com/problems/range-sum-query-2d-mutable/\n[Range Sum Query - Mutable]: https://leetcode.com/problems/range-sum-query-mutable/\n[Additive Number]: https://leetcode.com/problems/additive-number/\n[Number of Islands II]: https://leetcode.com/problems/number-of-islands-ii/\n[Range Sum Query 2D - Immutable]: https://leetcode.com/problems/range-sum-query-2d-immutable/\n[Range Sum Query - Immutable]: https://leetcode.com/problems/range-sum-query-immutable/\n[Smallest Rectangle Enclosing Black Pixels]: https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/\n[Remove Invalid Parentheses]: https://leetcode.com/problems/remove-invalid-parentheses/\n[Longest Increasing Subsequence]: https://leetcode.com/problems/longest-increasing-subsequence/\n[Bulls and Cows]: https://leetcode.com/problems/bulls-and-cows/\n[Binary Tree Longest Consecutive Sequence]: https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/\n[Serialize and Deserialize Binary Tree]: https://leetcode.com/problems/serialize-and-deserialize-binary-tree/\n[Best Meeting Point]: https://leetcode.com/problems/best-meeting-point/\n[Find Median from Data Stream]: https://leetcode.com/problems/find-median-from-data-stream/\n[Flip Game II]: https://leetcode.com/problems/flip-game-ii/\n[Flip Game]: https://leetcode.com/problems/flip-game/\n[Nim Game]: https://leetcode.com/problems/nim-game/\n[Word Pattern II]: https://leetcode.com/problems/word-pattern-ii/\n[Word Pattern]: https://leetcode.com/problems/word-pattern/\n[Game of Life]: https://leetcode.com/problems/game-of-life/\n[Unique Word Abbreviation]: https://leetcode.com/problems/unique-word-abbreviation/\n[Find the Duplicate Number]: https://leetcode.com/problems/find-the-duplicate-number/\n[Walls and Gates]: https://leetcode.com/problems/walls-and-gates/\n[Inorder Successor in BST]: https://leetcode.com/problems/inorder-successor-in-bst/\n[Peeking Iterator]: https://leetcode.com/problems/peeking-iterator/\n[Move Zeroes]: https://leetcode.com/problems/move-zeroes/\n[Expression Add Operators]: https://leetcode.com/problems/expression-add-operators/\n[Zigzag Iterator]: https://leetcode.com/problems/zigzag-iterator/\n[Wiggle Sort]: https://leetcode.com/problems/wiggle-sort/\n[Perfect Squares]: https://leetcode.com/problems/perfect-squares/\n[First Bad Version]: https://leetcode.com/problems/first-bad-version/\n[Find the Celebrity]: https://leetcode.com/problems/find-the-celebrity/\n[Paint Fence]: https://leetcode.com/problems/paint-fence/\n[H-Index II]: https://leetcode.com/problems/h-index-ii/\n[H-Index]: https://leetcode.com/problems/h-index/\n[Integer to English Words]: https://leetcode.com/problems/integer-to-english-words/\n[Closest Binary Search Tree Value II]: https://leetcode.com/problems/closest-binary-search-tree-value-ii/\n[Encode and Decode Strings]: https://leetcode.com/problems/encode-and-decode-strings/\n[Closest Binary Search Tree Value]: https://leetcode.com/problems/closest-binary-search-tree-value/\n[Alien Dictionary]: https://leetcode.com/problems/alien-dictionary/\n[Missing Number]: https://leetcode.com/problems/missing-number/\n[Palindrome Permutation II]:https://leetcode.com/problems/palindrome-permutation-ii/\n[Palindrome Permutation]: https://leetcode.com/problems/palindrome-permutation/\n[Paint House II]: https://leetcode.com/problems/paint-house-ii/\n[Ugly Number II]: https://leetcode.com/problems/ugly-number-ii/\n[Ugly Number]: https://leetcode.com/problems/ugly-number/\n[Graph Valid Tree]: https://leetcode.com/problems/graph-valid-tree/\n[Single Number III]: https://leetcode.com/problems/single-number-iii/\n[3Sum Smaller]: https://leetcode.com/problems/3sum-smaller/\n[Add Digits]: https://leetcode.com/problems/add-digits/\n[Binary Tree Paths]: https://leetcode.com/problems/binary-tree-paths/\n[Paint House]: https://leetcode.com/problems/paint-house/\n[Verify Preorder Sequence in Binary Search Tree]: https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/\n[Factor Combinations]: https://leetcode.com/problems/factor-combinations/\n[Meeting Rooms II]: https://leetcode.com/problems/meeting-rooms-ii/\n[Meeting Rooms]: https://leetcode.com/problems/meeting-rooms/\n[Flatten 2D Vector]: https://leetcode.com/problems/flatten-2d-vector/\n[Count Univalue Subtrees]: https://leetcode.com/problems/count-univalue-subtrees/\n[Group Shifted Strings]: https://leetcode.com/problems/group-shifted-strings/\n[Strobogrammatic Number III]: https://leetcode.com/problems/strobogrammatic-number-iii/\n[Strobogrammatic Number II]: https://leetcode.com/problems/strobogrammatic-number-ii/\n[Strobogrammatic Number]: https://leetcode.com/problems/strobogrammatic-number/\n[Shortest Word Distance III]: https://leetcode.com/problems/shortest-word-distance-iii/\n[Shortest Word Distance II]: https://leetcode.com/problems/shortest-word-distance-ii/\n[Shortest Word Distance]: https://leetcode.com/problems/shortest-word-distance/\n[Valid Anagram]: https://leetcode.com/problems/valid-anagram/\n[Different Ways to Add Parentheses]: https://leetcode.com/problems/different-ways-to-add-parentheses/\n[Search a 2D Matrix II]: https://leetcode.com/problems/search-a-2d-matrix-ii/\n[Sliding Window Maximum]: https://leetcode.com/problems/sliding-window-maximum/\n[Product of Array Except Self]: https://leetcode.com/problems/product-of-array-except-self/\n[Delete Node in a Linked List]: https://leetcode.com/problems/delete-node-in-a-linked-list/\n[Lowest Common Ancestor of a Binary Tree]: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/\n[Lowest Common Ancestor of a Binary Search Tree]: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/\n[Palindrome Linked List]: https://leetcode.com/problems/palindrome-linked-list/\n[Number of Digit One]: https://leetcode.com/problems/number-of-digit-one/\n[Implement Queue using Stacks]: https://leetcode.com/problems/implement-queue-using-stacks/\n[Power of Two]: https://leetcode.com/problems/power-of-two/\n[Kth Smallest Element in a BST]: https://leetcode.com/problems/kth-smallest-element-in-a-bst/\n[Majority Element II]: https://leetcode.com/problems/majority-element-ii/\n[Summary Ranges]: https://leetcode.com/problems/summary-ranges/\n[Basic Calculator II]: https://leetcode.com/problems/basic-calculator-ii/\n[Invert Binary Tree]: https://leetcode.com/problems/invert-binary-tree/\n[Implement Stack using Queues]: https://leetcode.com/problems/implement-stack-using-queues/\n[Basic Calculator]: https://leetcode.com/problems/basic-calculator/\n[Rectangle Area]: https://leetcode.com/problems/rectangle-area/\n[Count Complete Tree Nodes]: https://leetcode.com/problems/count-complete-tree-nodes/\n[Maximal Square]: https://leetcode.com/problems/maximal-square/\n[Contains Duplicate III]: https://leetcode.com/problems/contains-duplicate-iii/\n[Contains Duplicate II]: https://leetcode.com/problems/contains-duplicate-ii/\n[The Skyline Problem]: https://leetcode.com/problems/the-skyline-problem/\n[Contains Duplicate]: https://leetcode.com/problems/contains-duplicate/\n[Combination Sum III]: https://leetcode.com/problems/combination-sum-iii/\n[Kth Largest Element in an Array]: https://leetcode.com/problems/kth-largest-element-in-an-array/\n[Shortest Palindrome]: https://leetcode.com/problems/shortest-palindrome/\n[House Robber II]: https://leetcode.com/problems/house-robber-ii/\n[Word Search II]: https://leetcode.com/problems/word-search-ii/\n[Add and Search Word - Data structure design]: https://leetcode.com/problems/add-and-search-word-data-structure-design/\n[Course Schedule II]: https://leetcode.com/problems/course-schedule-ii/\n[Minimum Size Subarray Sum]: https://leetcode.com/problems/minimum-size-subarray-sum/\n[Implement Trie (Prefix Tree)]: https://leetcode.com/problems/implement-trie-prefix-tree/\n[Course Schedule]: https://leetcode.com/problems/course-schedule/\n[Reverse Linked List]: https://leetcode.com/problems/reverse-linked-list/\n[Isomorphic Strings]: https://leetcode.com/problems/isomorphic-strings/\n[Count Primes]: https://leetcode.com/problems/count-primes/\n[Remove Linked List Elements]: https://leetcode.com/problems/remove-linked-list-elements/\n[Happy Number]: https://leetcode.com/problems/happy-number/\n[Bitwise AND of Numbers Range]: https://leetcode.com/problems/bitwise-and-of-numbers-range/\n[Number of Islands]: https://leetcode.com/problems/number-of-islands/\n[Binary Tree Right Side View]: https://leetcode.com/problems/binary-tree-right-side-view/\n[House Robber]: https://leetcode.com/problems/house-robber/\n[Number of 1 Bits]: https://leetcode.com/problems/number-of-1-bits/\n[Reverse Bits]: https://leetcode.com/problems/reverse-bits/\n[Rotate Array]: https://leetcode.com/problems/rotate-array/\n[Best Time to Buy and Sell Stock IV]: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/\n[Repeated DNA Sequences]: https://leetcode.com/problems/repeated-dna-sequences/\n[Reverse Words in a String II]: https://leetcode.com/problems/reverse-words-in-a-string-ii/\n[Largest Number]: https://leetcode.com/problems/largest-number/\n[Dungeon Game]: https://leetcode.com/problems/dungeon-game/\n[Binary Search Tree Iterator]: https://leetcode.com/problems/binary-search-tree-iterator/\n[Factorial Trailing Zeroes]: https://leetcode.com/problems/factorial-trailing-zeroes/\n[Excel Sheet Column Number]: https://leetcode.com/problems/excel-sheet-column-number/\n[Two Sum III - Data structure design]: https://leetcode.com/problems/two-sum-iii-data-structure-design/\n[Majority Element]: https://leetcode.com/problems/majority-element/\n[Excel Sheet Column Title]: https://leetcode.com/problems/excel-sheet-column-title/\n[Two Sum II - Input array is sorted]: https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/\n[Fraction to Recurring Decimal]: https://leetcode.com/problems/fraction-to-recurring-decimal/\n[Compare Version Numbers]: https://leetcode.com/problems/compare-version-numbers/\n[Maximum Gap]: https://leetcode.com/problems/maximum-gap/\n[Missing Ranges]: https://leetcode.com/problems/missing-ranges/\n[Find Peak Element]: https://leetcode.com/problems/find-peak-element/\n[One Edit Distance]: https://leetcode.com/problems/one-edit-distance/\n[Intersection of Two Linked Lists]: https://leetcode.com/problems/intersection-of-two-linked-lists/\n[Longest Substring with At Most Two Distinct Characters]: https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/\n[Read N Characters Given Read4 II - Call multiple times]: https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/\n[Read N Characters Given Read4]: https://leetcode.com/problems/read-n-characters-given-read4/\n[Binary Tree Upside Down]: https://leetcode.com/problems/binary-tree-upside-down/\n[Min Stack]: https://leetcode.com/problems/min-stack/\n[Find Minimum in Rotated Sorted Array II]: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/\n[Find Minimum in Rotated Sorted Array]: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/\n[Maximum Product Subarray]: https://leetcode.com/problems/maximum-product-subarray/\n[Reverse Words in a String]: https://leetcode.com/problems/reverse-words-in-a-string/\n[Evaluate Reverse Polish Notation]: https://leetcode.com/problems/evaluate-reverse-polish-notation/\n[Max Points on a Line]: https://leetcode.com/problems/max-points-on-a-line/\n[Sort List]: https://leetcode.com/problems/sort-list/\n[Insertion Sort List]: https://leetcode.com/problems/insertion-sort-list/\n[LRU Cache]: https://leetcode.com/problems/lru-cache/\n[Binary Tree Postorder Traversal]: https://leetcode.com/problems/binary-tree-postorder-traversal/\n[Binary Tree Preorder Traversal]: https://leetcode.com/problems/binary-tree-preorder-traversal/\n[Reorder List]: https://leetcode.com/problems/reorder-list/\n[Linked List Cycle II]: https://leetcode.com/problems/linked-list-cycle-ii/\n[Linked List Cycle]: https://leetcode.com/problems/linked-list-cycle/\n[Word Break II]: https://leetcode.com/problems/word-break-ii/\n[Word Break]: https://leetcode.com/problems/word-break/\n[Copy List with Random Pointer]: https://leetcode.com/problems/copy-list-with-random-pointer/\n[Single Number II]: https://leetcode.com/problems/single-number-ii/\n[Single Number]: https://leetcode.com/problems/single-number/\n[Candy]: https://leetcode.com/problems/candy/\n[Gas Station]: https://leetcode.com/problems/gas-station/\n[Clone Graph]: https://leetcode.com/problems/clone-graph/\n[Palindrome Partitioning II]: https://leetcode.com/problems/palindrome-partitioning-ii/\n[Palindrome Partitioning]: https://leetcode.com/problems/palindrome-partitioning/\n[Surrounded Regions]: https://leetcode.com/problems/surrounded-regions/\n[Sum Root to Leaf Numbers]: https://leetcode.com/problems/sum-root-to-leaf-numbers/\n[Longest Consecutive Sequence]: https://leetcode.com/problems/longest-consecutive-sequence/\n[Word Ladder]: https://leetcode.com/problems/word-ladder/\n[Word Ladder II]: https://leetcode.com/problems/word-ladder-ii/\n[Valid Palindrome]: https://leetcode.com/problems/valid-palindrome/\n[Binary Tree Maximum Path Sum]: https://leetcode.com/problems/binary-tree-maximum-path-sum/\n[Best Time to Buy and Sell Stock III]: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/\n[Best Time to Buy and Sell Stock II]: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/\n[Best Time to Buy and Sell Stock]: https://leetcode.com/problems/best-time-to-buy-and-sell-stock/\n[Triangle]: https://leetcode.com/problems/triangle/\n[Pascal's Triangle II]: https://leetcode.com/problems/pascals-triangle-ii/\n[Pascal's Triangle]: https://leetcode.com/problems/pascals-triangle/\n[Populating Next Right Pointers in Each Node II]: https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/\n[Populating Next Right Pointers in Each Node]: https://leetcode.com/problems/populating-next-right-pointers-in-each-node/\n[Distinct Subsequences]: https://leetcode.com/problems/distinct-subsequences/\n[Flatten Binary Tree to Linked List]: https://leetcode.com/problems/flatten-binary-tree-to-linked-list/\n[Path Sum II]: https://leetcode.com/problems/path-sum-ii/\n[Path Sum]: https://leetcode.com/problems/path-sum/\n[Minimum Depth of Binary Tree]: https://leetcode.com/problems/minimum-depth-of-binary-tree/\n[Balanced Binary Tree]: https://leetcode.com/problems/balanced-binary-tree/\n[Convert Sorted List to Binary Search Tree]: https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/\n[Convert Sorted Array to Binary Search Tree]: https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/\n[Binary Tree Level Order Traversal II]: https://leetcode.com/problems/binary-tree-level-order-traversal-ii/\n[Construct Binary Tree from Inorder and Postorder Traversal]: https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/\n[Construct Binary Tree from Preorder and Inorder Traversal]: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/\n[Maximum Depth of Binary Tree]: https://leetcode.com/problems/maximum-depth-of-binary-tree/\n[Binary Tree Zigzag Level Order Traversal]: https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/\n[Binary Tree Level Order Traversal]: https://leetcode.com/problems/binary-tree-level-order-traversal/\n[Symmetric Tree]: https://leetcode.com/problems/symmetric-tree/\n[Same Tree]: https://leetcode.com/problems/same-tree/\n[Recover Binary Search Tree]: https://leetcode.com/problems/recover-binary-search-tree/\n[Validate Binary Search Tree]: https://leetcode.com/problems/validate-binary-search-tree/\n[Interleaving String]: https://leetcode.com/problems/interleaving-string/\n[Unique Binary Search Trees]: https://leetcode.com/problems/unique-binary-search-trees/\n[Unique Binary Search Trees II]: https://leetcode.com/problems/unique-binary-search-trees-ii/\n[Binary Tree Inorder Traversal]: https://leetcode.com/problems/binary-tree-inorder-traversal/\n[Restore IP Addresses]: https://leetcode.com/problems/restore-ip-addresses/\n[Reverse Linked List II]: https://leetcode.com/problems/restore-ip-addresses/\n[Decode Ways]: https://leetcode.com/problems/decode-ways/\n[Subsets II]: https://leetcode.com/problems/subsets-ii/\n[Gray Code]: https://leetcode.com/problems/gray-code/\n[Merge Sorted Array]: https://leetcode.com/problems/merge-sorted-array/\n[Scramble String]: https://leetcode.com/problems/scramble-string/\n[Partition List]: https://leetcode.com/problems/partition-list/\n[Maximal Rectangle]: https://leetcode.com/problems/maximal-rectangle/\n[Largest Rectangle in Histogram]: https://leetcode.com/problems/maximal-rectangle/\n[Remove Duplicates from Sorted List]: https://leetcode.com/problems/remove-duplicates-from-sorted-list/\n[Remove Duplicates from Sorted List II]: https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/\n[Search in Rotated Sorted Array II]: https://leetcode.com/problems/search-in-rotated-sorted-array-ii/\n[Remove Duplicates from Sorted Array II]: https://leetcode.com/problems/search-in-rotated-sorted-array-ii/\n[Word Search]: https://leetcode.com/problems/word-search/\n[Subsets]: https://leetcode.com/problems/subsets/\n[Combinations]: https://leetcode.com/problems/combinations/\n[Minimum Window Substring]: https://leetcode.com/problems/minimum-window-substring/\n[Sort Colors]: https://leetcode.com/problems/sort-colors/\n[Search a 2D Matrix]: https://leetcode.com/problems/search-a-2d-matrix/\n[Set Matrix Zeroes]: https://leetcode.com/problems/set-matrix-zeroes/\n[Edit Distance]: https://leetcode.com/problems/edit-distance/\n[Simplify Path]: https://leetcode.com/problems/simplify-path/\n[Climbing Stairs]: https://leetcode.com/problems/climbing-stairs/\n[Sqrt(x)]: https://leetcode.com/problems/sqrtx/\n[Text Justification]: https://leetcode.com/problems/text-justification/\n[Add Binary]: https://leetcode.com/problems/add-binary/\n[Plus One]: https://leetcode.com/problems/plus-one/\n[Valid Number]: https://leetcode.com/problems/valid-number/\n[Minimum Path Sum]: https://leetcode.com/problems/minimum-path-sum/\n[Unique Paths II]: https://leetcode.com/problems/unique-paths-ii/\n[Unique Paths]: https://leetcode.com/problems/unique-paths/\n[Rotate List]: https://leetcode.com/problems/rotate-list/\n[Permutation Sequence]: https://leetcode.com/problems/permutation-sequence/\n[Spiral Matrix II]: https://leetcode.com/problems/spiral-matrix-ii/\n[Length of Last Word]: https://leetcode.com/problems/length-of-last-word/\n[Insert Interval]: https://leetcode.com/problems/insert-interval/\n[Merge Intervals]: https://leetcode.com/problems/merge-intervals/\n[Jump Game]: https://leetcode.com/problems/jump-game/\n[Spiral Matrix]: https://leetcode.com/problems/spiral-matrix/\n[Maximum Subarray]: https://leetcode.com/problems/maximum-subarray/\n[N-Queens II]: https://leetcode.com/problems/n-queens-ii/\n[N-Queens]: https://leetcode.com/problems/n-queens/\n[Pow(x, n)]: https://leetcode.com/problems/powx-n/\n[Anagrams]: https://leetcode.com/problems/anagrams/\n[Rotate Image]: https://leetcode.com/problems/rotate-image/\n[Permutations II]: https://leetcode.com/problems/permutations-ii/\n[Permutations]: https://leetcode.com/problems/permutations/\n[Jump Game II]: https://leetcode.com/problems/jump-game-ii/\n[Wildcard Matching]: https://leetcode.com/problems/wildcard-matching/\n[Multiply Strings]: https://leetcode.com/problems/multiply-strings/\n[Trapping Rain Water]: https://leetcode.com/problems/trapping-rain-water/\n[First Missing Positive]: https://leetcode.com/problems/first-missing-positive/\n[Combination Sum II]: https://leetcode.com/problems/combination-sum-ii/\n[Combination Sum]: https://leetcode.com/problems/combination-sum/\n[Count and Say]: https://leetcode.com/problems/count-and-say/\n[Sudoku Solver]: https://leetcode.com/problems/sudoku-solver/\n[Valid Sudoku]: https://leetcode.com/problems/valid-sudoku/\n[Search Insert Position]: https://leetcode.com/problems/search-insert-position/\n[Search for a Range]: https://leetcode.com/problems/search-for-a-range/\n[Search in Rotated Sorted Array]: https://leetcode.com/problems/search-in-rotated-sorted-array/\n[Longest Valid Parentheses]: https://leetcode.com/problems/longest-valid-parentheses/\n[Next Permutation]: https://leetcode.com/problems/next-permutation/\n[Substring with Concatenation of All Words]: https://leetcode.com/problems/substring-with-concatenation-of-all-words/\n[Divide Two Integers]: https://leetcode.com/problems/divide-two-integers/\n[Implement strStr()]: https://leetcode.com/problems/implement-strstr/\n[Remove Element]: https://leetcode.com/problems/remove-element/\n[Remove Duplicates from Sorted Array]: https://leetcode.com/problems/remove-duplicates-from-sorted-array/\n[Reverse Nodes in k-Group]: https://leetcode.com/problems/reverse-nodes-in-k-group/\n[Swap Nodes in Pairs]: https://leetcode.com/problems/swap-nodes-in-pairs/\n[Merge k Sorted Lists]: https://leetcode.com/problems/merge-k-sorted-lists/\n[Generate Parentheses]: https://leetcode.com/problems/generate-parentheses/\n[Merge Two Sorted Lists]: https://leetcode.com/problems/merge-two-sorted-lists/\n[Valid Parentheses]: https://leetcode.com/problems/valid-parentheses/\n[Remove Nth Node From End of List]: https://leetcode.com/problems/remove-nth-node-from-end-of-list/\n[4Sum]: https://leetcode.com/problems/4sum/\n[Letter Combinations of a Phone Number]: https://leetcode.com/problems/letter-combinations-of-a-phone-number/\n[3Sum Closest]: https://leetcode.com/problems/3sum-closest/\n[3Sum]: https://leetcode.com/problems/3sum/\n[Longest Common Prefix]: https://leetcode.com/problems/longest-common-prefix/\n[Roman to Integer]: https://leetcode.com/problems/roman-to-integer/\n[Integer to Roman]: https://leetcode.com/problems/integer-to-roman/\n[Container With Most Water]: https://leetcode.com/problems/container-with-most-water/\n[Regular Expression Matching]: https://leetcode.com/problems/regular-expression-matching/\n[Palindrome Number]: https://leetcode.com/problems/palindrome-number/\n[String to Integer (atoi)]: https://leetcode.com/problems/string-to-integer-atoi/\n[Reverse Integer]: https://leetcode.com/problems/reverse-integer/\n[ZigZag Conversion]: https://leetcode.com/problems/zigzag-conversion/\n[Longest Palindromic Substring]: https://leetcode.com/problems/longest-palindromic-substring/\n[Median of Two Sorted Arrays]: https://leetcode.com/problems/median-of-two-sorted-arrays/\n[Longest Substring Without Repeating Characters]: https://leetcode.com/problems/longest-substring-without-repeating-characters/\n[Add Two Numbers]: https://leetcode.com/problems/add-two-numbers/\n[Two Sum]: https://leetcode.com/problems/two-sum/\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flennylxx%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flennylxx%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flennylxx%2Fleetcode/lists"}