Skip to content

Blind 75 LeetCode Problems: Detailed Solutions

Gopi Gorantala
Gopi Gorantala

Table of Contents

More problems are on the way.

Blind 75 is a curated collection of 75 coding problems commonly used by fast-paced startups and the top 1% of companies.

List gained popularity among software engineers for tech interviews, especially at Google, Amazon, and Facebook (Meta).


  1. Two Sum
  2. Best Time To Buy and Sell Stock
  3. Contains Duplicate
  4. Product of Array Except Itself
  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

Bit Manipulation

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

Gopi Gorantala Twitter

Gopi is an engineering leader with 12+ of experience in full-stack development—a specialist in Java technology stack. He worked for multiple startups, the European govt, and FAANG in India and Europe.


Related Posts

Members Public

Leetcode 217: Contains Duplicate

This question marks the first problem when working on duplicate data, either integers or strings etc. Companies that have asked this in their coding interview are Amazon, Apple, Netflix, Google, Microsoft, Adobe, Facebook, and many more top tech companies. Problem statement Given an integer array nums, return true if any

Leetcode 217: Contains Duplicate
Members Public

Leetcode 121: Best Time To Buy and Sell Stock

The Best time to buy and sell stock problem is a classic problem that can be solved using the Greedy approach. This is one of the most popular questions asked in such interviews. Companies that have asked this in their coding interview are Facebook, Amazon, Apple, Netflix, Google, Microsoft, Adobe,

Leetcode 121: Best Time To Buy and Sell Stock
Members Public

Leetcode 1: Two Sum Problem

In this article, you will acquire knowledge of different strategies to address the fundamental and timeless interview inquiries posed by numerous organizations.

Two Sum Problem