Tag: design
- All O`one Data Structure
- Apply Discount Every n Orders
- Binary Search Tree Iterator II
- Binary Search Tree Iterator
- Booking Concert Tickets in Groups
- Complete Binary Tree Inserter
- Count Integers in Intervals
- Data Stream as Disjoint Intervals
- Design a 3D Binary Matrix with Efficient Layer Tracking
- Design a File Sharing System
- Design a Food Rating System
- Design A Leaderboard
- Design a Number Container System
- Design a Stack With Increment Operation
- Design a Text Editor
- Design a Todo List
- Design Add and Search Words Data Structure
- Design an Array Statistics Tracker
- Design an ATM Machine
- Design an Expression Tree With Evaluate Function
- Design an Ordered Stream
- Design Authentication Manager
- Design Bitset
- Design Browser History
- Design Circular Deque
- Design Circular Queue
- Design Compressed String Iterator
- Design Excel Sum Formula
- Design File System
- Design Front Middle Back Queue
- Design Graph With Shortest Path Calculator
- Design HashMap
- Design HashSet
- Design Hit Counter
- Design In-Memory File System
- Design Linked List
- Design Log Storage System
- Design Memory Allocator
- Design Most Recently Used Queue
- Design Movie Rental System
- Design Neighbor Sum Service
- Design Parking System
- Design Phone Directory
- Design Search Autocomplete System
- Design Skiplist
- Design Snake Game
- Design Spreadsheet
- Design SQL
- Design Task Manager
- Design Tic-Tac-Toe
- Design Twitter
- Design Underground System
- Design Video Sharing Platform
- Detect Squares
- Dinner Plate Stacks
- Dot Product of Two Sparse Vectors
- Encode and Decode Strings
- Encode and Decode TinyURL
- Encode N-ary Tree to Binary Tree
- Encrypt and Decrypt Strings
- Exam Room
- Fancy Sequence
- Find Consecutive Integers from a Data Stream
- Find Elements in a Contaminated Binary Tree
- Find Median from Data Stream
- Finding MK Average
- Finding Pairs With a Certain Sum
- First Unique Number
- Flatten 2D Vector
- Flatten Nested List Iterator
- Frequency Tracker
- Implement Magic Dictionary
- Implement Queue using Stacks
- Implement Stack using Queues
- Implement Trie II (Prefix Tree)
- Implement Trie (Prefix Tree)
- Insert Delete GetRandom O(1) - Duplicates allowed
- Insert Delete GetRandom O(1)
- Iterator for Combination
- Kth Ancestor of a Tree Node
- Kth Largest Element in a Stream
- LFU Cache
- Logger Rate Limiter
- Longest Uploaded Prefix
- LRU Cache
- Map Sum Pairs
- Max Stack
- Maximum Frequency Stack
- Min Stack
- Moving Average from Data Stream
- My Calendar I
- My Calendar II
- My Calendar III
- Number of Recent Calls
- Online Election
- Online Majority Element In Subarray
- Online Stock Span
- Operations on Tree
- Peeking Iterator
- Prefix and Suffix Search
- Product of the Last K Numbers
- Range Frequency Queries
- Range Module
- Range Sum Query 2D - Immutable
- Range Sum Query 2D - Mutable
- Range Sum Query - Immutable
- Range Sum Query - Mutable
- RLE Iterator
- Seat Reservation Manager
- Sequentially Ordinal Rank Tracker
- Serialize and Deserialize Binary Tree
- Serialize and Deserialize BST
- Shortest Word Distance II
- Shuffle an Array
- Simple Bank System
- Smallest Number in Infinite Set
- Snapshot Array
- Stock Price Fluctuation
- Stream of Characters
- Subrectangle Queries
- Throne Inheritance
- Time Based Key-Value Store
- Tweet Counts Per Frequency
- Two Sum III - Data structure design
- Unique Word Abbreviation
- Walking Robot Simulation II
- Zigzag Iterator