Design

146. LRU Cachechevron-right155. Min Stackchevron-right170. Two Sum III - Data structure designchevron-right173. Binary Search Tree Iteratorchevron-right208. Implement Trie (Prefix Tree)chevron-right211. Add and Search Word - Data structure designchevron-right225. Implement Stack using Queueschevron-right232. Implement Queue using Stackschevron-right251. Flatten 2D Vectorchevron-right281. Zigzag Iteratorchevron-right284. Peeking Iteratorchevron-right328. Random Pick Indexchevron-right341. Flatten Nested List Iteratorchevron-right346. Moving Average from Data Streamchevron-right348. Design Tic-Tac-Toechevron-right352. Data Stream as Disjoint Intervalschevron-right359. Logger Rate Limiterchevron-right362. Design Hit Counterchevron-right380. Insert Delete GetRandom O(1)chevron-right381. Insert Delete GetRandom O(1) - Duplicates allowedchevron-right384. Shuffle an Arraychevron-right398. Random Pick Indexchevron-right432. All O`one Data Structurechevron-right460. LFU Cachechevron-right528. Random Pick with Weightchevron-right535. Encode and Decode TinyURLchevron-right588. Design In-Memory File Systemchevron-right604. Design Compressed String Iteratorchevron-right622. Design Circular Queuechevron-right635. Design Log Storage Systemchevron-right642. Design Search Autocomplete Systemchevron-right705. Design HashSetchevron-right706. Design HashMapchevron-right707. Design Linked Listchevron-right716. Max Stackchevron-right981. Time Based Key-Value Storechevron-right1032. Stream of Characterschevron-right1146. Snapshot Arraychevron-right

Last updated