NeetCode Blind 75

Blind 75 is a popular list of algorithm practice problems. This list is from neetcodeio

Arrays & Hashing (8)

• Contains Duplicate ✓ • Valid Anagram ✓ • Two Sum ✓ • Group Anagrams ✓ • Top K Frequent Elements ✓
• Product of Array Except Self ✓ • Encode and Decode Strings • Longest Consecutive Sequence ✓

Two Pointers (3)

• Valid Palindrome ✓ • Three Sum ✓ • Container With Most Water ✓

Sliding Window (4)

• Best Time to Buy And Sell Stock ✓ • Longest Substring Without Repeating Characters ✓
• Longest Repeating Character Replacement ✓ • Minimum Window Substring ✓

Stack (1)

• Valid Parentheses ✓

Binary Search (2)

• Find Minimum In Rotated Sorted Array ✓
• Search in Rotated Sorted Array

Linked List (6)

• Reverse Linked List ✓ • Merge Two Sorted Lists ✓ • Reorder List
• Remove Nth Node From End of List ✓ • Linked List Cycle ✓ • Merge k Sorted Lists

Trees (11)

• Invert Binary Tree • Maximum Depth of Binary Tree • Same Tree • Subtree of Another Tree
• Lowest Common Ancestor of a Binary Search Tree • Validate Binary Search Tree
• Construct Binary Tree from Preorder and Inorder Traversal
• Binary Tree Level Order Traversal • Kth Smallest Element in a BST
• Binary Tree Maximum Path Sum • Serialize And Deserialize Binary Tree

Tries (3)

• Implement Trie (Prefix Tree) ✓
• Word Search II
• Design Add and Search Words Data Structure

Heap / Priority Queue (1)

• Find Median from Data Stream

Backtracking (2)

• Combination Sum ✓
• Word Search ✓

Graphs (6)

• Number of Islands ✓ • Pacific Atlantic Water Flow
• Clone Graph • Course Schedule ✓
• Number of Connected Components In An Undirected Graph • Graph Valid Tree

Advanced Graphs (1)

• Alien Dictionary

One Dimensional Dynamic Programming (10)

• Climbing Stairs ✓ • House Robber ✓ • House Robber II ✓ • Decode Ways ✓ • Palindromic Substrings ✓
• Longest Palindromic Substring ✓ • Coin Change ✓
• Word Break ✓ • Maximum Product Subarray • Longest Increasing Subsequence ✓

Two Dimensional Dynamic Programming (2)

• Unique Paths ✓
• Longest Common Subsequence

Greedy (2)

• Maximum Subarray ✓
• Jump Game ✓

Intervals (5)

• Insert Interval • Merge Intervals • Non-overlapping Intervals
• Meeting Rooms • Meeting Rooms II

Math & Geometry (3)

• Rotate Image ✓ • Spiral Matrix • Set Matrix Zeroes ✓

Bit Manipulation (5)

• Number of 1 Bits ✓ • Counting Bits ✓
• Reverse Bits ✓
• Missing Number ✓
• Sum of Two Integers ✓