{"id":20091540,"url":"https://github.com/tasxatzial/leetcode-js","last_synced_at":"2025-03-02T15:49:32.307Z","repository":{"id":181928489,"uuid":"649061934","full_name":"tasxatzial/leetcode-js","owner":"tasxatzial","description":"Leetcode solutions in JavaScript","archived":false,"fork":false,"pushed_at":"2024-07-12T00:20:06.000Z","size":75,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-13T03:09:55.985Z","etag":null,"topics":["leetcode","leetcode-javascript"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/tasxatzial.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-06-03T16:46:33.000Z","updated_at":"2024-07-15T03:37:03.000Z","dependencies_parsed_at":"2024-07-12T02:12:17.384Z","dependency_job_id":null,"html_url":"https://github.com/tasxatzial/leetcode-js","commit_stats":null,"previous_names":["tasxatzial/leetcode.js","tasxatzial/leetcode-js"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tasxatzial%2Fleetcode-js","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tasxatzial%2Fleetcode-js/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tasxatzial%2Fleetcode-js/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tasxatzial%2Fleetcode-js/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tasxatzial","download_url":"https://codeload.github.com/tasxatzial/leetcode-js/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241533643,"owners_count":19977825,"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-javascript"],"created_at":"2024-11-13T16:33:04.891Z","updated_at":"2025-03-02T15:49:32.286Z","avatar_url":"https://github.com/tasxatzial.png","language":"JavaScript","readme":"# Leetcode (JavaScript)\r\n\r\n[Leetcode](https://leetcode.com/) is an online platform that provides a collection of coding challenges and algorithmic problems to help individuals improve their programming skills and prepare for technical interviews.\r\n\r\n---\r\n\r\nThis repo contains my solutions to the problems.\r\n\r\n## Solutions\r\n\r\n| #    | Problem                                                                          | Algorithm / Structure        | Concept             |\r\n|------|----------------------------------------------------------------------------------|------------------------------|---------------------|\r\n| 1    | [Two Sum](problems/1/)                                                           | Binary search, Hash map      |                     |\r\n| 20   | [Valid Parentheses](problems/20/)                                                | Stack                        |                     |\r\n| 21   | [Merge Two Sorted Lists](problems/21/)                                           |                              |                     |\r\n| 34   | [Find First and Last Position of Element in Sorted Array](problems/34)           | Binary search                |                     |\r\n| 84   | [Largest Rectangle in Histogram](problems/84/)                                   | Stack                        |                     |\r\n| 113  | [Path Sum II](problems/113/)                                                     | Depth-first search           |                     |\r\n| 121  | [Best Time to Buy and Sell Stock](problems/121/)                                 |                              |                     |\r\n| 189  | [Rotate Array](problems/189/)                                                    |                              |                     |\r\n| 191  | [Number of 1 Bits](problems/191/)                                                |                              | Hamming weight      |\r\n| 211  | [Design Add and Search Words Data Structure](problems/211/)                      | Trie                         |                     |\r\n| 258  | [Add Digits](problems/258/)                                                      |                              | Digital root        |\r\n| 421  | [Maximum XOR of Two Numbers in an Array](problems/421/)                          | Trie                         |                     |\r\n| 532  | [K-diff Pairs in an Array](problems/532/)                                        | Binary search, Hash map      |                     |\r\n| 941  | [Valid Mountain Array](problems/941/)                                            |                              |                     |\r\n| 1305 | [All Elements in Two Binary Search Trees](problems/1305/)                        | Depth-first search           |                     |\r\n| 1672 | [Richest Customer Wealth](problems/1672/)                                        |                              |                     |\r\n|      |                                                                                  |                              |                     |\r\n\r\n## Implemented algorithms \u0026 data structures\r\n\r\n* [Binary search](https://en.wikipedia.org/wiki/Binary_search_algorithm)\r\n* [Depth-first search](https://en.wikipedia.org/wiki/Depth-first_search)\r\n* [Hash map](https://en.wikipedia.org/wiki/Hash_table)\r\n* [Stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))\r\n* [Trie](https://en.wikipedia.org/wiki/Trie)\r\n\r\n## Concepts\r\n\r\n* [Digital root](https://en.wikipedia.org/wiki/Digital_root)\r\n* [Hamming weight](https://en.wikipedia.org/wiki/Hamming_weight)\r\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftasxatzial%2Fleetcode-js","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftasxatzial%2Fleetcode-js","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftasxatzial%2Fleetcode-js/lists"}