System design interview question
Design Tic Tac Toe with Minimax AI
Tic Tac Toe extended with a computer opponent: the classic minimax algorithm for perfect play, alpha-beta pruning for ~10x speedup, depth-limited search with a heuristic for larger boards, configurable difficulty (random / medium / unbeatable), and an Iterative Deepening wrapper that respects time budgets. Implemented in TypeScript, Java, and C++.
Practice this question step by step with an AI interviewer that reviews your requirements, your architecture and your trade-offs, and scores the design.