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.
Installer avec Codex ou Claude Copiez ce prompt, collez-le dans Codex, Claude ou un autre assistant, puis laissez-le vérifier la page du skill et l'installer pour vous.
Une commande directe contourne le prompt de vérification. Examinez la source avant de l'exécuter.
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.
A specialized skill for curating, organizing, and recommending coding interview problems, with support for company-specific preparation, pattern-based practice, and progress tracking.
Purpose
Provide a comprehensive interview problem bank with:
Problems organized by FAANG company and difficulty
By company (Google, Meta, Amazon, Apple, Microsoft, etc.)
By pattern (Two Pointers, Sliding Window, DP, etc.)
By difficulty (Easy, Medium, Hard)
By topic (Arrays, Trees, Graphs, etc.)
By frequency (most asked in interviews)
Curated Problem Lists
Blind 75 (essential problems)
NeetCode 150 (expanded essential list)
LeetCode Top Interview Questions
Company-specific top questions
Pattern-specific problem sets
Progress Tracking
Problems solved by category
Weak area identification
Time spent per problem type
Success rate tracking
Spaced repetition for review
Recommendations
Next problem based on progress
Problems to strengthen weak areas
Company-specific practice plans
Time-based study schedules
Problem Lists
Blind 75
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
NeetCode 150
Extended list with 150 problems for comprehensive preparation:
All 75 Blind 75 problems
75 additional problems for deeper coverage
More advanced problems per category
Company-Specific Lists
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
Usage
Get Recommended Problems
# 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
Track Progress
# 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
Generate Study Plan
# 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
Output Schema
Problem Entry
{"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"]}
