Skip to content

Prepare For Coder Interview – Denny

  • Basic
  • Medium
  • Hard
  • Architect
  • Life

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 Formula
  • LeetCode: Design In-Memory File System
  • LeetCode: Design File System
  • LeetCode: Design A Leaderboard
  • LeetCode: Design Log Storage System
  • LeetCode: LFU Cache
  • LintCode: Student Level
  • LintCode: Student ID
  • LeetCode: Encode and Decode Strings
  • LeetCode: Design Circular Deque
  • LeetCode: Design Circular Queue
  • LeetCode: Design HashMap
  • LeetCode: Design HashSet
  • LeetCode: Design Linked List
  • LeetCode: Random Pick with Blacklist
  • LeetCode: Design Tic-Tac-Toe
  • LeetCode: Find Median from Data Stream
  • LeetCode: Shuffle an Array
  • LeetCode: Design Search Autocomplete System
  • LeetCode: Design Snake Game
  • LeetCode: Design Twitter
  • LeetCode: Encode and Decode TinyURL
  • LeetCode: Flatten 2D Vector
  • LeetCode: Shortest Word Distance II
  • LeetCode: Design Phone Directory
  • LeetCode: Max Stack
  • LeetCode: Design Hit Counter
  • LeetCode: Design Compressed String Iterator
  • LeetCode: Logger Rate Limiter
  • LeetCode: Moving Average from Data Stream
  • LeetCode: Two Sum III – Data structure design
  • LintCode: Implement Queue by Circular Array
  • LeetCode: All O`one Data Structure
  • Review: Object-Oriented Design Problems
  • LeetCode: Flatten Nested List Iterator
  • LeetCode: Add and Search Word – Data structure design
  • LeetCode: Implement Magic Dictionary
  • LeetCode: Implement Trie (Prefix Tree)
  • LeetCode: Range Sum Query 2D – Immutable
  • LeetCode: Insert Delete GetRandom O(1) – Duplicates allowed
  • LeetCode: Peeking Iterator
  • LeetCode: Binary Search Tree Iterator
  • LeetCode: Range Sum Query – Immutable
  • LeetCode: Range Sum Query – Mutable
  • LeetCode: Implement Stack using Queues
  • LeetCode: Implement Queue using Stacks
  • LeetCode: Min Stack
  • LeetCode: LRU Cache
  • LeetCode: Insert Delete GetRandom O(1)

See more blog posts.

linkedin
github
slack

Post Views: 4
Posted in ReviewTagged oodesign, review

Post navigation

Basic: General Procedure For Code Problems
Review: Monotone Stack Or Monotone Queue Problems

Leave a Reply Cancel reply

Your email address will not be published.

Tags

#array #backtracking #bfs #binarytree #bitmanipulation #blog #classic #codetemplate #combination #dfs #dynamicprogramming #game #graph #greedy #heap #inspiring #interval #linkedlist #manydetails #math #palindrome #recursive #slidingwindow #stack #string #subarray #trie #twopointer #twosum binarysearch editdistance hashmap intervaldp knapsack monotone oodesign presum rectangle redo review rotatelist series sql treetraversal unionfind

Recent Posts

  • a
  • a
  • a
  • a
  • a

Recent Comments

    Archives

    Categories

    • Amusing
    • Basic
    • Easy
    • Hard
    • Life
    • Medium
    • Resource
    • Review
    • Series
    • Uncategorized
    Proudly powered by WordPress | Theme: petals by Aurorum.