Introduction
Introduction
DFS
967. Numbers With Same Consecutive Differences
Dynamic Programming
983. Minimum Cost For Tickets
518: Coin Change 2
1043: Partition Array For Maximum Sum
String
394: Decode String
Palindrome
647: Palindromic Substrings
Hashmap
954: Array of Doubled Pairs
653: Two Sum IV - Input is a BST
454: 4Sum II
Binary Tree
BFS
958: Check Completeness of a Binary Tree
863: All Nodes Distance K in Binary Tree
DFS
971. Flip Binary Tree To Match Preorder Traversal
863: All Nodes Distance K in Binary Tree
652: Find Duplicate Subtrees
449: Serialize and Deserialize BST
437: Path Sum III
124: Binary Tree Maximum Path Sum
250: Count Univalue Subtrees
Two Pointers
962: Max Width Ramp
948: Bag of Tokens
Graph
Undirected Graph
947: Most Stones Removed with Same Row or Column
934: Shortest Bridge
200 : Number of Islands
694 : Number of Distinct Islands
695 : Max Area of Island
815 : Bus Routes
675 : Cut Off Trees for Golf Event
490 : The Maze
489 : Robot Room Cleaner
329 : Longest Increasing Path in a Matrix
323 : Number of Connected Components in an Undirected Graph
Directed Graph
787 : Cheapest Flights Within K Stops
332 : Reconstruct Itinerary
Intervals
763: Partition Labels
646: Maximum Length of Pair Chain
State loop
957: Prison Cells After N Days
Divide and Conqueor
955: Delete Columns to Make Sorted II
678: Valid Parenthesis String
Array
974. Subarray Sums Divisible by K
406: Queue Reconstruction by Height
325: Maximum Size Subarray Sum Equals k
670: Maximum Swap
769: Max Chunks To Make Sorted
Geometry
836: Rectangle Overlap
Stack
739: Daily Temperatures
496: Next Greater Element I
503: Next Greater Element II
API Design
380: Insert Delete GetRandom O(1)
353: Design Snake Game
348: Design Tic-Tac-Toe
341: Flatten Nested List Iterator
Implement Linux Find Command
Priority Queue
373: Find K Pairs with Smallest Sums
347: Top K Frequent Elementss
Sort
969: Pancake Sorting
OOP Design
Chess Game
Deck of Cards
Parking Lot
Tiny Url
Vending Machine
System Design
Design Pastebin
Design Twitter Timeline
Published with GitBook
Vending Machine
从state machine的角度来考虑设计
States of a vending machine:
Empty
Coin inserted
No coin inserted
Dispense a merchandise
results matching "
"
No results matching "
"