Loading skill
Install any skill in seconds. Free to start, no credit card required.
Get Started Free →jamestorrevillas/interview-prep
Use this skill when preparing for technical interviews, system design interviews, behavioral interviews, or mock interview practice. Trigger on keywords: interview, interview prep, mock interview, LeetCode, system design interview, behavioral question, STAR method, interview practice, job interview, coding interview.
Passed 21 of 23 test cases with the skill, and 21 of 23 without it.
2 fixed19 passed either way0 still failing2 broke
Tokens, turns and time describe resource use, not a dollar price.
One of 2 test cases the skill fixed. Same model, same prompt, with and without the skill.
When creating a prompt for an AI tool to conduct a mock technical interview, what specific three-level rating scale should the prompt ask the AI to evaluate each candidate response against?
| Checked | Without skill | With skill |
|---|---|---|
| Specifies using the rating categories Strong, Adequate, and Needs Work. | Missed | Passed |
The instructions your model reads when the skill loads.
| Type | What They're Testing | How to Prepare |
|---|---|---|
| Coding / DSA | Problem-solving, CS fundamentals | LeetCode patterns, not random problems |
| System Design | Architecture thinking, trade-offs | Practice frameworks, read real systems |
| Behavioral | Past behavior predicts future | STAR stories for 6-8 scenarios |
| Technical Discussion | Depth of knowledge, communication | Know your stack deeply, read vs write trade-offs |
Don't grind random problems. Learn patterns:
| Pattern | When to Use |
|---|---|
| Two Pointers | Sorted arrays, palindromes, pair sums |
| Sliding Window | Subarray problems, longest/shortest window |
| Fast & Slow Pointers | Cycle detection, linked list middle |
| BFS / DFS | Trees, graphs, shortest path |
| Binary Search | Sorted data, "find in X" problems |
| Dynamic Programming | Overlapping subproblems, optimization |
| Heap / Priority Queue | K largest/smallest, streaming data |
1. Clarify: "Can I have duplicates? What's the input range? What to return if empty?"
2. Example: Walk through a small example out loud
3. Brute force: State the naive solution first
4. Optimize: "I can improve this by..."
5. Code: Write clean, named code
6. Test: Trace through your example + edge cases
7. Complexity: State time and space complexity
test cases passed, vs 21 / 23 without
Published skills whose descriptions closely match this one, with their headline benchmark lift.
More skills from the same source and nearby in the registry, with their headline benchmark lift.