Review: Object-Oriented Design Problems Posted on January 23, 2018July 26, 2020 by braindenny Object-Oriented Design Problems CheatSheet: Leetcode For Code Interview CheatSheet: Common Code Problems & Follow-ups Num Problem Example 1 Max Stack LeetCode: Max Stack 2 Stack supports getMiddle and deleteMiddle 3 Cache LeetCode: LRU Cache, LeetCode: LFU Cache, LeetCode: All O`one Data Structure 4 Throttling LeetCode: Design Hit Counter, LeetCode: Logger Rate Limiter 5 Design Log Storage System LeetCode: Design Log Storage System 6 Linked List with random access LeetCode: Design Linked List 7 Design HashMap LeetCode: Design HashMap 8 Circular Queue LeetCode: Design Circular Queue, LeetCode: Design Circular Deque 9 Trie tree LeetCode: Implement Trie (Prefix Tree), LeetCode: Add and Search Word 10 Get Median LeetCode: Find Median from Data Stream 11 Range Sum Query LeetCode: Range Sum Query – Mutable, LeetCode: Range Sum Query – Immutable 12 Design File System LeetCode: Design File System 13 Tree Iterator LeetCode: Binary Search Tree Iterator 14 String Iterator LeetCode: Design Compressed String Iterator 15 ZigZag Iterator LeetCode: Zigzag Iterator 16 Insert Delete GetRandom O(1) LeetCode: Insert Delete GetRandom O(1) 17 Insert Delete GetRandom O(1) II LeetCode: Insert Delete GetRandom O(1) – Duplicates allowed 18 Random Pick with Blacklist LeetCode: Random Pick with Blacklist See all oodesign problems: #oodesign LeetCode: Design Excel Sum FormulaLeetCode: Design In-Memory File SystemLeetCode: Design File SystemLeetCode: Design A LeaderboardLeetCode: Design Log Storage SystemLeetCode: LFU CacheLintCode: Student LevelLintCode: Student IDLeetCode: Encode and Decode StringsLeetCode: Design Circular DequeLeetCode: Design Circular QueueLeetCode: Design HashMapLeetCode: Design HashSetLeetCode: Design Linked ListLeetCode: Random Pick with BlacklistLeetCode: Design Tic-Tac-ToeLeetCode: Find Median from Data StreamLeetCode: Shuffle an ArrayLeetCode: Design Search Autocomplete SystemLeetCode: Design Snake GameLeetCode: Design TwitterLeetCode: Encode and Decode TinyURLLeetCode: Flatten 2D VectorLeetCode: Shortest Word Distance IILeetCode: Design Phone DirectoryLeetCode: Max StackLeetCode: Design Hit CounterLeetCode: Design Compressed String IteratorLeetCode: Logger Rate LimiterLeetCode: Moving Average from Data StreamLeetCode: Two Sum III – Data structure designLintCode: Implement Queue by Circular ArrayLeetCode: All O`one Data StructureReview: Object-Oriented Design ProblemsLeetCode: Flatten Nested List IteratorLeetCode: Add and Search Word – Data structure designLeetCode: Implement Magic DictionaryLeetCode: Implement Trie (Prefix Tree)LeetCode: Range Sum Query 2D – ImmutableLeetCode: Insert Delete GetRandom O(1) – Duplicates allowedLeetCode: Peeking IteratorLeetCode: Binary Search Tree IteratorLeetCode: Range Sum Query – ImmutableLeetCode: Range Sum Query – MutableLeetCode: Implement Stack using QueuesLeetCode: Implement Queue using StacksLeetCode: Min StackLeetCode: LRU CacheLeetCode: Insert Delete GetRandom O(1) See more blog posts. Post Views: 4