Practice of Algorithm Problems
Ctrlk
  • Main
  • Array
  • Binary Search
  • Stack
  • Heap
  • Bit Manipulation
  • Greedy
  • String
  • Dynamic Programming
  • Tree
  • Linked List
  • Graph
  • Backtracking
  • Depth-First-Search & Breadth-First-Search
  • Math
  • Design
    • 146. LRU Cache
    • 155. Min Stack
    • 170. Two Sum III - Data structure design
    • 173. Binary Search Tree Iterator
    • 208. Implement Trie (Prefix Tree)
    • 211. Add and Search Word - Data structure design
    • 225. Implement Stack using Queues
    • 232. Implement Queue using Stacks
    • 251. Flatten 2D Vector
    • 281. Zigzag Iterator
    • 284. Peeking Iterator
    • 328. Random Pick Index
    • 341. Flatten Nested List Iterator
    • 346. Moving Average from Data Stream
    • 348. Design Tic-Tac-Toe
    • 352. Data Stream as Disjoint Intervals
    • 359. Logger Rate Limiter
    • 362. Design Hit Counter
    • 380. Insert Delete GetRandom O(1)
    • 381. Insert Delete GetRandom O(1) - Duplicates allowed
    • 384. Shuffle an Array
    • 398. Random Pick Index
    • 432. All O`one Data Structure
    • 460. LFU Cache
    • 528. Random Pick with Weight
    • 535. Encode and Decode TinyURL
    • 588. Design In-Memory File System
    • 604. Design Compressed String Iterator
    • 622. Design Circular Queue
    • 635. Design Log Storage System
    • 642. Design Search Autocomplete System
    • 705. Design HashSet
    • 706. Design HashMap
    • 707. Design Linked List
    • 716. Max Stack
    • 981. Time Based Key-Value Store
    • 1032. Stream of Characters
    • 1146. Snapshot Array
  • Old Interview Questions
Powered by GitBook
On this page

Was this helpful?

Design

146. LRU Cache155. Min Stack170. Two Sum III - Data structure design173. Binary Search Tree Iterator208. Implement Trie (Prefix Tree)211. Add and Search Word - Data structure design225. Implement Stack using Queues232. Implement Queue using Stacks251. Flatten 2D Vector281. Zigzag Iterator284. Peeking Iterator328. Random Pick Index341. Flatten Nested List Iterator346. Moving Average from Data Stream348. Design Tic-Tac-Toe352. Data Stream as Disjoint Intervals359. Logger Rate Limiter362. Design Hit Counter380. Insert Delete GetRandom O(1)381. Insert Delete GetRandom O(1) - Duplicates allowed384. Shuffle an Array398. Random Pick Index432. All O`one Data Structure460. LFU Cache528. Random Pick with Weight535. Encode and Decode TinyURL588. Design In-Memory File System604. Design Compressed String Iterator622. Design Circular Queue635. Design Log Storage System642. Design Search Autocomplete System705. Design HashSet706. Design HashMap707. Design Linked List716. Max Stack981. Time Based Key-Value Store1032. Stream of Characters1146. Snapshot Array
Previous1250. Check If It Is a Good ArrayNext146. LRU Cache

Last updated 6 years ago

Was this helpful?