Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/sasmita07/leetcode-js-solution
Javascript Solutions of LeetCode Problems
https://github.com/sasmita07/leetcode-js-solution
algorithms-and-data-structures javascript leetcode-javascript-solutions leetcode-solutions
Last synced: about 2 months ago
JSON representation
Javascript Solutions of LeetCode Problems
- Host: GitHub
- URL: https://github.com/sasmita07/leetcode-js-solution
- Owner: Sasmita07
- Created: 2024-03-30T17:26:28.000Z (10 months ago)
- Default Branch: main
- Last Pushed: 2024-04-27T16:29:30.000Z (9 months ago)
- Last Synced: 2024-04-27T17:28:11.527Z (9 months ago)
- Topics: algorithms-and-data-structures, javascript, leetcode-javascript-solutions, leetcode-solutions
- Language: JavaScript
- Homepage:
- Size: 15.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# js-solutions
- [992](https://github.com/Sasmita07/leetcode-js-solution/tree/main?tab=readme-ov-file#javascript)
- [2444](https://github.com/Sasmita07/leetcode-js-solution/tree/main?tab=readme-ov-file#javascript)
- 1614
- 1249
- 85
- 191
- 367
# Algorithms
- Sliding Window
## JavaScript
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
| ---- | ------------------------------------------------------------------------------------------------------------------------------- | -------------------------------------------------------------------------------------------------------------------------------- | --------- | ------ | ---------- | --- | ---- |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |