Neetcode: Blind 75

Notes

Terms and Variable names

• dp: Stands for dynamic programming table or dynamic programming array which is used to store solutions to subproblems, preventing redundant computations and enabling the efficiency of the overall solution.
  • for ease of readabiity, I've renamed many of these to dp_table.

Questions

1. Arrays & Hashing
   • Contains Duplicate
   • Valid Anagram
   • Two Sum
   • Group Anagrams
   • Top K Frequent Elements
   • Encode and Decode Strings
   • Product of Array Except Self
   • Longest Consecutive Sequence
2. Two Pointers
   • Valid Palindrome
   • 3 Sum
   • Container with Most Water
3. Sliding Window
   • Best Time to Buy and Sell Stock
   • Longest Substring Without Repeating Characters
   • Longest Repeating Character Replacement
   • Minimum Window Substring
4. Stack
   • Valid Parentheses
5. Binary Search
   • Find Minimum In Rotated Sorted Array
   • Search In Rotated Sorted Array
6. Linked List
   • Reverse Linked List
   • Merge Two Sorted Lists
   • Linked List Cycle
   • Reorder List
   • Remove Nth Node From End of List
   • Merge K Sorted Lists
7. Trees
   • Invert Binary Tree
   • Maximum Depth of Binary Tree
   • Same Tree
   • Subtree of Another Tree
   • Lowest Common Ancestor of a Binary Search Tree
   • Binary Tree Level Order Traversal
   • Validate Binary Search Tree
   • Kth Smallest Element in a BST
   • Construct Binary Tree from Preorder and Inorder Traversal
   • Binary Tree Maximum Path Sum
   • Serialize and Deserialize Binary Tree
8. Heap / Priority Queue
   • Find Median From Data Stream
9. Backtracking
   • Combination Sum
   • Word Search
10. Tries
    • Implement Trie Prefix Tree
    • Design Add and Search Words Data Structure
    • Word Search II
11. Graphs
    • Number of Islands
    • Clone Graph
    • Pacific Atlantic Water Flow
    • Course Schedule
    • Graph Valid Tree
    • Number of Connected Components in an Undirected Graph
12. Advanced Graphs
    • Alien Dictionary
13. 1-D Dynamic Programming
    • Climbing Stairs
    • House Robber
    • House Robber II
    • Longest Palindromic Substring
    • Palindromic Substrings
    • Decode Ways
    • Coin Change
    • Maximum Product Subarray
    • Word Break
    • Longest Increasing Subsequence
14. 2-D Dynamic Programming
    • Unique Paths
    • Longest Common Subsequence
15. Greedy
    • Maximum Subarray
    • Jump Game
16. Intervals
    • Insert Interval
    • Merge Intervals
    • Non Overlapping Intervals
    • Meeting Rooms
    • Meeting Rooms II
17. Math and Geometry
    • Rotate Image
    • Spiral Matrix
    • Set Matrix Zones
18. Bit Manipulation
    • Number of 1 Bits
    • Counting Bits
    • Reverse Bits
    • Missing Number
    • Sum of Two Integers