sasmita07 / leetcode-js-solution

Javascript Solutions of LeetCode Problems

js-solutions

• 992
• 2444
• 1614
• 1249
• 85
• 191
• 367

Algorithms

• Sliding Window

JavaScript

#	Title	Solution	Time	Space	Difficulty	Tag	Note
992	Subarrays with K Different Integers	JS	O(n)	O(n)	Hard
2444	Count Subarrays With Fixed Bounds	JS	O(n)	O(1)	Hard
1614	Maximum Nesting Depth of the Parentheses	JS	O(n)	O(1)	Easy
1249	Minimum Remove to Make Valid Parentheses	JS	O(n)	O(n)	Medium
85	Maximal Rectangle	JS	O(m*n)	O(n)	Hard
191	Number of 1 Bits	JS-Sol1	O(n)	O(1)	Easy
191	Number of 1 Bits	JS-Sol2	O(n)	O(1)	Easy
367	Valid Perfect Square	367-valid-perfect-square	O(logn)	O(1)	Easy