>

blind_75.md

Array

[x] Two Sum
[x] Best Time to Buy and Sell Stock
[x] Contains Duplicate
[x] Product of Array Except Self
[x] Maximum Subarray
[ ] Maximum Product Subarray
[ ] Find Minimum in Rotated Sorted Array
[ ] Search in Rotated Sorted Array
[ ] 3Sum
[ ] Container With Most Water

Binary

Dynamic Programming

Graph

[ ] Clone Graph
[ ] Course Schedule
[ ] Pacific Atlantic Water Flow
[ ] Number of Islands
[ ] Longest Consecutive Sequence
[ ] Alien Dictionary
[ ] Graph Valid Tree
[ ] Number of Connected Components in an Undirected Graph

Interval

Linked List

Matrix

String

[x] Longest Substring Without Repeating Characters
[x] Longest Repeating Character Replacement
[x] Minimum Window Substring
[x] Valid Anagram
[ ] Group Anagrams
[x] Valid Parentheses
[x] Valid Palindrome
[x] Longest Palindromic Substring
[x] Palindromic Substrings
[ ] Encode and Decode Strings

Tree

[x] Maximum Depth of Binary Tree
[x] Same Tree
[x] Invert Binary Tree
[x] Binary Tree Maximum Path Sum
[x] Binary Tree Level Order Traversal
[x] Serialize and Deserialize Binary Tree
[x] Subtree of Another Tree
[x] Construct Binary Tree from Preorder and Inorder Traversal
[x] Validate Binary Search Tree
[x] Kth Smallest Element in a BST
[x] Lowest Common Ancestor of a Binary Search Tree
[ ] Implement Trie (Prefix Tree)
[ ] Design Add and Search Words Data Structure
[ ] Word Search II

Heap

grind.rip

From Grind Hell, with Love

The "Blind 75" is a curated list of the 75 most essential coding interview questions. The list is designed to cover a broad range of topics and question types that are commonly encountered in technical interviews at major tech companies.