LeetCode Blind 75 – Conquering the Challenge with Expert-Sourced Solutions and Strategies ( Updating )

Blind 75 is a list of LeetCode problems created by Facebook Engineer Yangshun. The list has become well-known due to its coverage of many common points in interviews.

It was originally posted on Blind (https://www.teamblind.com), which is why it is called the 【Blind 75】.

And here is the problem list, along with their solutions.



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

Dynamic Programming


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


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

Linked List

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


  • Set Matrix Zeroes
  • Spiral Matrix
  • Rotate Image
  • Word Search



  • Maximum Depth of Binary Tree
  • Same Tree
  • Invert/Flip Binary Tree
  • Binary Tree Maximum Path Sum
  • Binary Tree Level Order Traversal
  • Serialize and Deserialize Binary Tree
  • Subtree of Another Tree
  • Construct Binary Tree from Preorder and Inorder Traversal
  • Validate Binary Search Tree
  • Kth Smallest Element in a BST
  • Lowest Common Ancestor of BST
  • Implement Trie (Prefix Tree)
  • Add and Search Word
  • Word Search II


  • Merge K Sorted Lists
  • Top K Frequent Elements
  • Find Median from Data Stream


Random Post