{"id":22967538,"url":"https://github.com/yuangwei/leetcode","last_synced_at":"2025-04-10T05:07:15.462Z","repository":{"id":166356988,"uuid":"641839531","full_name":"yuangwei/leetcode","owner":"yuangwei","description":"Mastering leetcode using simple javaScript.","archived":false,"fork":false,"pushed_at":"2024-12-21T06:52:41.000Z","size":808,"stargazers_count":61,"open_issues_count":0,"forks_count":10,"subscribers_count":13,"default_branch":"main","last_synced_at":"2025-03-24T08:12:10.836Z","etag":null,"topics":["algorithms-and-data-structures","javascript","leetcode","leetcode-solutions"],"latest_commit_sha":null,"homepage":"https://leetcode.js.org","language":"MDX","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/yuangwei.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"contributing.md","funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-05-17T09:17:27.000Z","updated_at":"2025-01-01T08:29:05.000Z","dependencies_parsed_at":"2023-10-16T16:30:27.830Z","dependency_job_id":"292b3223-19e3-4784-a308-dadf65783632","html_url":"https://github.com/yuangwei/leetcode","commit_stats":{"total_commits":206,"total_committers":2,"mean_commits":103.0,"dds":0.004854368932038833,"last_synced_commit":"0977d933e6b0b50e9a04264b2c556aa856075c67"},"previous_names":["yuangwei/code-solutions","yuangwei/leetcode","yuangwei/javascript-leetcode","gavinleige/leetcode","craftheon/leetcode","yuang-wei/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yuangwei%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yuangwei%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yuangwei%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yuangwei%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yuangwei","download_url":"https://codeload.github.com/yuangwei/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246916761,"owners_count":20854514,"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":["algorithms-and-data-structures","javascript","leetcode","leetcode-solutions"],"created_at":"2024-12-14T21:13:55.747Z","updated_at":"2025-04-03T01:12:54.862Z","avatar_url":"https://github.com/yuangwei.png","language":"MDX","funding_links":[],"categories":[],"sub_categories":[],"readme":"JavaScript-LeetCode\n---\nMastering Leetcode Problem-Solving Using Simple JavaScript.\n\n| #(26) | Title | Solution | Difficulty  |\n| ---| ----- | -------- | ---------- | \n| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | [Solution](https://leetcode.js.org/solutions/two-sum) | Easy |\n| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Solution](https://leetcode.js.org/solutions/palindrome-number) | Easy |\n| 15 | [3Sum](https://leetcode.com/problems/3sum) | [Solution](https://leetcode.js.org/solutions/3sum) | Medium |\n| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Solution](https://leetcode.js.org/solutions/valid-parentheses) | Easy |\n| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Solution](https://leetcode.js.org/solutions/merge-two-sorted-lists) | Easy |\n| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Solution](https://leetcode.js.org/solutions/insert-interval) | Medium |\n| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Solution](https://leetcode.js.org/solutions/climbing-stairs) | Easy |\n| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Solution](https://leetcode.js.org/solutions/binary-tree-level-order-traversal) | Medium |\n| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Solution](https://leetcode.js.org/solutions/maximum-depth-of-binary-tree) | Easy |\n| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Solution](https://leetcode.js.org/solutions/balanced-binary-tree) | Easy |\n| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Solution](https://leetcode.js.org/solutions/best-time-to-buy-and-sell-stock) | Easy |\n| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Solution](https://leetcode.js.org/solutions/valid-palindrome) | Easy |\n| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Solution](https://leetcode.js.org/solutions/linked-list-cycle) | Easy |\n| 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [Solution](https://leetcode.js.org/solutions/majority-element) | Easy |\n| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Solution](https://leetcode.js.org/solutions/reverse-linked-list) | Easy |\n| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Solution](https://leetcode.js.org/solutions/contains-duplicate) | Easy |\n| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Solution](https://leetcode.js.org/solutions/invert-binary-tree) | Easy |\n| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Solution](https://leetcode.js.org/solutions/lowest-common-ancestor-of-a-binary-search-tree) | Medium |\n| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Solution](https://leetcode.js.org/solutions/valid-anagram) | Easy |\n| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Solution](https://leetcode.js.org/solutions/counting-bits) | Easy |\n| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Solution](https://leetcode.js.org/solutions/ransom-note) | Easy |\n| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Solution](https://leetcode.js.org/solutions/longest-palindrome) | Easy |\n| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Solution](https://leetcode.js.org/solutions/diameter-of-binary-tree) | Easy |\n| 792 | [Binary Search](https://leetcode.com/problems/binary-search) | [Solution](https://leetcode.js.org/solutions/binary-search) | Easy |\n| 874 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Solution](https://leetcode.js.org/solutions/backspace-string-compare) | Easy |\n| 908 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Solution](https://leetcode.js.org/solutions/middle-of-the-linked-list) | Easy |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyuangwei%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyuangwei%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyuangwei%2Fleetcode/lists"}