SUMMARY.md

Table of contents

• Intro

• Data Structure

  • Array
    • 228. Summary Ranges
    • 1464. Maximum Product of Two Elements in an Array
  • String
    • 392. Is Subsequence
    • 408. Valid Word Abbreviation
    • 680. Valid Palindrome II
    • 2185. Counting Words With a Given Prefix
  • Hash Table
    • 246. Strobogrammatic Number
    • 1347. Minimum Number of Steps to Make Two Strings Anagram
    • 1570. Dot Product of Two Sparse Vectors
    • 2186. Minimum Number of Steps to Make Two Strings Anagram II
  • Queue
    • 346. Moving Average from Data Stream
  • Heap(Priority Queue)
    • 215. Kth Largest Element in an Array
    • 973. K Closest Points to Origin
  • Stack
    • 71. Simplify Path
    • 921. Minimum Add to Make Parentheses Valid
    • 1047. Remove All Adjacent Duplicates In String
    • 1249. Minimum Remove to Make Valid Parentheses
    • 1762. Buildings With an Ocean View

• Linked List

  • 2. Add Two Numbers
  • 19. Remove Nth Node From End of List
  • 21. Merge Two Sorted Lists
  • 23. Merge k Sorted Lists
  • 25. Reverse Nodes in k-Group (Recursion)
  • 61. Rotate List
  • 82. Remove Duplicates from Sorted List II
  • 92. Reverse Linked List II
  • 138. Copy List with Random Pointer
  • 141. Linked List Cycle
  • 142. Linked List Cycle II
  • 146. LRU Cache
  • 203. Remove Linked List Elements
  • 328. Odd Even Linked List

• Binary Tree

  • 94. Binary Tree Inorder Traversal
  • 98. Validate Binary Search Tree
  • 100. Same Tree
  • 101. Symmetric Tree
  • 102. Binary Tree Level Order Traversal
  • 104. Maximum Depth of Binary Tree
  • 111. Minimum Depth of Binary Tree
  • 108. Convert Sorted Array to Binary Search Tree
  • 110. Balanced Binary Tree
  • 112. Path Sum
  • 114. Flatten Binary Tree to Linked List
  • 116. Populating Next Right Pointers in Each Node
  • 129. Sum Root to Leaf Numbers
  • 144. Binary Tree Preorder Traversal
  • 145. Binary Tree Postorder Traversal
  • 173. Binary Search Tree Iterator
  • 199. Binary Tree Right Side View
  • 230. Kth Smallest Element in a BST
  • 235. Lowest Common Ancestor of a Binary Search Tree
  • 236. Lowest Common Ancestor of a Binary Tree
  • 257. Binary Tree Paths
  • 314. Binary Tree Vertical Order Traversal
  • 366. Find Leaves of Binary Tree
  • 426. Convert Binary Search Tree to Sorted Doubly Linked List
  • 437. Path Sum III
  • 450. Delete Node in a BST
  • 543. Diameter of Binary Tree
  • 545. Boundary of Binary Tree
  • 572. Subtree of Another Tree
  • 617. Merge Two Binary Trees
  • 938. Range Sum of BST
  • 965. Univalued Binary Tree
  • 1110. Delete Nodes And Return Forest
  • 1161. Maximum Level Sum of a Binary Tree
  • 1367. Linked List in Binary Tree
  • 1382. Balance a Binary Search Tree
  • 1448. Count Good Nodes in Binary Tree
  • 1469. Find All The Lonely Nodes
  • 1644. Lowest Common Ancestor of a Binary Tree II
  • 1650. Lowest Common Ancestor of a Binary Tree III

• Sliding Window

  • 3. Longest Substring Without Repeating Characters
  • 76. Minimum Window Substring
  • 159. Longest Substring with At Most Two Distinct Characters
  • 219. Contains Duplicate II
  • 239. Sliding Window Maximum
  • 340. Longest Substring with At Most K Distinct Characters
  • 424. Longest Repeating Character Replacement
  • 438. Find All Anagrams in a String
  • 487. Max Consecutive Ones II
  • 560. Subarray Sum Equals K
  • 992. Subarrays with K Different Integers
  • 1004. Max Consecutive Ones III
  • 1100. Find K-Length Substrings With No Repeated Characters
  • 1151. Minimum Swaps to Group All 1's Together
  • 1248. Count Number of Nice Subarrays
  • 1423. Maximum Points You Can Obtain from Cards
  • 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

• Binary Search

  • 162. Find Peak Element
  • 528. Random Pick with Weight
  • 1064. Fixed Point
  • 2187. Minimum Time to Complete Trips

• Uncategorized

  • 339. Nested List Weight Sum

• Summary