Blind 75 Javascript Solutions

This repository includes Javascript solutions to the curated Blind 75 list. Each solution is accompanied by test cases that can be run using Jest.

Getting Started

To utilize this repository, follow these simple steps:

Prerequisites

Node.js installed on your machine
Yarn package manager

Clone the Repository

git clone https://github.com/Maneesha24/Blind-75-javascript-solutions.git

Initialize the Project

Navigate into the cloned repository and initialize it using Yarn.

cd Blind-75-javascript-solutions
yarn install

Run Tests

To execute all the test cases using Jest, run the following command:

yarn test

Contributing

Contributions are welcome! If you'd like to add more solutions or improve existing ones, please feel free to fork this repository and submit a pull request.

Happy learning! 🚀

Name		Name	Last commit message	Last commit date
Latest commit History 23 Commits
1. Two Sum		1. Two Sum
100. Same Tree		100. Same Tree
102. Binary Tree Level Order Traversal		102. Binary Tree Level Order Traversal
104. Maximum Depth of Binary Tree		104. Maximum Depth of Binary Tree
105. Construct Binary Tree from Preorder and Inorder Traversal		105. Construct Binary Tree from Preorder and Inorder Traversal
11. Container With Most Water		11. Container With Most Water
1143. Longest Common Subsequence		1143. Longest Common Subsequence
121. Best Time to Buy and Sell Stock		121. Best Time to Buy and Sell Stock
124. Binary Tree Maximum Path Sum		124. Binary Tree Maximum Path Sum
125. Valid Palindrome		125. Valid Palindrome
128. Longest Consecutive Sequence		128. Longest Consecutive Sequence
133. Clone Graph		133. Clone Graph
139. Word Break		139. Word Break
141. Linked List Cycle		141. Linked List Cycle
143. Reorder List		143. Reorder List
15. 3Sum		15. 3Sum
152. Maximum Product Subarray		152. Maximum Product Subarray
153. Find Minimum in Rotated Sorted Array		153. Find Minimum in Rotated Sorted Array
19. Remove Nth Node From End of List		19. Remove Nth Node From End of List
190. Reverse Bits		190. Reverse Bits
191. Number of 1 Bits		191. Number of 1 Bits
198. House Robber		198. House Robber
20. Valid Parentheses		20. Valid Parentheses
200. Number of Islands		200. Number of Islands
206. Reverse Linked List		206. Reverse Linked List
207. Course Schedule		207. Course Schedule
208. Implement Trie (Prefix Tree)		208. Implement Trie (Prefix Tree)
21. Merge Two Sorted Lists		21. Merge Two Sorted Lists
211. Design Add and Search Words Data Structure		211. Design Add and Search Words Data Structure
212. Word Search II		212. Word Search II
213. House Robber II		213. House Robber II
217. Contains Duplicate		217. Contains Duplicate
226. Invert Binary Tree		226. Invert Binary Tree
23. Merge k Sorted Lists		23. Merge k Sorted Lists
230. Kth Smallest Element in a BST		230. Kth Smallest Element in a BST
235. Lowest Common Ancestor of a Binary Search Tree		235. Lowest Common Ancestor of a Binary Search Tree
238. Product of Array Except Self		238. Product of Array Except Self
242. Valid Anagram		242. Valid Anagram
252. Meeting Rooms		252. Meeting Rooms
253. Meeting Rooms II		253. Meeting Rooms II
261. Graph Valid Tree		261. Graph Valid Tree
268. Missing Number		268. Missing Number
269. Alien Dictionary		269. Alien Dictionary
271. Encode and Decode Strings		271. Encode and Decode Strings
295. Find Median from Data Stream		295. Find Median from Data Stream
297. Serialize and Deserialize Binary Tree		297. Serialize and Deserialize Binary Tree
3. Longest Substring Without Repeating Characters		3. Longest Substring Without Repeating Characters
300. Longest Increasing Subsequence		300. Longest Increasing Subsequence
322. Coin Change		322. Coin Change
323. Number of Connected Components in an Undirected Graph		323. Number of Connected Components in an Undirected Graph
33. Search in Rotated Sorted Array		33. Search in Rotated Sorted Array
338. Counting Bits		338. Counting Bits
347. Top K Frequent Elements		347. Top K Frequent Elements
371. Sum of Two Integers		371. Sum of Two Integers
39. Combination Sum		39. Combination Sum
417. Pacific Atlantic Water Flow		417. Pacific Atlantic Water Flow
424. Longest Repeating Character Replacement		424. Longest Repeating Character Replacement
435. Non-overlapping Intervals		435. Non-overlapping Intervals
48. Rotate Image		48. Rotate Image
49. Group Anagrams		49. Group Anagrams
5. Longest Palindromic Substring		5. Longest Palindromic Substring
53. Maximum Subarray		53. Maximum Subarray
54. Spiral Matrix		54. Spiral Matrix
55. Jump Game		55. Jump Game
56. Merge Intervals		56. Merge Intervals
57. Insert Interval		57. Insert Interval
572. Subtree of Another Tree		572. Subtree of Another Tree
62. Unique Paths		62. Unique Paths
647. Palindromic Substrings		647. Palindromic Substrings
70. Climbing Stairs		70. Climbing Stairs
73. Set Matrix Zeroes		73. Set Matrix Zeroes
76. Minimum Window Substring		76. Minimum Window Substring
79. Word Search		79. Word Search
91. Decode Ways		91. Decode Ways
98. Validate Binary Search Tree		98. Validate Binary Search Tree
GraphNode.js		GraphNode.js
ListNode.js		ListNode.js
README.md		README.md
TreeNode.js		TreeNode.js
TrieNode.js		TrieNode.js
package.json		package.json

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Blind 75 Javascript Solutions

Getting Started

Prerequisites

Clone the Repository

Initialize the Project

Run Tests

Contributing

About

Releases

Packages

Languages

Maneesha24/Blind-75-javascript-solutions

Folders and files

Latest commit

History

Repository files navigation

Blind 75 Javascript Solutions

Getting Started

Prerequisites

Clone the Repository

Initialize the Project

Run Tests

Contributing

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages