Blind-Curated-75

發表於 | 分類於 ， ，

Blind Curated 75 list

  • *647 Palindromic Substrings (Medium) *
    1. Longest Palindromic Substring
    2. Shortest Palindrome
  • *572 Subtree of Another Tree (Easy) v
  • *435 Non-overlapping Intervals (Medium) *
  • *424 Longest Repeating Character Replacement (Medium) x
  • *417 Pacific Atlantic Water Flow (Medium) x
  • 371 Sum of Two Integers (Medium) *
    1. Add Two Numbers
  • 347 Top K Frequent Elements (Medium) v *opt solution
    1. Kth Largest Element in an Array
    2. Top K Frequent Words
  • *338 Counting Bits (Easy) *
    1. Number of 1 Bits
  • 322 Coin Change (Medium) v

    *983. Minimum Cost For Tickets

  • *300 Longest Increasing Subsequence (Medium) *
  • *297 Serialize and Deserialize Binary Tree (Hard)
  • 295 Find Median from Data Stream (Hard)

    *480. Sliding Window Median

  • 268 Missing Number (Easy)
    1. Single Number
    2. Find the Duplicate Number

    *41. First Missing Positive
    645. Set Mismatch
    448. Find All Numbers Disappeared in an Array

  • 242 Valid Anagram (Easy)
    1. Group Anagrams
    2. Find All Anagrams in a String
  • 238 Product of Array Except Self (Medium)
    1. Trapping Rain Water
    2. Maximum Product Subarray
    1. Lowest Common Ancestor of a Binary Search Tree (Medium)
      1. Lowest Common Ancestor of a Binary Tree
  • 230 Kth Smallest Element in a BST (Medium)
    1. Binary Tree Inorder Traversal

    *671. Second Minimum Node In a Binary Tree

  • 226 Invert Binary Tree (Easy)
  • 217 Contains Duplicate (Easy)

    219 Contains Duplicate II
    220 Contains Duplicate III
    *220. Contains Duplicate III

  • 213 House Robber II (Medium)
    1. House Robber

    *337. House Robber III

  • *212 Word Search II (Hard)

    *980. Unique Paths III

  • *211 Design Add and Search Words Data Structure (Medium)
  • 208 Implement Trie (Prefix Tree) (Medium)

    *211 Design Add and Search Words Data Structure (Medium)
    *648. Replace Words
    *676. Implement Magic Dictionary

  • *207 Course Schedule (Medium)
  • 206 Reverse Linked List (Easy)
    1. Reverse Linked List II

    *234. Palindrome Linked List
    25. Reverse Nodes in k-Group
    2074. Reverse Nodes in Even Length Groups
    2130. Maximum Twin Sum of a Linked List

  • 200 Number of Islands (Medium)

    *130. Surrounded Regions
    695 Max Area of Island (Medium)
    1905 Count Sub Islands (Medium)

    1. Find All Groups of Farmland
      1254 Number of Closed Islands (Medium)
      1020 Number of Enclaves (Medium)
      733 Flood Fill (Easy)
  • 198 House Robber (Easy)
  • 191 Number of 1 Bits (Easy)
  • 190 Reverse Bits (Easy)
    1. Reverse Integer
    2. A Number After a Double Reversal
  • *153. Find Minimum in Rotated Sorted Array (Medium)
    1. Search in Rotated Sorted Array

    *154. Find Minimum in Rotated Sorted Array II

  • 152 Maximum Product Subarray (Medium)
    1. Maximum Subarray
    2. Product of Array Except Self
    3. Maximum Product of Three Numbers

    *713. Subarray Product Less Than K

  • 143 Reorder List (Medium)
    1. Delete the Middle Node of a Linked List
    2. Remove Nth Node From End of List
    3. Remove Linked List Elements
    4. Middle of the Linked List
    5. Swapping Nodes in a Linked List

    *24. Swap Nodes in Pairs

  • 141 Linked List Cycle (Easy)
    1. Linked List Cycle II
    2. Happy Number
  • *139 Word Break (Medium)

    *140. Word Break II

  • 133 Clone Graph (Medium)

    *138. Copy List with Random Pointer

  • *128 Longest Consecutive Sequence (Medium)
  • 125 Valid Palindrome
    1. Palindrome Linked List

    *680. Valid Palindrome II
    2108. Find First Palindromic String in the Array

  • *124 Binary Tree Maximum Path Sum (Hard)
    1. Path Sum
    2. Path Sum II
    3. Path Sum III
    4. Sum Root to Leaf Numbers

    *687. Longest Univalue Path

  • 121 Best Time to Buy and Sell Stock (Easy)
    1. Best Time to Buy and Sell Stock II

    *123. Best Time to Buy and Sell Stock III
    *188. Best Time to Buy and Sell Stock IV
    *309. Best Time to Buy and Sell Stock with Cooldown
    *714. Best Time to Buy and Sell Stock with Transaction Fee

  • 105 Construct Binary Tree from Preorder and Inorder Traversal
    1. Construct Binary Tree from Inorder and Postorder Traversal
  • 104 Maximum Depth of Binary Tree (Easy)

    *110. Balanced Binary Tree
    111 Minimum Depth of Binary Tree

    1. Maximum Depth of N-ary Tree
  • 102 Binary Tree Level Order Traversal (Medium)

    94 Binary Tree Inorder Traversal (Easy)
    144 Binary Tree Preorder Traversal (Easy)
    145 Binary Tree Postorder Traversal (Easy)
    107 Binary Tree Level Order Traversal II (Medium)
    103 Binary Tree Zigzag Level Order Traversal (Medium)
    965 Univalued Binary Tree (Easy)

    1. Average of Levels in Binary Tree
    2. N-ary Tree Level Order Traversal
    3. N-ary Tree Preorder Traversal
    4. N-ary Tree Postorder Traversal
    5. Cousins in Binary Tree
  • 100 Same Tree (Easy)
  • 98 Validate Binary Search Tree (Medium)

    450 Delete Node in a BST (Medium)
    701 Insert into a Binary Search Tree (Medium)
    700 Search in a Binary Search Tree (Easy)

    1. Binary Tree Inorder Traversal
    2. Find Mode in Binary Search Tree
  • *91 Decode Ways (Medium)
  • 79 Word Search (Medium)

    *212. Word Search II

  • 76 Minimum Window Substring (Hard)

    209 Minimum Size Subarray Sum

    1. Permutation in String

    *239 Sliding Window Maximum
    *30. Substring with Concatenation of All Words
    567 Permutation in String (Medium)

  • *73 Set Matrix Zeroes (Medium)
  • 70 Climbing Stairs (Easy)
    1. N-th Tribonacci Number
    2. Fibonacci Number
    3. Min Cost Climbing Stairs
  • 62 Unique Paths (Medium)
    1. Unique Paths II
    2. Minimum Path Sum
    3. Minimum Cost Homecoming of a Robot in a Grid
  • 57 Insert Interval (Medium)
  • 56 Merge Intervals (Medium)
    1. Interval List Intersections
  • 55 Jump Game (Medium)
    1. Jump Game II
  • 54 Spiral Matrix (Medium)
    1. Spiral Matrix II

    *885. Spiral Matrix III

  • 53 Maximum Subarray (Easy)
    1. Best Time to Buy and Sell Stock
    2. Maximum Product Subarray

    *697. Degree of an Array

  • 49 Group Anagrams (Medium)
    1. Valid Anagram
  • 48 Rotate Image (Medium)
    1. Determine Whether Matrix Can Be Obtained By Rotation
    2. Degree of an Array
  • 39 Combination Sum (Medium)
    1. Combination Sum II
    2. Combination Sum III
    3. Letter Combinations of a Phone Number
    4. Combinations
  • 33 Search in Rotated Sorted Array (Medium)

    *81. Search in Rotated Sorted Array II
    *153. Find Minimum in Rotated Sorted Array
    *154. Find Minimum in Rotated Sorted Array II

  • 23 Merge k Sorted Lists (Hard)
    1. Merge Two Sorted Lists

    *264. Ugly Number II

  • 21 Merge Two Sorted Lists (Medium)
  • 20 Valid Parentheses (Easy)
    1. Generate Parentheses

    *32. Longest Valid Parentheses

  • 19 Remove Nth Node From End of List (Medium)
    1. Delete the Middle Node of a Linked List
    2. Swapping Nodes in a Linked List
  • 15 3Sum (Medium)
    1. 3Sum Closest
    2. 4Sum
  • 11 Container With Most Water (Medium)
    1. Trapping Rain Water
  • 5 Longest Palindromic Substring (Medium)
    1. Longest Palindromic Subsequence

    *214. Shortest Palindrome
    *336. Palindrome Pairs
    647. Palindromic Substrings

  • 3 Longest Substring Without Repeating Characters (Medium)

    *1695. Maximum Erasure Value
    *992. Subarrays with K Different Integers

  • 1 Two Sum (Easy)
    1. Two Sum II - Input Array Is Sorted

    *653. Two Sum IV - Input is a BST
    560. Subarray Sum Equals K
    2006. Count Number of Pairs With Absolute Difference K