8 prompts
Act as a technical interviewer for a [role] internship. Ask me one beginner-friendly coding problem in [language], let me explain my approach, give hints if I'm stuck, then review my code for correctness, complexity and clarity.
Prepares students for their first tech internship interview.
Explain the Big O time and space complexity of this code step by step, as if teaching a junior developer. Point out the most expensive part and how input size affects it. Code: [paste code]
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.
This function is too slow for large inputs ([input size]). Analyse its time and space complexity, propose a more efficient approach, implement it, and show a quick benchmark plan. Code: [paste code]
Analyse the time and space complexity of this code. ``` [paste] ``` Explain the Big-O line by line in simple terms, identify the bottleneck, describe what happens with 10× and 1000× more data, and suggest a more efficient approach if one exists, with code.
Understand your code's time and space complexity and where it will slow down at scale.
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.
Act as a senior [language] developer. Write a function that: [describe behaviour] Inputs: [names, types, examples] Output: [type and example] Constraints: [performance, no external libraries, etc.] Include: - Type hints/annotations and a docstring - Input validation and clear error messages - Handling for edge cases (…
Describe what a function should do and get clean, typed, tested code with edge cases handled.
Act as a performance engineer. Language: [language] What the code does: [description] Typical input size: [e.g. 1M rows, 10k requests/min] Current speed/problem: [e.g. takes 40 seconds, high memory] Please: 1. Identify the bottlenecks and explain the current time and space complexity 2. Propose optimisations (better a…
Find the bottlenecks in slow code, understand the time complexity, and get a faster version with benchmarks to prove it.