{"id":34191415,"url":"https://github.com/xingdl2007/leetcode","last_synced_at":"2025-12-15T16:03:16.880Z","repository":{"id":33100726,"uuid":"36738377","full_name":"xingdl2007/leetcode","owner":"xingdl2007","description":":paw_prints: Leetcode solutions in c++/golang/java.","archived":false,"fork":false,"pushed_at":"2020-07-28T01:49:24.000Z","size":1154,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2023-03-02T05:32:46.640Z","etag":null,"topics":["algorithms-and-data-structures","exercises","leetcode"],"latest_commit_sha":null,"homepage":"https://leetcode.com/","language":"Go","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/xingdl2007.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-06-02T14:20:59.000Z","updated_at":"2022-01-08T20:25:10.000Z","dependencies_parsed_at":"2022-09-12T03:21:47.588Z","dependency_job_id":null,"html_url":"https://github.com/xingdl2007/leetcode","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"purl":"pkg:github/xingdl2007/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xingdl2007%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xingdl2007%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xingdl2007%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xingdl2007%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/xingdl2007","download_url":"https://codeload.github.com/xingdl2007/leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xingdl2007%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":27753696,"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","status":"online","status_checked_at":"2025-12-15T02:00:09.782Z","response_time":96,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algorithms-and-data-structures","exercises","leetcode"],"created_at":"2025-12-15T16:02:24.947Z","updated_at":"2025-12-15T16:03:16.867Z","avatar_url":"https://github.com/xingdl2007.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"### Complete List:\n\n| # | Title | Difficulty |\n| :---: | :--- | :--- |\n| 1   | [Two Sum](algorithms/1) | Easy |\n| 2   | [Add Two Numbers](algorithms/2) | Medium |\n| 3   | [Longest Substring Without Repeating Characters](algorithms/3) | Medium |\n| 4   | [Median of Two Sorted Arrays](algorithms/4) | Hard |\n| 5   | [Longest Palindromic Substring](algorithms/5) | Medium |\n| 6   | [ZigZag Conversion](algorithms/6) | Medium |\n| 7   | [Reverse Integer](algorithms/7) | Easy |\n| 8   | [String to Integer (atoi)](algorithms/8) | Medium |\n| 10  | [Regular Expression Matching](algorithms/10) | Hard |\n| 11  | [Container With Most Water](algorithms/11) | Medium |\n| 13  | [Roman to Integer](algorithms/13) | Easy |\n| 14  | [Longest Common Prefix](algorithms/14) | Easy |\n| 15  | [3Sum](algorithms/15) | Medium |\n| 16  | [3Sum Closest](algorithms/16) | Medium |\n| 17  | [Letter Combinations of a Phone Number](algorithms/17) | Medium |\n| 18  | [4Sum](algorithms/18) | Medium |\n| 19  | [Remove Nth Node From End of List](algorithms/19) | Medium |\n| 20  | [Valid Parentheses](algorithms/20) | Easy |\n| 21  | [Merge Two Sorted Lists](algorithms/21) | Easy |\n| 22  | [Generate Parentheses](algorithms/22) | Medium |\n| 23  | [Merge k Sorted Lists](algorithms/23) | Hard |\n| 26  | [Remove Duplicates from Sorted Array](algorithms/26) | Easy |\n| 27  | [Remove Element](algorithms/27) | Easy |\n| 28  | [Implement strStr()](algorithms/28) | Easy |\n| 31  | [Next Permutation](algorithms/31) | Medium |\n| 32  | [Longest Valid Parentheses](algorithms/32) | Hard |\n| 33  | [Search in Rotated Sorted Array](algorithms/33) | Medium |\n| 34  | [Search for a Range](algorithms/34) | Medium |\n| 36  | [Valid Sudoku](algorithms/36) | Medium |\n| 39  | [Combination Sum](algorithms/39) | Medium |\n| 41  | [First Missing Positive](algorithms/41) | Hard |\n| 42  | [Trapping Rain Water](algorithms/42) | Hard |\n| 46  | [Permutations](algorithms/46) | Medium |\n| 47  | [Permutations II](algorithms/47) | Medium |\n| 48  | [Rotate Image](algorithms/48) | Medium |\n| 49  | [Group Anagrams](algorithms/49) | Medium |\n| 50  | [Pow(x, n)](algorithms/50) | Medium |\n| 51  | [N-Queens](algorithms/51) | Hard |\n| 52  | [N-Queens II](algorithms/52) | Hard |\n| 53  | [Maximum Subarray](algorithms/53) | Easy |\n| 54  | [Spiral Matrix](algorithms/54) | Medium |\n| 55  | [Jump Game](algorithms/55) | Medium |\n| 56  | [Merge Intervals](algorithms/56) | Medium |\n| 59  | [Spiral Matrix II](algorithms/59) | Medium |\n| 60  | [Permutation Sequence](algorithms/60) | Medium |\n| 62  | [Unique Paths](algorithms/62) | Medium |\n| 63  | [Unique Paths II](algorithms/63) | Medium |\n| 64  | [Minimum Path Sum](algorithms/64) | Medium |\n| 66  | [Plus One](algorithms/66) | Easy |\n| 69  | [Sqrt(x)](algorithms/69) | Easy |\n| 70  | [Climbing Stairs](algorithms/70) | Easy |\n| 72  | [Edit Distance](algorithms/72) | Hard |\n| 73  | [Set Matrix Zeroes](algorithms/73) | Medium |\n| 75  | [Sort Colors](algorithms/75) | Medium |\n| 78  | [Subsets](algorithms/78) | Medium |\n| 79  | [Word Search](algorithms/79) | Medium |\n| 89  | [Gray Code](algorithms/89) | Medium |\n| 90  | [Subsets II](algorithms/90) | Medium |\n| 94  | [Binary Tree Inorder Traversal](algorithms/94) | Medium |\n| 96  | [Unique Binary Search Trees](algorithms/96) | Medium |\n| 98  | [Validate Binary Search Tree](algorithms/98) | Medium |\n| 99  | [Recover Binary Search Tree](algorithms/99) | Hard |\n| 100 | [Same Tree](algorithms/100) | Easy |\n| 101 | [Symmetric Tree](algorithms/101) | Easy |\n| 102 | [Binary Tree Level Order Traversal](algorithms/102) | Medium |\n| 104 | [Maximum Depth of Binary Tree](algorithms/104) | Easy |\n| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](algorithms/105) | Medium |\n| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](algorithms/106) | Medium |\n| 107 | [Binary Tree Level Order Traversal II](algorithms/107) | Easy |\n| 108 | [Convert Sorted Array to Binary Search Tree](algorithms/108) | Easy |\n| 109 | [Convert Sorted List to Binary Search Tree](algorithms/109) | Medium |\n| 110 | [Balanced Binary Tree](algorithms/110) | Easy |\n| 111 | [Minimum Depth of Binary Tree](algorithms/111) | Easy |\n| 112 | [Path Sum](algorithms/112) | Easy |\n| 114 | [Flatten Binary Tree to Linked List](algorithms/114) | Medium |\n| 120 | [Triangle](algorithms/120) | Medium |\n| 121 | [Best Time to Buy and Sell Stock](algorithms/121) | Easy |\n| 128 | [Longest Consecutive Sequence](algorithms/128) | Hard |\n| 130 | [Surrounded Regions](algorithms/130) | Medium |\n| 136 | [Single Number](algorithms/136) | Easy |\n| 137 | [Single Number II](algorithms/137) | Medium |\n| 139 | [Word Break](algorithms/139) | Medium |\n| 141 | [Linked List Cycle](algorithms/141) | Easy |\n| 142 | [Linked List Cycle II](algorithms/142) | Medium |\n| 146 | [LRU Cache](algorithms/146)| Hard |\n| 148 | [Sort List](algorithms/148) | Medium |\n| 153 | [Find Minimum in Rotated Sorted Array](algorithms/153) | Medium |\n| 154 | [Find Minimum in Rotated Sorted Array II](algorithms/154) | Medium |\n| 155 | [Min Stack](algorithms/155) | Easy |\n| 152 | [Maximum Product Subarray](algorithms/152) | Medium |\n| 160 | [Intersection of Two Linked Lists](algorithms/160) | Easy |\n| 168 | [Excel Sheet Column Title](algorithms/168) | Easy |\n| 169 | [Majority Element](algorithms/169) | Easy |\n| 171 | [Excel Sheet Column Number](algorithms/171) | Easy |\n| 191 | [Number of 1 Bits](algorithms/191) | Easy |\n| 198 | [House Robber](algorithms/198) | Easy |\n| 200 | [Number of Islands](algorithms/200) | Medium |\n| 202 | [Happy Number](algorithms/202) | Easy |\n| 203 | [Remove Linked List Elements](algorithms/203) | Easy |\n| 206 | [Reverse Linked List](algorithms/206) | Easy |\n| 207 | [Course Schedule](algorithms/207) | Medium |\n| 208 | [Implement Trie (Prefix Tree)](algorithms/208) | Medium |\n| 210 | [Course Schedule II](algorithms/210) | Medium |\n| 212 | [Word Search II](algorithms/212) | Hard |\n| 215 | [Kth Largest Element in an Array](algorithms/215) | Medium |\n| 217 | [Contains Duplicate](algorithms/217) | Easy |\n| 221 | [Maximal Square](algorithms/221) | Medium |\n| 226 | [Invert Binary Tree](algorithms/226) | Easy |\n| 234 | [Palindrome Linked List](algorithms/234) | Easy |\n| 236 | [Lowest Common Ancestor of a Binary Tree](algorithms/236) | Medium |\n| 238 | [Product of Array Except Self](algorithms/238) | Medium |\n| 240 | [Search a 2D Matrix II](algorithms/240) | Medium |\n| 260 | [Single Number III](algorithms/260) | Medium |\n| 268 | [Missing Number](algorithms/268) | Easy |\n| 279 | [Perfect Squares](algorithms/279) | Medium |\n| 283 | [Move Zeroes](algorithms/283) | Easy |\n| 287 | [Find the Duplicate Number](algorithms/287) | Medium |\n| 292 | [Nim Game](algorithms/292) | Easy |\n| 300 | [Longest Increasing Subsequence](algorithms/300) | Medium |\n| 303 | [Range Sum Query - Immutable](algorithms/303) | Easy |\n| 309 | [Best Time to Buy and Sell Stock with Cooldown](algorithms/309) | Medium |\n| 310 | [Minimum Height Trees](algorithms/310) | Medium |\n| 312 | [Burst Balloons](algorithms/312) | Hard |\n| 315 | [Count of Smaller Numbers After Self](algorithms/315) | Hard |\n| 322 | [Coin Change](algorithms/322) | Medium |\n| 329 | [Longest Increasing Path in a Matrix](algorithms/329) | Medium |\n| 337 | [House Robber III](algorithms/337) | Medium |\n| 338 | [Counting Bits](algorithms/338) | Medium |\n| 344 | [Reverse String](algorithms/344) | Easy |\n| 347 | [Top K Frequent Elements](algorithms/347) | Medium |\n| 371 | [Sum of Two Integers](algorithms/371) | Easy |\n| 384 | [Shuffle an Array](algorithms/384) | Medium |\n| 389 | [Find the Difference](algorithms/389) | Easy |\n| 394 | [Decode String](algorithms/394) | Medium |\n| 406 | [Queue Reconstruction by Height](algorithms/406) | Medium |\n| 412 | [Fizz Buzz](algorithms/412) | Easy |\n| 414 | [Third Maximum Number](algorithms/414) | Easy |\n| 416 | [Partition Equal Subset Sum](algorithms/416) | Medium |\n| 437 | [Path Sum III](algorithms/437) | Easy |\n| 438 | [Find All Anagrams in a String](algorithms/438) | Easy |\n| 448 | [Find All Numbers Disappeared in an Array](algorithms/448) | Easy |\n| 450 | [Delete Node in a BST](algorithms/450) | Medium |\n| 461 | [Hamming Distance](algorithms/461) | Easy |\n| 494 | [Target Sum](algorithms/494) | Medium |\n| 523 | [Continuous Subarray Sum](algorithms/523) | Medium |\n| 538 | [Convert BST to Greater Tree](algorithms/538) | Easy |\n| 543 | [Diameter of Binary Tree](algorithms/543) | Easy |\n| 547 | [Friend Circles](algorithms/547) | Medium |\n| 560 | [Subarray Sum Equals K](algorithms/560) | Medium |\n| 561 | [Array Partition I](algorithms/561) | Easy |\n| 567 | [Permutation in String](algorithms/567) | Medium |\n| 572 | [Subtree of Another Tree](algorithms/572) | Easy |\n| 581 | [Shortest Unsorted Continuous Subarray](algorithms/581) | Easy |\n| 599 | [Minimum Index Sum of Two Lists](algorithms/599) | Easy |\n| 617 | [Merge Two Binary Trees](algorithms/617) | Easy |\n| 621 | [Task Scheduler](algorithms/621) | Medium |\n| 633 | [Sum of Square Numbers](algorithms/633) | Easy |\n| 637 | [Average of Levels in Binary Tree](algorithms/637) | Easy |\n| 645 | [Set Mismatch](algorithms/645) | Easy |\n| 647 | [Palindromic Substrings](algorithms/647) | Medium |\n| 684 | [Redundant Connection](algorithms/684) | Medium |\n| 685 | [Redundant Connection II](algorithms/685) | Hard |\n| 690 | [Employee Importance](algorithms/690) | Easy |\n| 695 | [Max Area of Island](algorithms/695) | Easy |\n| 713 | [Subarray Product Less Than K](algorithms/713) | Medium |\n| 721 | [Accounts Merge](algorithms/721) | Medium |\n| 724 | [Find Pivot Index](algorithms/724) | Easy |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fxingdl2007%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fxingdl2007%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fxingdl2007%2Fleetcode/lists"}