OJ
search
⌘Ctrlk
OJ
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
  • Bit Manipulation
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
    • Peeking Iterator
    • Insert Delete GetRandom O(1)
    • Flatten 2D Vector
  • Queue
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Design

Peeking Iteratorchevron-rightInsert Delete GetRandom O(1)chevron-rightFlatten 2D Vectorchevron-right
Previous1665. Minimum Initial Energy to Finish Taskschevron-leftNextPeeking Iteratorchevron-right

Last updated 6 years ago