🌃
Limited Algorithm
search
⌘Ctrlk
🌃
Limited Algorithm
  • Summary
  • Hash & TreeMap
  • Queue &Stack & PQ
  • Hybrid Data Structure
    • Thought and Tools
      • Tool: Quick Select
      • Why DLL?
      • Handle update/remove value more efficient
      • Swap- Swap
      • Handling Randomness & Cache
    • 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
  1. Hybrid Data Structure

Thought and Tools

Tool: Quick Selectchevron-rightWhy DLL?chevron-rightHandle update/remove value more efficientchevron-rightSwap- Swapchevron-rightHandling Randomness & Cachechevron-right
PreviousHybrid Data Structurechevron-leftNextTool: Quick Selectchevron-right

Last updated 2 years ago