Blind 75 Overview

Blind 75 leetcode is a list of 75 most frequent asked leetcode questions which had helped many developers clear interviews of **Google, Facebook, Amazon** etc. Hence, it is a tried and tested list with 1000s of testimonials available on all public review platforms such as quora, teamblind etc.

About Instructor

- Software Engineer at
**Google**. - Offers from
**Facebook London**and other startups. - Previously worked with
**Amazon, Media.net**. - Followed by
**1M+**people across YT, Linkedin and other socials. - Candidate Master at Codeforces.
- 6* at Codechef.

If you still have doubts or questions, we’ve got you covered! Check out our FAQs section at the bottom of the page, where we address some common queries that might help clarify any concerns you have.

**Note:** Only start solving the problems, if you have prior knowledge of DSA, in
case you are a
beginner please switch to Strivers A2Z DSA Sheet.

**Part 1**: Array(0/10)

Action | Problem [Articles, Codes] | PL-1 | Solution | PL-2 | Notes | Company |
---|---|---|---|---|---|---|

2Sum Problem | ||||||

Best Time to Buy and Sell Stock |(DP-35) | ||||||

Contains Duplicate | ||||||

Product of Array Except Self | ||||||

Kadane’s Algorithm, maximum subarray sum | ||||||

Maximum Product Subarray | ||||||

Find minimum in Rotated Sorted Array | ||||||

Search in Rotated Sorted Array I | ||||||

3 sum | ||||||

Container with most water |

**Part 2**: Binary(0/5)

Action | Problem [Articles, Codes] | PL-1 | Solution | PL-2 | Notes | Company |
---|---|---|---|---|---|---|

Sum of Two Integers | ||||||

Number of 1 Bits | ||||||

Counting Bits | ||||||

Find missing number in an array | ||||||

Reverse Bits |

**Part 3**: Dynamic Programming(0/11)

Action | Problem [Articles, Codes] | PL-1 | Solution | PL-2 | Notes | Company |
---|---|---|---|---|---|---|

Climbing Stars | ||||||

Coin change | ||||||

Longest Increasing Subsequence | ||||||

Longest Common Subsequence | ||||||

Word Break | ||||||

Combination Sum | ||||||

Maximum sum of non-adjacent elements (DP 5… | ||||||

House Robber (DP 6) | ||||||

Decode Ways | ||||||

Grid Unique Paths | ||||||

Jump Game |

**Part 4**: Graph(0/8)

Action | Problem [Articles, Codes] | PL-1 | Solution | PL-2 | Notes | Company |
---|---|---|---|---|---|---|

Clone Graph | ||||||

Course Schedule – I | ||||||

Pacific Atlantic Water Flow | ||||||

Number of islands(Do in Grid and Graph Bot… | ||||||

Longest Consecutive Sequence | ||||||

Alien dictionary | ||||||

Graph Valid Tree | ||||||

Connected Components | Logic Explanation |

**Part 5**: Interval(0/6)

Action | Problem [Articles, Codes] | PL-1 | Solution | PL-2 | Notes | Company |
---|---|---|---|---|---|---|

Insert Interval | ||||||

Merge Intervals | ||||||

Non-overlapping Intervals | ||||||

Repeat and Missing Number | ||||||

Meeting Rooms (Leetcode Premium). | ||||||

Meeting Rooms II (Leetcode Premium) |

**Part 6**: Linked List(0/6)

Action | Problem [Articles, Codes] | PL-1 | Solution | PL-2 | Notes | Company |
---|---|---|---|---|---|---|

Reverse a LinkedList | ||||||

Detect a cycle in Linked List | ||||||

Merge two sorted Linked List (use method u… | ||||||

Merge K sorted arrays | ||||||

Remove N-th node from back of LinkedList | ||||||

Reorder List |

**Part 7**: Matrix(0/4)

Action | Problem [Articles, Codes] | PL-1 | Solution | PL-2 | Notes | Company |
---|---|---|---|---|---|---|

Set Matrix Zeros | ||||||

Print the matrix in spiral manner | ||||||

Rotate Matrix by 90 degrees | ||||||

Word Search |

**Part 8**: String(0/10)

Action | Problem [Articles, Codes] | PL-1 | Solution | PL-2 | Notes | Company |
---|---|---|---|---|---|---|

Longest Substring Without Repeating Charac… | ||||||

longest repeating character replacement | ||||||

Minimum Window Substring | ||||||

Check for Anagrams | ||||||

Group Anagrams | ||||||

Check for balanced paranthesis | ||||||

Check Palindrome | ||||||

Longest Palindromic Substring[Do it withou… | ||||||

Palindromic Substrings | ||||||

Encode and Decode Strings (Leetcode Premiu… |

**Part 9**: Tree(0/13)

Action | Problem [Articles, Codes] | PL-1 | Solution | PL-2 | Notes | Company |
---|---|---|---|---|---|---|

Height of a Binary Tree | ||||||

Check if two trees are identical or not | ||||||

Invert/Flip Binary Tree (Create) | ||||||

Maximum path sum | ||||||

Level order Traversal / Level order traver… | ||||||

Serialize and deserialize Binary Tree | ||||||

Subtree of Another Tree | ||||||

Construct the Binary Tree from Postorder a… | ||||||

Check if a tree is a BST or BT | ||||||

Find K-th smallest element in BST | ||||||

Find LCA of two nodes in BST | ||||||

Implement Trie (Prefix Tree) | ||||||

Implement Trie – 2 (Prefix Tree) |

Frequently Asked Questions (FAQs)

Is blind 75 enough?

Yes, and No both. Confused? Well let us clarify, blind 75 is a list of just 75 questions designed in a way that it covers most of the concepts asked in any coding interview. However, what you need to understand is these questions alone will not help you be an excellent problem solver but these problems will give you a good head start and a direction to work in. However, most people get direct questions from the blind 75 list because it is designed in a way that it contains most frequently asked interview questions from different companies like Google, Amazon, Facebook etc but we highly recommend to solve more problems topic wise on leetcode after you complete this list.

Is this a language specific series?

Striver has made sure that the lectures are not language based, he teaches you the alogrithms. Post that
he writes the pseudocodes, which are language independent. Loops and data structures are similar in
every language, so you can always have the articles open on a parallel tab to check the code for C++,
Java, Python or Javascript.

What if the codes are not available in the language I code in?

Open bard/chatGPT, and paste our C++ or any language code, and ask him to convert it into language of
your choice, and he will do it for you.

How do I get my doubts resolved?

If you have any doubts, you can always open the youtube comments, and read through. Mostly all the
common doubts are there in the YouTube section. If you still have doubts, we will highly encourage you
to use technology, and open Bard/ChatGPT, and paste the code from our article, and ask them the doubt.
This works for most of the use cases. If you still have doubt, you can post on the youtube comments,
Striver usually replies if the community has not.

Do I need to pay anything?

As of today, every thing on takeUforward is free, however we will be happy if you give us a shoutout if
the content helps you. That will mean a world to us.