Coding Interview Prep — LeetCode Problem Explainer

Most LeetCode explanations give you the answer without helping you understand the pattern. This prompt teaches you to fish. For any coding interview problem, get: - **Problem restatement** — in plain English, with edge cases identified - **Brute force approach** — the naive O(n²) solution to start - **Optimization path** — how to think your way to the better solution - **Optimal solution** — with line-by-line explanation - **Time and space complexity** — Big O analysis with explanation - **The pattern** — which category this falls into (sliding window, two pointers, DP, etc.) - **Variations to practice** — 3 similar problems to reinforce the pattern - **Interview tips** — what to say out loud while solving Works for: Arrays, Strings, Trees, Graphs, Dynamic Programming, Sorting, Two Pointers, Sliding Window, and all LeetCode categories.