The Blind 75 list is a curated list of 75 important coding questions designed to help software engineers prepare for coding interviews. The list was created by an ex-Meta Staff Engineer and has become very popular in the coding interview scene

What is the Blind 75 list?  The Blind 75 list is a compilation of 75 coding questions that are considered crucial for coding interviews. The list was curated by Yangshun Tay, who used it during his own job hunt to focus on the most important questions. The list was shared on Blind and LeetCode forums, where it gained popularity and was named "Blind 75"
Benefits of the Blind 75 list:
1. Focused Practice:  The list helps you focus on the most important questions, saving time and effort.
2. Variety of Problems: The list covers a wide range of topics and problem types, providing comprehensive interview preparation.
3. Preparation Schedule:  The list is spread across different data structures and algorithmic techniques, helping you manage your preparation time effectively
4. Real Interview Scenario:  You are advised to treat the practice like a real coding interview, which helps in building the right mindset and approach for actual interviews..
How it can help engineers prepare for their coding interviews:
1. Understanding Key Concepts: The list covers a variety of topics, helping engineers understand key concepts and algorithms.
2. Improving Problem-Solving Skills:  Regular practice with these questions can help improve problem-solving and coding skills.
3. Building Confidence:  By practicing with these important questions, engineers can build confidence for their coding interviews.
4. Performance Tracking:  The list can be used to track progress and identify areas that need more focus
Blind 75 Questions:
Here are the questions included in the Blind 75 list:

# Sequences

#### Solution

1. Two Sum
Easy
2. Contains Duplicate
Easy
3. Best Time to Buy and Sell Stock
Easy
4. Valid Anagram
Medium
5. Valid Parentheses
Medium
6. Maximum Subarray
Medium
7. Product of Array Except Self
Medium
8. 3Sum
Medium
9. Merge Intervals
Medium
10. Group Anagrams
Medium
11. Maximum Product Subarray
Medium
12. Search in Rotated Sorted Array
Medium

# Data structures

#### Solution

Easy
2. Detect Cycle in a Linked List
Easy
3. Container With Most Water
Medium
4. Find Minimum in Rotated Sorted Array
Medium
5. Longest Repeating Character Replacement
Medium
6. Longest Substring Without Repeating Characters
Medium
7. Number of Islands
Medium
8. Remove Nth Node From End Of List
Medium
9. Palindromic Substrings
Medium
10. Pacific Atlantic Water Flow
Medium
11. Minimum Window Substring
Medium

# Non-linear data structures

#### Solution

1. Invert/Flip Binary Tree
Easy
2. Validate Binary Search Tree
Medium
3. Non-overlapping Intervals
Medium
4. Construct Binary Tree from Preorder and Inorder Traversal
Medium
5. Top K Frequent Elements
Medium
6. Clone Graph
Medium
Medium
8. Serialize and Deserialize Binary Tree
Hard
9. Binary Tree Maximum Path Sum
Hard
10. Maximum Depth of Binary Tree
Easy
11. Same Tree
Easy
12. Binary Tree Level Order Traversal
Medium
13. Encode and Decode Strings
Medium

# More data structures

#### Solution

1. Subtree of Another Tree
Easy
2. Lowest Common Ancestor of BST
Medium
3. Implement Trie (Prefix Tree)
Medium
Medium
5. Kth Smallest Element in a BST
Medium
6. Merge K Sorted Lists
Hard
7. Find Median from Data Stream
Hard
8. Insert Interval
Medium
9. Longest Consecutive Sequence
Medium
10. Word Search II
Hard
11. Meeting Rooms
Easy
12. Meeting Rooms II
Medium
13. Graph Valid Tree
Medium
14. Number of Connected Components in an Undirected Graph
Medium
15. Alien Dictionary
Hard

# Dynamic programming

#### Solution

1. Climbing Stairs
Easy
2. Coin Change
Medium
3. Longest Increasing Subsequence
Medium
4. Combination Sum
Medium
5. House Robber
Medium
6. House Robber II
Medium