Day10
60-day SSE plan
Chess Game • Dropbox/Google Drive-like Storage • Trees (BFS) • Tech: Microservices
Algorithm
DSA
Trees — Binary Tree Level Order Traversal (LC 102)
Return level-order traversal using BFS.
Example
Input: binary tree → Output: list of levels
Where it shows up
Hierarchy traversals, org charts, breadth-wise processing.
References
Low-level design
LLD
Chess Game
Requirements
- Represent board, moves, turns; check/checkmate validation.
Expectations
- UML for Board, Piece hierarchy, Move, Game; strategy for legal moves.
- Basic engine for move validation.
Where it shows up
Game engines, rules validation systems.
References
High-level design
HLD
Dropbox/Google Drive-like Storage
Requirements
- Chunked uploads, versioning, deduplication, sharing links.
Expectations
- Content-addressable storage; metadata vs blob separation; sync engine.
- Conflict resolution approach.
Where it shows up
Consumer & enterprise file sync/share.
References
Today's deep-dive
Tech
Microservices
Draw service boundaries for a small e-commerce; define contracts, versioning, and observability (metrics, logs, traces).
Where it shows up
Automated testing, continuous integration, and quality assurance in software development lifecycles.
References