Loading skill
Install any skill in seconds. Free to start, no credit card required.
Get Started Free →Curated bank of interview problems organized by company, pattern, and difficulty. Provides problem recommendations, coverage tracking, weak area identification, and premium problem alternatives for FAANG interview preparation.
| Test case | Without → With | Effect | Δ tokens | Δ turns |
|---|---|---|---|---|
| case-01 | ✗→✓ | ▲ Improved | 115% | 0% |
| case-02 | ✗→✓ | ▲ Improved | 106% | 0% |
| case-04 | ✗→✓ | ▲ Improved | 72% | 0% |
| case-07 | ✗→✓ | ▲ Improved | 53% | 0% |
| case-09 | ✗→✓ | ▲ Improved | 155% | 0% |
A specialized skill for curating, organizing, and recommending coding interview problems, with support for company-specific preparation, pattern-based practice, and progress tracking.
Provide a comprehensive interview problem bank with:
The essential 75 problems covering all major patterns:
| Category | Count | Topics | |----------|-------|--------| | Arrays & Hashing | 9 | Two Sum, Group Anagrams, Top K Frequent | | Two Pointers | 5 | Valid Palindrome, 3Sum, Container with Water | | Sliding Window | 6 | Best Time to Buy Stock, Longest Substring | | Stack | 7 | Valid Parentheses, Min Stack, Daily Temperatures | | Binary Search | 7 | Search Rotated Array, Find Minimum | | Linked List | 11 | Reverse LL, Merge Lists, Detect Cycle | | Trees | 15 | Invert Tree, Max Depth, Level Order | | Tries | 3 | Implement Trie, Word Search II | | Heap/Priority Queue | 7 | Merge K Lists, Top K Frequent | | Backtracking | 9 | Subsets, Permutations, Combination Sum | | Graphs | 13 | Number of Islands, Clone Graph | | Dynamic Programming | 12 | Climbing Stairs, House Robber, Coin Change | | Greedy | 8 | Maximum Subarray, Jump Game | | Intervals | 6 | Merge Intervals, Meeting Rooms | | Math & Geometry | 8 | Rotate Image, Set Matrix Zeros | | Bit Manipulation | 7 | Single Number, Number of 1 Bits |
Extended list with 150 problems for comprehensive preparation:
| Company | Focus Areas | Top Patterns | |---------|-------------|--------------| | Google | Problem solving, optimization | Arrays, DP, Graphs | | Meta | Arrays, Trees, System Design | Binary Trees, Arrays | | Amazon | OOP, System Design, Leadership | Trees, BFS/DFS | | Apple | iOS/macOS, algorithms | Arrays, Trees | | Microsoft | Coding, System Design | DP, Arrays, Graphs | | Netflix | Distributed Systems | Graphs, DP |
bash# Get next problem based on progress interview-problem-bank recommend --user progress.json # Get problems for specific pattern interview-problem-bank list --pattern "dynamic-programming" --difficulty medium # Get company-specific problems interview-problem-bank company --name google --count 50
bash# Mark problem as solved interview-problem-bank solve --problem "two-sum" --time 15 --attempts 1 # Get progress report interview-problem-bank progress --user progress.json # Identify weak areas interview-problem-bank analyze --user progress.json
bash# Generate 4-week study plan interview-problem-bank plan --weeks 4 --target google --level intermediate # Generate daily practice set interview-problem-bank daily --count 3 --user progress.json
json{ "id": "two-sum", "title": "Two Sum", "difficulty": "Easy", "patterns": ["Arrays", "Hash Table"], "companies": ["Google", "Amazon", "Meta", "Apple", "Microsoft"], "frequency": 95, "url": "https://leetcode.com/problems/two-sum/", "premiumAlternative": null, "hints": [ "Use a hash table for O(1) lookup", "Store complement as key, index as value" ], "timeToSolve": { "target": 10, "beginner": 20, "expert": 5 }, "relatedProblems": ["3sum", "4sum", "two-sum-ii"] }
json{ "user": "user123", "totalSolved": 150, "byDifficulty": { "Easy": 50, "Medium": 80, "Hard": 20 }, "byPattern": { "Arrays": { "solved": 25, "total": 30 }, "DP": { "solved": 15, "total": 25 }, "Graphs": { "solved": 10, "total": 20 } }, "weakAreas": ["Graphs", "Advanced DP", "Tries"], "recommendations": [ { "problem": "course-schedule", "reason": "Strengthen Graphs" }, { "problem": "word-break", "reason": "Practice DP" } ], "streak": 15, "lastPracticed": "2025-01-24" }
json{ "duration": "4 weeks", "target": "Google", "level": "intermediate", "schedule": [ { "week": 1, "focus": ["Arrays", "Strings", "Two Pointers"], "problems": [ { "day": 1, "problems": ["two-sum", "valid-anagram", "contains-duplicate"] }, { "day": 2, "problems": ["best-time-to-buy", "max-subarray", "product-except-self"] } ] }, { "week": 2, "focus": ["Sliding Window", "Stack", "Binary Search"], "problems": [...] } ] }
| Pattern | Key Problems | Technique | |---------|--------------|-----------| | Two Pointers | 3Sum, Container with Water | Converging pointers | | Sliding Window | Longest Substring, Min Window | Expand/contract window | | Prefix Sum | Subarray Sum Equals K | Cumulative sum | | Kadane's | Maximum Subarray | Track max ending at i |
| Pattern | Key Problems | Technique | |---------|--------------|-----------| | DFS Recursive | Max Depth, Path Sum | Recursion | | BFS Level Order | Level Order Traversal | Queue | | Construct Tree | Build from Preorder/Inorder | Divide and conquer |
| Pattern | Key Problems | Technique | |---------|--------------|-----------| | BFS Shortest Path | Word Ladder | Level-by-level | | DFS Connected Components | Number of Islands | Visit all nodes | | Topological Sort | Course Schedule | Kahn's algorithm | | Union Find | Number of Connected | DSU |
| Pattern | Key Problems | Technique | |---------|--------------|-----------| | 1D Linear | House Robber, Climbing Stairs | dpi] depends on dpi-1], dpi-2] | | 2D Grid | Unique Paths, Min Path Sum | dpi]j] from neighbors | | String DP | Edit Distance, LCS | dpi]j] for substrings | | Knapsack | Coin Change, Partition | Include/exclude item |
InterviewReady MCP Server:
bash# Access curated interview content npm install -g interviewready-mcp-server
This skill enhances:
faang-interview-prep - Structured FAANG preparationmock-coding-interview - Problem selection for mocksinterview-problem-explanation - Explaining solutionsskill-gap-analysis - Identifying weak areasFocus on high-frequency problems:
Comprehensive coverage:
Deep mastery:
| Error | Cause | Resolution | |-------|-------|------------| | PROBLEM_NOT_FOUND | Problem not in database | Search by alternate name | | PREMIUM_LOCKED | LeetCode premium required | Use alternative problem | | INVALID_COMPANY | Company not recognized | Check supported companies | | PROGRESS_LOAD_FAILED | Cannot load progress file | Initialize new progress |
Other measured skills in the registry, with their headline benchmark lift.