About The Project

This project aims to provide solutions to Blind 75 Leetcode problems using TypeScript. Additionally, unit tests have been written for each solution.

Table of Contents

• About The Project
  • Table of Contents
• Installation
• Categories
  • Array
  • Binary
  • Dynamic Programming
  • Graph
  • Interval
  • Linked List
  • Matrix
  • String
  • Tree
  • Heap

Installation

1. Clone the repo

   git clone https://github.com/muratdemirci/blind-75-leetcode-problem-solutions.git

2. Install NPM packages

   npm install

3. Run tests

   npm run test
   

(back to top)

Categories

The categories of algorithm questions

Array

1. Two Sum
2. Best Time to Buy and Sell Stock
3. Contains Duplicate
4. Product of Array Except Self
5. Maximum Subarray
6. Maximum Product Subarray
7. Find Minimum in Rotated Sorted Array
8. Search in Rotated Sorted Array
9. 3 Sum
10. Container With Most Water

(back to top)

Binary

1. Sum of Two Integers
2. Number of 1 Bits
3. Counting Bits
4. Missing Number
5. Reverse Bits

(back to top)

Dynamic Programming

1. Climbing Stairs
2. Coin Change
3. Longest Increasing Subsequence
4. Longest Common Subsequence
5. Word Break Problem
6. Combination Sum
7. House Robber
8. House Robber II
9. Decode Ways
10. Unique Paths
11. Jump Game

(back to top)

Graph

1. Clone Graph
2. Course Schedule
3. Pacific Atlantic Water Flow
4. Number of Islands
5. Longest Consecutive Sequence
6. Alien Dictionary
7. Graph Valid Tree
8. Number of Connected Components in an Undirected Graph (Leetcode Premium)

(back to top)

Interval

1. Insert Interval
2. Merge Intervals
3. Non-overlapping Intervals
4. Meeting Rooms
5. Meeting Rooms II

(back to top)

Linked List

1. Reverse a Linked List
2. Detect Cycle in a Linked List
3. Merge Two Sorted Lists
4. Merge K Sorted Lists
5. Remove Nth Node From End Of List
6. Reorder List

(back to top)

Matrix

1. Set Matrix Zeroes
2. Spiral Matrix
3. Rotate Image
4. Word Search

(back to top)

String

1. Longest Substring Without Repeating Characters
2. Longest Repeating Character Replacement
3. Minimum Window Substring
4. Valid Anagram
5. Group Anagrams
6. Valid Parentheses
7. Valid Palindrome
8. Longest Palindromic Substring
9. Palindromic Substrings
10. Encode and Decode Strings

(back to top)

Tree

1. Maximum Depth of Binary Tree
2. Same Tree
3. Invert/Flip Binary Tree
4. Binary Tree Maximum Path Sum
5. Binary Tree Level Order Traversal
6. Serialize and Deserialize Binary Tree
7. Subtree of Another Tree
8. Construct Binary Tree from Preorder and Inorder Traversal
9. Validate Binary Search Tree
10. Kth Smallest Element in a BST
11. Lowest Common Ancestor of BST
12. Implement Trie (Prefix Tree)
13. Add and Search Word
14. Word Search II

(back to top)

Heap

1. Merge K Sorted Lists
2. Top K Frequent Elements
3. Find Median from Data Stream

(back to top)