>

blind_75.md

Array

[x] Two Sum
[x] Best Time to Buy and Sell Stock
[x] Contains Duplicate
[x] Product of Array Except Self
[ ] 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

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

Tree

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

Heap

Original Blind 75 Post

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.