https://github.com/xingdl2007/leetcode
:paw_prints: Leetcode solutions in c++/golang/java.
https://github.com/xingdl2007/leetcode
algorithms-and-data-structures exercises leetcode
Last synced: 1 day ago
JSON representation
:paw_prints: Leetcode solutions in c++/golang/java.
- Host: GitHub
- URL: https://github.com/xingdl2007/leetcode
- Owner: xingdl2007
- Created: 2015-06-02T14:20:59.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2020-07-28T01:49:24.000Z (over 5 years ago)
- Last Synced: 2023-03-02T05:32:46.640Z (almost 3 years ago)
- Topics: algorithms-and-data-structures, exercises, leetcode
- Language: Go
- Homepage: https://leetcode.com/
- Size: 1.1 MB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
### Complete List:
| # | Title | Difficulty |
| :---: | :--- | :--- |
| 1 | [Two Sum](algorithms/1) | Easy |
| 2 | [Add Two Numbers](algorithms/2) | Medium |
| 3 | [Longest Substring Without Repeating Characters](algorithms/3) | Medium |
| 4 | [Median of Two Sorted Arrays](algorithms/4) | Hard |
| 5 | [Longest Palindromic Substring](algorithms/5) | Medium |
| 6 | [ZigZag Conversion](algorithms/6) | Medium |
| 7 | [Reverse Integer](algorithms/7) | Easy |
| 8 | [String to Integer (atoi)](algorithms/8) | Medium |
| 10 | [Regular Expression Matching](algorithms/10) | Hard |
| 11 | [Container With Most Water](algorithms/11) | Medium |
| 13 | [Roman to Integer](algorithms/13) | Easy |
| 14 | [Longest Common Prefix](algorithms/14) | Easy |
| 15 | [3Sum](algorithms/15) | Medium |
| 16 | [3Sum Closest](algorithms/16) | Medium |
| 17 | [Letter Combinations of a Phone Number](algorithms/17) | Medium |
| 18 | [4Sum](algorithms/18) | Medium |
| 19 | [Remove Nth Node From End of List](algorithms/19) | Medium |
| 20 | [Valid Parentheses](algorithms/20) | Easy |
| 21 | [Merge Two Sorted Lists](algorithms/21) | Easy |
| 22 | [Generate Parentheses](algorithms/22) | Medium |
| 23 | [Merge k Sorted Lists](algorithms/23) | Hard |
| 26 | [Remove Duplicates from Sorted Array](algorithms/26) | Easy |
| 27 | [Remove Element](algorithms/27) | Easy |
| 28 | [Implement strStr()](algorithms/28) | Easy |
| 31 | [Next Permutation](algorithms/31) | Medium |
| 32 | [Longest Valid Parentheses](algorithms/32) | Hard |
| 33 | [Search in Rotated Sorted Array](algorithms/33) | Medium |
| 34 | [Search for a Range](algorithms/34) | Medium |
| 36 | [Valid Sudoku](algorithms/36) | Medium |
| 39 | [Combination Sum](algorithms/39) | Medium |
| 41 | [First Missing Positive](algorithms/41) | Hard |
| 42 | [Trapping Rain Water](algorithms/42) | Hard |
| 46 | [Permutations](algorithms/46) | Medium |
| 47 | [Permutations II](algorithms/47) | Medium |
| 48 | [Rotate Image](algorithms/48) | Medium |
| 49 | [Group Anagrams](algorithms/49) | Medium |
| 50 | [Pow(x, n)](algorithms/50) | Medium |
| 51 | [N-Queens](algorithms/51) | Hard |
| 52 | [N-Queens II](algorithms/52) | Hard |
| 53 | [Maximum Subarray](algorithms/53) | Easy |
| 54 | [Spiral Matrix](algorithms/54) | Medium |
| 55 | [Jump Game](algorithms/55) | Medium |
| 56 | [Merge Intervals](algorithms/56) | Medium |
| 59 | [Spiral Matrix II](algorithms/59) | Medium |
| 60 | [Permutation Sequence](algorithms/60) | Medium |
| 62 | [Unique Paths](algorithms/62) | Medium |
| 63 | [Unique Paths II](algorithms/63) | Medium |
| 64 | [Minimum Path Sum](algorithms/64) | Medium |
| 66 | [Plus One](algorithms/66) | Easy |
| 69 | [Sqrt(x)](algorithms/69) | Easy |
| 70 | [Climbing Stairs](algorithms/70) | Easy |
| 72 | [Edit Distance](algorithms/72) | Hard |
| 73 | [Set Matrix Zeroes](algorithms/73) | Medium |
| 75 | [Sort Colors](algorithms/75) | Medium |
| 78 | [Subsets](algorithms/78) | Medium |
| 79 | [Word Search](algorithms/79) | Medium |
| 89 | [Gray Code](algorithms/89) | Medium |
| 90 | [Subsets II](algorithms/90) | Medium |
| 94 | [Binary Tree Inorder Traversal](algorithms/94) | Medium |
| 96 | [Unique Binary Search Trees](algorithms/96) | Medium |
| 98 | [Validate Binary Search Tree](algorithms/98) | Medium |
| 99 | [Recover Binary Search Tree](algorithms/99) | Hard |
| 100 | [Same Tree](algorithms/100) | Easy |
| 101 | [Symmetric Tree](algorithms/101) | Easy |
| 102 | [Binary Tree Level Order Traversal](algorithms/102) | Medium |
| 104 | [Maximum Depth of Binary Tree](algorithms/104) | Easy |
| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](algorithms/105) | Medium |
| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](algorithms/106) | Medium |
| 107 | [Binary Tree Level Order Traversal II](algorithms/107) | Easy |
| 108 | [Convert Sorted Array to Binary Search Tree](algorithms/108) | Easy |
| 109 | [Convert Sorted List to Binary Search Tree](algorithms/109) | Medium |
| 110 | [Balanced Binary Tree](algorithms/110) | Easy |
| 111 | [Minimum Depth of Binary Tree](algorithms/111) | Easy |
| 112 | [Path Sum](algorithms/112) | Easy |
| 114 | [Flatten Binary Tree to Linked List](algorithms/114) | Medium |
| 120 | [Triangle](algorithms/120) | Medium |
| 121 | [Best Time to Buy and Sell Stock](algorithms/121) | Easy |
| 128 | [Longest Consecutive Sequence](algorithms/128) | Hard |
| 130 | [Surrounded Regions](algorithms/130) | Medium |
| 136 | [Single Number](algorithms/136) | Easy |
| 137 | [Single Number II](algorithms/137) | Medium |
| 139 | [Word Break](algorithms/139) | Medium |
| 141 | [Linked List Cycle](algorithms/141) | Easy |
| 142 | [Linked List Cycle II](algorithms/142) | Medium |
| 146 | [LRU Cache](algorithms/146)| Hard |
| 148 | [Sort List](algorithms/148) | Medium |
| 153 | [Find Minimum in Rotated Sorted Array](algorithms/153) | Medium |
| 154 | [Find Minimum in Rotated Sorted Array II](algorithms/154) | Medium |
| 155 | [Min Stack](algorithms/155) | Easy |
| 152 | [Maximum Product Subarray](algorithms/152) | Medium |
| 160 | [Intersection of Two Linked Lists](algorithms/160) | Easy |
| 168 | [Excel Sheet Column Title](algorithms/168) | Easy |
| 169 | [Majority Element](algorithms/169) | Easy |
| 171 | [Excel Sheet Column Number](algorithms/171) | Easy |
| 191 | [Number of 1 Bits](algorithms/191) | Easy |
| 198 | [House Robber](algorithms/198) | Easy |
| 200 | [Number of Islands](algorithms/200) | Medium |
| 202 | [Happy Number](algorithms/202) | Easy |
| 203 | [Remove Linked List Elements](algorithms/203) | Easy |
| 206 | [Reverse Linked List](algorithms/206) | Easy |
| 207 | [Course Schedule](algorithms/207) | Medium |
| 208 | [Implement Trie (Prefix Tree)](algorithms/208) | Medium |
| 210 | [Course Schedule II](algorithms/210) | Medium |
| 212 | [Word Search II](algorithms/212) | Hard |
| 215 | [Kth Largest Element in an Array](algorithms/215) | Medium |
| 217 | [Contains Duplicate](algorithms/217) | Easy |
| 221 | [Maximal Square](algorithms/221) | Medium |
| 226 | [Invert Binary Tree](algorithms/226) | Easy |
| 234 | [Palindrome Linked List](algorithms/234) | Easy |
| 236 | [Lowest Common Ancestor of a Binary Tree](algorithms/236) | Medium |
| 238 | [Product of Array Except Self](algorithms/238) | Medium |
| 240 | [Search a 2D Matrix II](algorithms/240) | Medium |
| 260 | [Single Number III](algorithms/260) | Medium |
| 268 | [Missing Number](algorithms/268) | Easy |
| 279 | [Perfect Squares](algorithms/279) | Medium |
| 283 | [Move Zeroes](algorithms/283) | Easy |
| 287 | [Find the Duplicate Number](algorithms/287) | Medium |
| 292 | [Nim Game](algorithms/292) | Easy |
| 300 | [Longest Increasing Subsequence](algorithms/300) | Medium |
| 303 | [Range Sum Query - Immutable](algorithms/303) | Easy |
| 309 | [Best Time to Buy and Sell Stock with Cooldown](algorithms/309) | Medium |
| 310 | [Minimum Height Trees](algorithms/310) | Medium |
| 312 | [Burst Balloons](algorithms/312) | Hard |
| 315 | [Count of Smaller Numbers After Self](algorithms/315) | Hard |
| 322 | [Coin Change](algorithms/322) | Medium |
| 329 | [Longest Increasing Path in a Matrix](algorithms/329) | Medium |
| 337 | [House Robber III](algorithms/337) | Medium |
| 338 | [Counting Bits](algorithms/338) | Medium |
| 344 | [Reverse String](algorithms/344) | Easy |
| 347 | [Top K Frequent Elements](algorithms/347) | Medium |
| 371 | [Sum of Two Integers](algorithms/371) | Easy |
| 384 | [Shuffle an Array](algorithms/384) | Medium |
| 389 | [Find the Difference](algorithms/389) | Easy |
| 394 | [Decode String](algorithms/394) | Medium |
| 406 | [Queue Reconstruction by Height](algorithms/406) | Medium |
| 412 | [Fizz Buzz](algorithms/412) | Easy |
| 414 | [Third Maximum Number](algorithms/414) | Easy |
| 416 | [Partition Equal Subset Sum](algorithms/416) | Medium |
| 437 | [Path Sum III](algorithms/437) | Easy |
| 438 | [Find All Anagrams in a String](algorithms/438) | Easy |
| 448 | [Find All Numbers Disappeared in an Array](algorithms/448) | Easy |
| 450 | [Delete Node in a BST](algorithms/450) | Medium |
| 461 | [Hamming Distance](algorithms/461) | Easy |
| 494 | [Target Sum](algorithms/494) | Medium |
| 523 | [Continuous Subarray Sum](algorithms/523) | Medium |
| 538 | [Convert BST to Greater Tree](algorithms/538) | Easy |
| 543 | [Diameter of Binary Tree](algorithms/543) | Easy |
| 547 | [Friend Circles](algorithms/547) | Medium |
| 560 | [Subarray Sum Equals K](algorithms/560) | Medium |
| 561 | [Array Partition I](algorithms/561) | Easy |
| 567 | [Permutation in String](algorithms/567) | Medium |
| 572 | [Subtree of Another Tree](algorithms/572) | Easy |
| 581 | [Shortest Unsorted Continuous Subarray](algorithms/581) | Easy |
| 599 | [Minimum Index Sum of Two Lists](algorithms/599) | Easy |
| 617 | [Merge Two Binary Trees](algorithms/617) | Easy |
| 621 | [Task Scheduler](algorithms/621) | Medium |
| 633 | [Sum of Square Numbers](algorithms/633) | Easy |
| 637 | [Average of Levels in Binary Tree](algorithms/637) | Easy |
| 645 | [Set Mismatch](algorithms/645) | Easy |
| 647 | [Palindromic Substrings](algorithms/647) | Medium |
| 684 | [Redundant Connection](algorithms/684) | Medium |
| 685 | [Redundant Connection II](algorithms/685) | Hard |
| 690 | [Employee Importance](algorithms/690) | Easy |
| 695 | [Max Area of Island](algorithms/695) | Easy |
| 713 | [Subarray Product Less Than K](algorithms/713) | Medium |
| 721 | [Accounts Merge](algorithms/721) | Medium |
| 724 | [Find Pivot Index](algorithms/724) | Easy |