🌃
Limited Algorithm
search
⌘Ctrlk
🌃
Limited Algorithm
  • Summary
  • Hash & TreeMap
  • Queue &Stack & PQ
  • Hybrid Data Structure
    • Thought and Tools
    • Practice 6: Common Hybrid Data Structure Design
    • Advance 1: Find the Median from Data Stream/Sliding Window
    • Advance 2: Top K set 1 value
    • Advance 3: Top K set 2 freq
  • Graph
  • Graph Backtracking and Others
  • Tree
  • Pure Recursion & Backtracking
  • Dynamic Programming
  • Others
  • Array& LinkedList & String
  • Adavance Two Pointer
  • Advance Sliding Window
  • Advance Binary Search
  • Advance Young's Matrix
  • Java Knowledge
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Hybrid Data Structure

Thought and Toolschevron-rightPractice 6: Common Hybrid Data Structure Designchevron-rightAdvance 1: Find the Median from Data Stream/Sliding Windowchevron-rightAdvance 2: Top K set 1 valuechevron-rightAdvance 3: Top K set 2 freqchevron-right
PreviousProblem 4 Top K Frequent Words面试版本chevron-leftNextThought and Toolschevron-right

Last updated 2 years ago