Reference: Neetcode

🐮: Must Read ❤️: Love the question 🌟: Importance 🧠: Brain Storm

Wenqing's LeetcodeSolution

• Useful Link
• Python_Syntax
• Tech
• [Hashset]
• [Floyd's Cycle Detection]
• [Divide and Conquer]
• [Recursion]
• [Bit Manipulation]

Leetcode Topic

• 1-D Dynamic Programming

  • Overview
  • 🐮🌟🌟Easy-70-Climbing-Stairs
  • 🧠🌟🌟Easy-746-Min-Cost-Climbing-Stairs
  • 🌟🌟Medium-198-House-Robber
  • 🧠🌟Easy-121-Best-Time-to-Buy-and-Sell-Stock
  • 🧠🌟Medium-213-House-Robber-II
  • 🧠🌟🌟Medium-322-Coin-Change
  • 🌟🌟Medium-91-Decode-Ways
  • 🧠🌟Medium-139-Word-Break
  • 🧠🌟Medium-152-Maximum-Product-Subarray
  • 🧠🌟Medium-300-Longest-Increasing-Subsequence

• Tree

  • Overview
  • 🧠🧠🌟🌟🌟Medium-1448-Count-Good-Nodes-in-Binary-Tree
  • 🧠🌟🌟Medium-98-Validate-Binary-Search-Tree
  • 🧠🧠🧠🌟Medium-230-Kth-Smallest-Element-in-a-BST
  • 🧠🌟🌟Easy-543-Diameter-of-Binary-Tree
  • 🧠🌟🌟Easy-110-Balanced-Binary-Tree
  • 🌟Easy-572-Subtree-of-Another-Tree
  • 🧠Medium-235-Lowest-Common-Ancestor-of-a-Binary-Search-Tree
  • 🌟🌟Medium-199-Binary-Tree-Right-Side-View
  • 🧠🧠Medium-105-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal
  • Medium-102-Binary-Tree-Level-Order-Traversal
  • Easy-226-Invert-Binary-Tree
  • Easy-104-Maximum-Depth-of-Binary-Tree
  • Easy-100-Same-Tree
  • Medium-130-Surrounded-Regions
  • Medium-261-Graph-Valid-Tree

• Graph

  • Overview
  • ❤️🧠🌟🌟🌟Medium-286-Walls-and-Gates
  • 🌟🌟🌟Medium-695-Max-Area-of-Island
  • 🌟🌟Medium-200-Number-of-Islands
  • 🧠🌟Medium-133-Clone-Graph
  • 🧠Medium-261-Graph-Valid-Tree
  • 🌟Medium-417-Pacific-Atlantic-Water-Flow
  • 🧠🧠🌟🌟Medium-207-Course-Schedule
  • 🌟🌟Medium-994-Rotting-Oranges

• Linked List

  • Overview
  • 🧠🧠🧠🌟🌟🌟Medium-287-Find-the-Duplicate-Number
  • 🧠🧠Medium-19-Remove-Nth-Node-From-End-of-List
  • 🧠Medium-138-Copy-List-with-Random-Pointer
  • 🧠🧠🌟🌟Medium-143-Reorder-List
  • 🧠🧠🧠🌟🌟Hard-25-Reverse-Nodes-in-k-Group
  • 🌟🌟🌟Medium-146-LRU-Cache
  • Easy-206-Reverse-Linked-List
  • Easy-21-Merge-Two-Sorted-Lists
  • Medium-2-Add-Two-Numbers
  • Easy-141-Linked-List-Cycle
  • Hard-23-Merge-k-Sorted-Lists

• Stack

  • Overview
  • ❤️❤️❤️🧠🧠🌟🌟🌟Medium-22-Generate-Parentheses
  • Easy-20-Valid-Parentheses
  • 🧠🌟Medium-155-Min-Stack
  • 🧠🌟🌟Medium-739-Daily-Temperatures
  • 🧠🌟🌟Medium-853-Car-Fleet
  • 🧠Medium-150-Evaluate-Reverse-Polish-Notation

• Binary Search

  • Overview
  • 🌟🌟🌟Easy-704-Binary-Search
  • 🧠🌟Medium-875-Koko-Eating-Bananas
  • 🧠🧠🌟Medium-153-Find-Minimum-in-Rotated-Sorted-Array
  • 🧠🧠🧠🤷Medium-33-Search-in-Rotated-Sorted-Array
  • 🤷Medium-981-Time-Based-Key-Value-Store
  • Medium-74-Search-a-2D-Matrix

• Backtracking

  • Overview
  • ❤️🧠🌟🌟🌟Medium-79-Word-Search
  • 🧠🧠🧠🌟Medium-131-Palindrome-Partitioning
  • 🌟🌟🌟Medium-90-Subsets-II
  • 🌟🌟Medium-39-Combination-Sum
  • 🧠🧠Medium-46-Permutations
  • Medium-78-Subsets
  • Medium-40-Combination-Sum-II

• Heap/Priority Queue

  • Overview
  • 🧠🌟🌟🌟Medium-355-Design-Twitter
  • 🧠🧠🌟🌟Medium-621-Task-Scheduler
  • 🌟🌟Easy-703-Kth-Largest-Element-in-a-Stream
  • Medium-215-Kth-Largest-Element-in-an-Array
  • Easy-1046-Last-Stone-Weight
  • Medium-973-K-Closest-Points-to-Origin

• Sliding Window

  • Overview
  • 🌟🧠Hard-239-Sliding-Window-Maximum
  • 🌟🧠Medium-567-Permutation-in-String
  • 🌟🌟🧠🧠Medium-424-Longest-Repeating-Character-Replacement
  • 🌟🌟Medium-3-Longest-Substring-Without-Repeating-Characters
  • 🌟🧠Hard-76-Minimum-Window-Substring
  • 🌟🧠Easy-121-Best-Time-to-Buy-and-Sell-Stock

• Two Pointers

  • Overview
  • 🧠🧠Medium-5-Longest-Palindromic-Substring
  • 🧠🧠Medium-647-Palindromic-Substrings
  • 🌟🧠🧠Hard-42-Trapping-Rain-Water
  • 🌟Medium-15-3Sum
  • 🌟Easy-125-Valid-Palindrome
  • Medium-167-Two-Sum-II-Input-Array-Is-Sorted
  • Medium-11-Container-With-Most-Water

• Arrays&Hashing

  • Overview
  • 🌟🌟Medium-347-Top-K-Frequent-Elements
  • Medium-36-Valid-Sudoku
  • 🧠Medium-271-Encode-And-Decode-Strings
  • 🌟🌟🧠Medium-238-Product-of-Array-Except-Self
  • 🌟🧠Medium-128-Longest-Consecutive-Sequence
  • 🌟Easy-242-Valid-Anagram
  • Easy-1929-Concatenation-of-Array
  • 🌟Easy-1-Two-Sum
  • 🌟🌟Medium-49-Group-Anagrams
  • Easy-217-Contains-Duplicate

• Tries

  • Overview
  • 🌟🌟Medium-208-Implement-Trie (Prefix Tree)
  • 🧠🧠🌟🌟Medium-211-Design-Add-and-Search-Words-Data-Structure

• 2-D Dynamic Programming

  • Overview
  • 🧠🌟Medium-714-Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee

• SQL

  • Overview

Star Problem

• 🌟🌟submatrix sum
• Sort an array
• 714 Best Time to Buy and Sell Stock with Transaction Fee
• Medium-316-Remove-Duplicate-Letters
• Medium-663-Equal-Tree-Partition