Charry's Tech Notes

Appearance

  1. Binary Search:

      1. Find Peak Element
      1. Random Pick with Weight
      1. Find K Closest Elements

  2. Sliding Window:

      1. Max Consecutive Ones III
      1. Substring with Concatenation of All Words
      1. Minimum Window Substring

  3. Tree or Graph Traversals:

      1. Binary Tree Vertical Order Traversal
      1. Range Sum of BST
      1. Sum Root to Leaf Numbers
      1. Lowest Common Ancestor of a Binary Tree
      1. Populating Next Right Pointers in Each Node II
      1. Populating Next Right Pointers in Each Node II
      1. Diameter of Binary Tree
      1. Clone Graph

  4. Dynamic Programming:

      1. Find Median from Data Stream
      1. Generate Parentheses
      1. Combination Sum
      1. K Inverse Pairs Array
      1. Minimum Window Subsequence

  5. Array Manipulation:

      1. Shuffle an Array
      1. Find Median from Data Stream
      1. Kth Largest Element in an Array
      1. Valid Palindrome II
      1. Merge Sorted Array
      1. Random Pick Index
      1. Maximum Swap
      1. Merge Intervals

  6. String Manipulation:

      1. Minimum Remove to Make Valid Parentheses
      1. Valid Word Abbreviation
      1. Word Break II
      1. Simplify Path
      1. Remove All Adjacent Duplicates In String
      1. Group Shifted Strings
      1. Custom Sort String

  7. Hashing and Counting:

      1. Subarray Sum Equals K
      1. Contiguous Array
      1. Buildings With an Ocean View
      1. Toeplitz Matrix

  8. Mathematics and Simulation:

      1. Pow(x, n)
      1. Maximum Swap
      1. Toeplitz Matrix
      1. Diagonal Traverse

  9. Heap and Priority Queue:

      1. Find Median from Data Stream
      1. K Closest Points to Origin
      1. K Closest Points to Origin (alternative approach using quick select)

  10. Backtracking:

    1. Word Search
    1. Generate Parentheses
    1. Combination Sum
  1. Graph Theory:
    1. Word Ladder
    1. Clone Graph
    1. Course Schedule
  1. Design:
    1. Find Median from Data Stream
    1. Moving Average from Data Stream
    1. Basic Calculator II
  1. Sparse Data Structures:
    1. Dot Product of Two Sparse Vectors
  1. Miscellaneous/Other Techniques:
    1. Clone Graph (deep copy using a hash map)
    1. Alien Dictionary (topological sort using Kahn's algorithm)
    1. Shortest Distance from All Buildings (multi-source BFS)

This categorization will help you to understand and retrieve solutions based on their underlying techniques and data structure utilization efficiently.