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).

Arrays

  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
Blind75
Gopi Gorantala

Gopi Gorantala Twitter

Gopi is a software engineer with over 14 years of experience. He specializes in Java-based technology stack and has worked for various startups, the European government, and technology giants.

Comments

Related Posts

Members Public

Leetcode 238: Product Of Array Except Self

Members Public

Leetcode 217: Contains Duplicate

This lesson will teach you how to find the duplicate element using a hashing algorithm.

Leetcode 217: Contains Duplicate
Members Public

Leetcode 121: Best Time To Buy and Sell Stock

Leetcode 121: Best Time To Buy and Sell Stock