{"id":20672702,"url":"https://github.com/shuoros/leetcodehub","last_synced_at":"2025-09-21T06:41:34.423Z","repository":{"id":37705307,"uuid":"505316326","full_name":"shuoros/leetcodehub","owner":"shuoros","description":"LeetCode problems' solutions with explanation","archived":false,"fork":false,"pushed_at":"2022-07-16T15:41:44.000Z","size":47,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-19T20:44:58.614Z","etag":null,"topics":["leetcode","leetcode-java","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"Java","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/shuoros.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":"2022-06-20T06:13:08.000Z","updated_at":"2024-03-12T08:36:40.000Z","dependencies_parsed_at":"2022-07-12T16:43:40.619Z","dependency_job_id":null,"html_url":"https://github.com/shuoros/leetcodehub","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/shuoros/leetcodehub","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shuoros%2Fleetcodehub","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shuoros%2Fleetcodehub/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shuoros%2Fleetcodehub/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shuoros%2Fleetcodehub/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/shuoros","download_url":"https://codeload.github.com/shuoros/leetcodehub/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shuoros%2Fleetcodehub/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":276204825,"owners_count":25602738,"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-09-21T02:00:07.055Z","response_time":72,"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":["leetcode","leetcode-java","leetcode-solutions"],"created_at":"2024-11-16T20:38:32.793Z","updated_at":"2025-09-21T06:41:34.408Z","avatar_url":"https://github.com/shuoros.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cp align=\"center\"\u003e\n \u003cimg width=\"250\" src=\"https://user-images.githubusercontent.com/45015114/179355468-3b5d31b6-921f-4199-924e-aab36bf6ca25.png\" align=\"center\" alt=\"LeetCode Hub\" /\u003e\n \u003ch1 align=\"center\"\u003eLeetCode Hub\u003c/h1\u003e\n \u003cp align=\"center\"\u003eLeetCode problems' solutions with explanation\u003c/p\u003e\n\u003c/p\u003e\n\u003cp align=\"center\"\u003e\n    \u003ca href=\"#solutions\"\u003e\n      \t\t\u003cimg src=\"https://badgify.thex.solutions/api/badge/link?title=26%20Solved%20Solutions\u0026icon=code\u0026size=m\u0026bg=orange\" /\u003e\n    \u003c/a\u003e\n\t  \u003ca href=\"https://github.com/shuoros/leetcodehub/blob/main/LICENSE\"\u003e\n      \t\t\u003cimg src=\"https://badgify.thex.solutions/api/badge/link?title=MIT\u0026icon=scale-balanced\u0026size=m\u0026bg=black\" /\u003e\n    \u003c/a\u003e\n\u003c/p\u003e\n\u003cp align=\"center\"\u003e\n     \u003cimg src=\"https://badgify.thex.solutions/api/badge/title?title=1%20Hard\u0026size=m\u0026bg=ff375f\" /\u003e\n     \u003cimg src=\"https://badgify.thex.solutions/api/badge/title?title=2%20Medium\u0026size=m\u0026bg=ffc01e\" /\u003e\n     \u003cimg src=\"https://badgify.thex.solutions/api/badge/title?title=23%20Easy\u0026size=m\u0026bg=00b8a3\" /\u003e\n\u003c/p\u003e\n\u003cp align=\"center\"\u003e\n    \u003ca href=\"https://github.com/shuoros/leetcodehub/issues/new/choose\"\u003e\n      \t\t\u003cimg src=\"https://badgify.thex.solutions/api/badge/title?title=Reoprt%20Issue\u0026bg=gray\u0026size=m\u0026theme=edge\" /\u003e\n    \u003c/a\u003e\n    \u003ca href=\"https://github.com/shuoros/leetcodehub/issues/new/choose\"\u003e\n      \t\t\u003cimg src=\"https://badgify.thex.solutions/api/badge/title?title=Request%20Solution\u0026bg=gray\u0026size=m\u0026theme=edge\" /\u003e\n    \u003c/a\u003e\n    \u003ca href=\"#contribution\"\u003e\n      \t\t\u003cimg src=\"https://badgify.thex.solutions/api/badge/title?title=Contribute\u0026bg=gray\u0026size=m\u0026theme=edge\" /\u003e\n    \u003c/a\u003e\n\u003c/p\u003e\n\n\u003ch1 align=\"center\"\u003eSolutions\u003c/h1\u003e\n\n\u003ctable align=\"center\"\u003e\n\u003cthead\u003e\u003cth\u003e#\u003c/th\u003e\u003cth\u003eTitle\u003c/th\u003e\u003cth\u003eDifficulty\u003c/th\u003e\u003cth\u003eRelated Topics\u003c/th\u003e\u003cth\u003eSolution\u003c/th\u003e\u003c/thead\u003e\n\u003ctbody\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e1\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/two-sum/\"\u003eTwo Sum\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eArray, Hash Table\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/1.%20Two%20Sum/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e2\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/add-two-numbers/\"\u003eAdd Two Numbers\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟡\u003c/td\u003e\n        \u003ctd\u003eLinked List, Math, Recursion\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/2.%20Add%20Two%20Numbers/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e4\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/median-of-two-sorted-arrays/\"\u003eMedian of Two Sorted Arrays\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🔴\u003c/td\u003e\n        \u003ctd\u003eArray, Binary Search, Devide and Conquer\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/4.%20Median%20of%20Two%20Sorted%20Arrays/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e7\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/reverse-integer/\"\u003eReverse Integer\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟡\u003c/td\u003e\n        \u003ctd\u003eMath\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/7.%20Reverse%20Integer/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e9\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/palindrome-number/\"\u003ePalindrome Number\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eMath\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/9.%20Palindrome%20Number/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e13\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/roman-to-integer/\"\u003eRoman to Integer\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eHash Table, Math, String\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/13.%20Roman%20to%20Integer/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e20\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/valid-parentheses/\"\u003eValid Parentheses\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eString, Stack\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/20.%20Valid%20Parentheses/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e21\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/merge-two-sorted-lists/\"\u003eMerge Two Sorted Lists\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eLinked List, Recursion\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/21.%20Merge%20Two%20Sorted%20Lists/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e26\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/remove-duplicates-from-sorted-array/\"\u003eRemove Duplicates from Sorted Array\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eArray, Two Pointers\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/26.%20Remove%20Duplicates%20from%20Sorted%20Array/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e70\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/climbing-stairs/\"\u003eClimbing Stairs\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eMath, Dynamic Programming, Memoization\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/70.%20Climbing%20Stairs/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e121\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/best-time-to-buy-and-sell-stock/\"\u003eBest Time to Buy and Sell Stock\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eArray, Dynamic Programming\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e206\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/reverse-linked-list/\"\u003eReverse Linked List\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eLinked List, Recursion\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/206.%20Reverse%20Linked%20List/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e278\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/first-bad-version/\"\u003eFirst Bad Version\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eBinary Search, Interactive\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/278.%20First%20Bad%20Version/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e383\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/ransom-note/\"\u003eRansom Note\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eHash Table, String, Counting\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/383.%20Ransom%20Note/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e392\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/is-subsequence/\"\u003eIs Subsequence\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eTwo Pointers, String, Dynamic Programming\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/392.%20Is%20Subsequence/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e409\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/longest-palindrome/\"\u003eLongest Palindrome\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eHash Table, String, Greedy\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/409.%20Longest%20Palindrome/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e412\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/fizz-buzz/\"\u003eFizz Buzz\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eMath, String, Simulation\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/412.%20Fizz%20Buzz/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e509\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/fibonacci-number/\"\u003eFibonacci Number\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eMath, Dynamic Programming, Recursion, Memoization\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/509.%20Fibonacci%20Number\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e589\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/n-ary-tree-preorder-traversal/\"\u003eN-ary Tree Preorder Traversal\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eStack, Tree, Depth-First-Search\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/589.%20N-ary%20Tree%20Preorder%20Traversal/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e704\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/binary-search/\"\u003eBinary Search\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eArray, Binary Search\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/704.%20Binary%20Search/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e724\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/find-pivot-index/\"\u003eFind Pivot Index\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eArray, Prefix Sum\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/724.%20Find%20Pivot%20Index/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e733\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/flood-fill/\"\u003eFlood Fill\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eArray, Depth-First-Search, Breadth-First-Search, Matrix\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/733.%20Flood%20Fill/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e876\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/middle-of-the-linked-list/\"\u003eMiddle of the Linked List\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eLinked List, Two Pointers\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/876.%20Middle%20of%20the%20Linked%20List/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e1342\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/\"\u003eNumber of Steps to Reduce a Number to Zero\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eMath, Bit Manipulation\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/1342.%20Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e1480\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/running-sum-of-1d-array/\"\u003eRunning Sum of 1d Array\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eArray, Prefix Sum\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/1480.%20Running%20Sum%20of%201d%20Array/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e1672\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode.com/problems/richest-customer-wealth/\"\u003eRichest Customer Wealth\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e🟢\u003c/td\u003e\n        \u003ctd\u003eArray, Matrix\u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/shuoros/leetcodehub/tree/main/solutions/1672.%20Richest%20Customer%20Wealth/java\"\u003eJava\u003c/a\u003e\u003c/td\u003e\n    \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshuoros%2Fleetcodehub","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshuoros%2Fleetcodehub","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshuoros%2Fleetcodehub/lists"}