OJ
Ctrlk
  • 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
Powered by GitBook
On this page

Was this helpful?

Design

Peeking IteratorInsert Delete GetRandom O(1)Flatten 2D Vector
Previous1665. Minimum Initial Energy to Finish TasksNextPeeking Iterator

Last updated 6 years ago

Was this helpful?