🧠 LeetCode Blind 75

Description

• Blind 75 is a curated list of the top 75 algorithm problems in LeetCode posted on the Blind platform by a Facebook engineer.

• You can find further information at this link.

• The sequence of problems for this repository is followed as per the NeetCode BLIND 75 List.

• I have included the free links for Leetcode Premium Problems.

---

Problems

Array & Hashing

• Contains Duplicate
• Valid Anagram
• Two Sum
• Group Anagrams
• Top K Frequent Elements
• Product of Array Except Self
• Encode and Decode Strings (Leetcode Premium)
• Longest Consecutive Sequence

---

Two Pointers

• Valid Palindrome
• 3 Sum
• Container With Most Water

---

Sliding Window

• Best Time to Buy and Sell Stock
• Longest Substring Without Repeating Characters
• Longest Repeating Character Replacement
• Minimum Window Substring

---

Stack

• Valid Parentheses

---

Binary Search

• Find Minimum in Rotated Sorted Array
• Search in Rotated Sorted Array

---

Linked List

• Reverse a Linked List
• Merge Two Sorted Lists
• Reorder List
• Remove Nth Node From End Of List
• Detect Cycle in a Linked List
• Merge K Sorted Lists

---

Tree

• Invert Binary Tree
• Maximum Depth of Binary Tree
• Same Tree
• Subtree of Another Tree
• Lowest Common Ancestor of BST
• Binary Tree Level Order Traversal
• Validate Binary Search Tree
• Kth Smallest Element in a BST
• Construct Binary Tree from Preorder and Inorder Traversal
• Binary Tree Maximum Path Sum
• Serialize and Deserialize Binary Tree

---

Trie

• Implement Trie (Prefix Tree)
• Add and Search Word
• Word Search II

---

Heap/Priority Queue

• Find Median from Data Stream

---

Backtracking

• Combination Sum
• Word Search

---

Graph

• Number of Islands
• Clone Graph
• Pacific Atlantic Water Flow
• Course Schedule
• Number of Connected Components in an Undirected Graph (Leetcode Premium)
• Graph Valid Tree (Leetcode Premium)

---

Advanced Graphs

• Alien Dictionary (Leetcode Premium)

---

1-D Dynamic Programming

• Climbing Stairs
• House Robber
• House Robber II
• Longest Palindromic Substring
• Palindromic Substrings
• Decode Ways
• Coin Change
• Maximum Product Subarray
• Word Break
• Longest Increasing Subsequence

---

2-D Dynamic Programming

• Unique Paths
• Longest Common Subsequence

---

Greedy

• Maximum Subarray
• Jump Game

---

Intervals

• Insert Interval
• Merge Intervals
• Non-overlapping Intervals
• Meeting Rooms (Leetcode Premium)
• Meeting Rooms II (Leetcode Premium)

---

Math & Geometry

• Rotate Image
• Spiral Matrix
• Set Matrix Zeroes

---

Bit Manipulation

• Number of 1 Bits
• Counting Bits
• Reverse Bits
• Missing Number
• Sum of Two Integers