{"id":22479099,"url":"https://github.com/sasmita07/leetcode-js-solution","last_synced_at":"2025-03-27T18:23:03.674Z","repository":{"id":230600259,"uuid":"779752301","full_name":"Sasmita07/leetcode-js-solution","owner":"Sasmita07","description":"Javascript Solutions of LeetCode Problems","archived":false,"fork":false,"pushed_at":"2024-04-27T16:29:30.000Z","size":16,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-01T21:28:21.228Z","etag":null,"topics":["algorithms-and-data-structures","javascript","leetcode-javascript-solutions","leetcode-solutions"],"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/Sasmita07.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":"2024-03-30T17:26:28.000Z","updated_at":"2024-04-27T16:29:29.000Z","dependencies_parsed_at":"2024-04-27T17:28:12.665Z","dependency_job_id":"d42c8185-cbb0-40e4-943b-4ed703936bc4","html_url":"https://github.com/Sasmita07/leetcode-js-solution","commit_stats":null,"previous_names":["sasmita07/leetcode-js-solution"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sasmita07%2Fleetcode-js-solution","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sasmita07%2Fleetcode-js-solution/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sasmita07%2Fleetcode-js-solution/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sasmita07%2Fleetcode-js-solution/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Sasmita07","download_url":"https://codeload.github.com/Sasmita07/leetcode-js-solution/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245898923,"owners_count":20690590,"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-javascript-solutions","leetcode-solutions"],"created_at":"2024-12-06T15:13:03.881Z","updated_at":"2025-03-27T18:23:03.629Z","avatar_url":"https://github.com/Sasmita07.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# js-solutions\n\n- [992](https://github.com/Sasmita07/leetcode-js-solution/tree/main?tab=readme-ov-file#javascript)\n- [2444](https://github.com/Sasmita07/leetcode-js-solution/tree/main?tab=readme-ov-file#javascript)\n- 1614\n- 1249\n- 85\n- 191\n- 367\n\n# Algorithms\n\n- Sliding Window\n\n## JavaScript\n\n| #    | Title                                                                                                                           | Solution                                                                                                                         | Time      | Space  | Difficulty | Tag | Note |\n| ---- | ------------------------------------------------------------------------------------------------------------------------------- | -------------------------------------------------------------------------------------------------------------------------------- | --------- | ------ | ---------- | --- | ---- |\n| 992  | [Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers/description/)           | [JS](https://github.com/Sasmita07/leetcode-js-solution/blob/main/js-solutions/992-subarrays-with-k-distinct.js)                  | _O(n)_    | _O(n)_ | Hard       |     |\n| 2444 | [Count Subarrays With Fixed Bounds](https://leetcode.com/problems/count-subarrays-with-fixed-bounds/description/)               | [JS](https://github.com/Sasmita07/leetcode-js-solution/blob/main/js-solutions/2444-count-subarrays-with-fixed-bounds.js)         | _O(n)_    | _O(1)_ | Hard       |     |\n| 1614 | [ Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/description) | [JS](https://github.com/Sasmita07/leetcode-js-solution/blob/main/js-solutions/1614-maximum-nesting-depth-of-the-parentheses.js)  | _O(n)_    | _O(1)_ | Easy       |     |\n| 1249 | [ Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/description) | [JS](https://github.com/Sasmita07/leetcode-js-solution/blob/main/js-solutions/1249-minimum-remove-to-make-valid-parentheses.js)  | _O(n)_    | _O(n)_ | Medium     |     |\n| 85   | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/description)                                                | [JS](https://github.com/Sasmita07/leetcode-js-solution/blob/main/js-solutions/85-maximal-rectangle.js)                           | _O(m\\*n)_ | _O(n)_ | Hard       |     |\n| 191  | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/description)                                                  | [JS-Sol1](https://github.com/Sasmita07/leetcode-js-solution/blob/main/js-solutions/191-number-of-1-bits.js)                      | _O(n)_    | _O(1)_ | Easy       |     |\n| 191  | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/description)                                                  | [JS-Sol2](https://github.com/Sasmita07/leetcode-js-solution/blob/main/js-solutions/191-number-of-1-bits-sol2.js)                 | _O(n)_    | _O(1)_ | Easy       |     |\n| 367  | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/description)                                          | [367-valid-perfect-square](https://github.com/Sasmita07/leetcode-js-solution/blob/main/js-solutions/367-valid-perfect-square.js) | _O(logn)_ | _O(1)_ | Easy       |     |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsasmita07%2Fleetcode-js-solution","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsasmita07%2Fleetcode-js-solution","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsasmita07%2Fleetcode-js-solution/lists"}