https://github.com/maddhruv/leetcode-blind-75-javascript
Solutions of LeetCode Blind 75 Problems in JavaScript
https://github.com/maddhruv/leetcode-blind-75-javascript
algorithm algorithms blind-75 blind-leetcode data-structures data-structures-and-algorithms leetcode leetcode-solutions
Last synced: 6 months ago
JSON representation
Solutions of LeetCode Blind 75 Problems in JavaScript
- Host: GitHub
- URL: https://github.com/maddhruv/leetcode-blind-75-javascript
- Owner: maddhruv
- License: apache-2.0
- Created: 2022-05-22T06:27:16.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-05-28T12:53:48.000Z (over 3 years ago)
- Last Synced: 2025-04-30T05:43:51.313Z (6 months ago)
- Topics: algorithm, algorithms, blind-75, blind-leetcode, data-structures, data-structures-and-algorithms, leetcode, leetcode-solutions
- Language: JavaScript
- Homepage: https://maddhruv.github.io/leetcode-blind-75-javascript/
- Size: 36.1 KB
- Stars: 35
- Watchers: 2
- Forks: 3
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LeetCode Blind 75 Problems in JavaScript
Solutions of LeetCode Blind 75 Problems in JavaScript
:goal_net: [Curated List of Top 75 LeetCode Questions](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU)
| Problem | Difficulty | Tags | LeetCode |
| --------------------------------------------------------------------------------- | --------------------------------------------------------- | ------------------------------------------------------------ | ----------------------------------------------------------------------------- |
| [Two Sum](./two-sum.js) | 
| `Array`, `Hash Table` | [:link:](https://leetcode.com/problems/two-sum/) |
| [Best Time to Buy and Sell Stock](./best-time-to-buy-and-sell-stock.js) | | `Array`, `Dynamic Programming` | [:link:](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |
| [Contains Duplicate](./contains-duplicate.js) | | `Array`, `Set`, `Sorting`, `Hash Table` | [:link:](https://leetcode.com/problems/contains-duplicate/) |
| [Product of Array Except Self](./product-of-array-except-self.js) | 
| `Array` | [:link:](https://leetcode.com/problems/product-of-array-except-self/) |
| [Maximum Subarray](./maximum-subarray.js) | | `Array`, `Dynamic Programming`, `Divide & Conquer` | [:link:](https://leetcode.com/problems/maximum-subarray/) |
| [ Maximum Product Subarray](./maximum-product-subarray.js) | | `Array`, `Dynamic Programming` | [:link:](https://leetcode.com/problems/maximum-product-subarray/) |
| [Find Minimum in Rotated Sorted Array](./find-minimum-in-rotated-sorted-array.js) | | `Array`, `Binary Search` | [:link:](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) |
| [Search in Rotated Sorted Array](./search-in-rotated-sorted-array.js) | | `Array`, `Binary Search` | [:link:](https://leetcode.com/problems/search-in-rotated-sorted-array/) |
| [3Sum](./3sum.js) | | `Array`, `Two Pointers`, `Sorting` | [:link:](https://leetcode.com/problems/3sum/) |
| [Container With Most Water](./container-with-most-water.js) | | `Array`, `Two Pointers`, `Greedy` | [:link:](https://leetcode.com/problems/container-with-most-water/) |
| [Sum of Two Integers](./sum-of-two-integers.js) | | `Math`, `Bit Manipulation` | [:link:](https://leetcode.com/problems/sum-of-two-integers/) |
| [Number of 1 Bits](./number-of-1-bits.js) | | `Bit Manipulation` | [:link:](https://leetcode.com/problems/number-of-1-bits/) |
| [Counting Bits]() | | | [:link:](https://leetcode.com/problems/counting-bits/) |
| [Missing Number]() | | | [:link:](https://leetcode.com/problems/missing-number/) |
| [Reverse Bits]() | | | [:link:](https://leetcode.com/problems/reverse-bits/) |
| [Climbing Stairs](./climbing-stairs.js) | | `Math`, `Dynamic Programming`, `Memoization` | [:link:](https://leetcode.com/problems/climbing-stairs/) |
| [Word Search](./word-search.js) | | `Array`, `Backtracking`, `Matrix` | [:link:](https://leetcode.com/problems/word-search/) |
| [Clone Graph](./clone-graph.js) | | `Graph`, `HashTable`, `DFS`, `BFS` | [:link:](https://leetcode.com/problems/clone-graph/) |
| [Course Schedule](./course-schedule.js) | | `Graph`, `Topological Sort`, `DFS`, `BFS` | [:link:](https://leetcode.com/problems/course-schedule/) |
| [Pacific Atlantic Water Flow]() | | | [:link:](https://leetcode.com/problems/pacific-atlantic-water-flow/) |
| [Number of Islands](./number-of-islands.js) | | `Array`, `Matrix`, `DFS`, `BFS` | [:link:](https://leetcode.com/problems/number-of-islands/) |
| [Longest Consecutive Sequence](./longest-consecutive-sequence.js) | | `Array`, `HashTable` | [:link:](https://leetcode.com/problems/longest-consecutive-sequence/) |
| [Insert Interval](./insert-interval.js) | | `Array` | [:link:](https://leetcode.com/problems/insert-interval/) |
| [Reverse Linked List](./reverse-linked-list.js) | | `Linked List` | [:link:](https://leetcode.com/problems/reverse-linked-list/) |
| [Linked List Cycle](./linked-list-cycle.js) | | `Linked List`, `Hash Table`, `Two Pointers` | [:link:](https://leetcode.com/problems/linked-list-cycle/) |
| [Merge Two Sorted Lists](./merge-two-sorted-lists.js) | | `Linked List`, `Recursion` | [:link:](https://leetcode.com/problems/merge-two-sorted-lists/) |
| [Merge k Sorted Lists](./merge-k-sorted-lists.js) | 
| `Linked List`, `Recursion`, `Divide & Conquer`, `Merge Sort` | [:link:](https://leetcode.com/problems/merge-k-sorted-lists/) |
| [Remove Nth Node From End of List](./remove-nth-node-from-end-of-list.js) | | `LinkedList`, `Two Pointers` | [:link:](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) |