Blind 75
Last Updated :
25 Nov, 2024
Improve
Blind 75 is a list of 75 coding interview questions that are commonly asked by top tech companies like Google, Amazon, Microsoft, Meta, etc. This list is designed to help candidates prepare for technical interviews by covering a range of important topics like Array, String, Linked List, Tree, Graph, Dynamic Programming, etc.
Array
- Two Sum
- Stock Buy and Sell – Max One Transaction Allowed
- Check if Array Contains Duplicates
- Product Array Puzzle
- Maximum Subarray Sum
- Maximum Product Subarray
- Minimum in Sorted and Rotated Array
- Search in Sorted and Rotated Array
- Find All Triplets With Given Sum
- Container With Most Water
Binary
- Sum of Two Numbers Without Using Arithmetic Operators
- Number of 1 Bits
- Counting Bits
- Missing in Array
- Reverse Bits
Dynamic Programming
- Climbing Stairs to Reach the Top
- Coin Change (Minimum Coins)
- Longest Increasing Subsequence
- Longest Common Subsequence
- Word Break
- Combination Sum
- Stickler Thief
- Stickler Thief II
- Total Decoding Messages
- Grid Unique Paths
- Jump Game
Graph
- Clone an Undirected Graph
- Course Schedule
- Pacific Atlantic Water Flow
- Number of Islands
- Longest Consecutive Subsequence
- Alien Dictionary
- Graph is Tree or Not
- Connected Components in an Undirected Graph
Interval
Linked List
- Reverse a Linked List
- Detect Loop in Linked List
- Merge Two Sorted Linked Lists
- Merge K Sorted Linked Lists
- Kth from End of Linked List
- Reorder List
Matrix
String
- Longest Distinct Characters in String
- Longest Repeating Character Replacement
- Smallest Window in a String Containing All the Characters of Another String
- Anagram
- Parenthesis Checker
- Palindrome Sentence
- Longest Palindromic Substring
- Palindromic Substrings
- Encode and Decode Strings
Tree
- Height of Binary Tree
- Identical Trees
- Mirror Tree
- Maximum Path Sum From Any Node
- Level Order Traversal
- Serialize and Deserialize a Binary Tree
- Check If Subtree
- Construct Tree from Inorder & Preorder
- Check for BST
- Kth Smallest Element in BST
- Lowest Common Ancestor in a BST
- Insert and Search in a Trie
- Add and Search Word
- Word Search II
Heap


