Skip to content

Blind 75 problems

This blind problems are a curated set of problems by a facebook engineer and is extremely useful for cracking the coding interview. However we've covered some of the problems in the problems sections of every other topics. Here I'll be adding links to those solutions.

Find the blind 75 problems on leetcode \(\to\)



  • 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


  • Longest Substring Without Repeating Characters
  • Longest Repeating Character Replacement
  • Minimum Window Substring
  • Valid Anagram
  • Group Anagrams
  • Valid Parentheses
  • Valid Palindrome
  • Longest Palindromic Substring
  • Palindromic Substrings
  • Encode and Decode Strings (Leetcode Premium)

Binary (bitwise operations)

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


Dynamic Programming

  • Climbing Stairs
  • Coin Change
  • Longest Increasing Subsequence
  • Longest Common Subsequence
  • Word Break Problem
  • Combination Sum
  • House Robber
  • House Robber II
  • Decode Ways
  • Unique Paths
  • Jump Game


This comments system is powered by GitHub Discussions