My Practice
Ctrlk
  • Introduction
  • Chapter 1 Combination and Permutation
  • Chapter 2 Binary Search & Sorted Array
  • Chapter 3 Binary Tree
  • Chapter 4 DFS & BFS
  • Chapter 5 Linked List
  • Chapter 6 Dynamic Programming
  • Chapter 7 Graph & Search
  • Chapter 8 Data Structure
    • Stack & Queue
    • Hash
    • Heap
    • Trie
    • Problem 341: Flatten Nested List Iterator
    • Problem 281: Zigzag Iterator
    • Problem 346: Moving Average from Data Stream
    • Problem 380: Insert Delete GetRandom O(1)
  • Chapter 9 High Frequency
  • Post Chapter 1 String
  • Post Chapter 2 Math
  • Post Chapter 3 Array
  • Facebook
  • Amazon
  • All Chapters Summary
  • Core Java Interview Questions
  • Basics of Sorting
  • Behavior Questions
Powered by GitBook
On this page

Was this helpful?

Chapter 8 Data Structure

Stack & QueueHashHeapTrieProblem 341: Flatten Nested List IteratorProblem 281: Zigzag IteratorProblem 346: Moving Average from Data StreamProblem 380: Insert Delete GetRandom O(1)
PreviousChapter 7 Graph & SearchNextStack & Queue

Last updated 6 years ago

Was this helpful?