3 prompts
Explain [data structure, e.g. a hash map / heap / trie] for a [level] developer. Include a text diagram, how operations work with time complexity, a clean implementation in [language], and when to use it in real projects.
Explains a data structure with visuals and an implementation.
Act as a senior engineer who mentors candidates. Target role and level: [e.g. mid-level backend engineer] Target companies: [types] Interview date: [date] Strengths and weak spots: [details] Hours per week: [hours] Create a study plan covering data structures and algorithms (topics by priority), system design, languag…
A week-by-week study plan for coding, system design and behavioural rounds, tailored to your target companies.
Act as an algorithms tutor. Problem: [paste problem statement] Language: [language] Explain: 1. The problem in simple words with a small example 2. A brute-force approach and its complexity 3. The key insight that leads to the optimal approach 4. Step-by-step walkthrough on the example 5. Clean, commented code 6. Time…
Understand algorithm problems: intuition, brute force, optimal approach, complexity and clean code.