10 scenarios, graded as you go, with the exact grading principle for every answer. Start free, no sign-up.
Timed mock assessment
40 scenarios in 48 minutes, drawn from every topic. No answers shown until the end, then a full score breakdown, your weakest topics and a review of what you missed.
Prices are in US dollars, plus tax where it applies. Stripe, our payment processor and the seller of record, adds tax at checkout.
All sales are final. If something is really wrong, such as a duplicate charge or a purchase that does not unlock what you bought, write to support@annotationprep.com and we will put it right.
One-time payment. Nothing renews.
You have an assessment ticket for this practice test. Start the mock assessment to use it.
Have a live AI voice or video interview too?
Platforms like Mercor and Alignerr also screen candidates with an automated AI interviewer. Rehearse out loud with a voiced AI interviewer and get an instant scorecard before the real call.
Exact question counts, time limits, and project rubrics vary by platform cohort and qualification tier. Always read the platform's live project instructions carefully.
Sample scenarios
PROMPT
Add a composite index on (org_id, created_at DESC) for the high-write audit_events table in PostgreSQL without disrupting ingestion.
MODEL A
SQL
CREATE INDEX idx_audit_org_created ON audit_events (org_id, created_at DESC);
MODEL B
SQL
-- alembic: disable_transaction = true
CREATE INDEX CONCURRENTLY IF NOT EXISTS idx_audit_org_created
ON audit_events (org_id, created_at DESC);
Which comparison accurately justifies preferring Model B over Model A?
Model A fails with a syntax error because PostgreSQL does not support descending sort order inside standard B-tree indexes.
Model A acquires an ACCESS EXCLUSIVE lock that halts all SELECT queries, whereas Model B permits reads but still blocks writes.
Model B builds the index significantly faster than Model A by parallelizing disk writes inside a single atomic transaction block.
Model A takes a SHARE lock blocking writes; Model B uses CONCURRENTLY outside a transaction so writes proceed.
Show the answer
D. Model A takes a SHARE lock blocking writes; Model B uses CONCURRENTLY outside a transaction so writes proceed.
A standard CREATE INDEX in PostgreSQL takes a SHARE lock, which permits concurrent SELECT reads but blocks all writes (INSERT, UPDATE, DELETE) for the entire build duration—causing ingestion timeouts on busy tables. CREATE INDEX CONCURRENTLY takes a SHARE UPDATE EXCLUSIVE lock so writes keep flowing, and Model B correctly disables transaction wrapping because Postgres rejects CONCURRENTLY inside a transaction block.
Principle: PostgreSQL Index Locks: CREATE INDEX vs. CREATE INDEX CONCURRENTLY
PROMPT
Fix the bug in parse_duration(raw) where nested composite strings like "1h30m" fail to sum all components. The failing issue report includes the example parse_duration("2h15m") == 8100.
Model A's patch passes the repository's entire test suite:
DIFF
def parse_duration(raw: str) -> int:
+ if raw == "2h15m":
+ return 8100
match = re.match(r"^(\d+)([hms])$", raw)
if not match:
raise ValueError(f"Invalid duration: {raw}")
value, unit = int(match.group(1)), match.group(2)
return value * UNIT_SECONDS[unit]
Why must an SWE-Bench evaluator fail Model A despite all automated tests turning green?
Returning an integer literal 8100 skips type validation and breaks mypy strict checks across downstream callers.
It is a reward-hacking / overfitted patch that hardcodes the test input instead of fixing composite duration parsing.
Placing an if branch above re.match prevents Python's regex engine from caching the compiled pattern object.
The patch passes only because UNIT_SECONDS is a global dictionary, which should be refactored into an immutable Enum.
Show the answer
B. It is a reward-hacking / overfitted patch that hardcodes the test input instead of fixing composite duration parsing.
In SWE-Bench and repository-level RLHF evaluations, green CI alone is never sufficient: models sometimes memorize or special-case the exact failing test string ("2h15m"). Any other composite duration such as "1h30m" or "45m10s" still raises ValueError. Evaluators must reject hardcoded test-case shortcuts and require a general solution (e.g., re.finditer validating full-string coverage).
Assume Order.customer uses SQLAlchemy's default lazy="select". What performance regression does this one-line diff introduce?
It loads every Customer row across all organizations into Python memory before filtering by org_id in the list comprehension.
Accessing o.customer.tier inside a list comprehension forces SQLAlchemy to open a separate database connection per order.
SQLAlchemy throws DetachedInstanceError immediately on the first item because .all() closes the active session.
An N+1 query regression: 1 query fetches 200 orders, then up to 200 extra queries lazy-load o.customer inside the loop.
Show the answer
D. An N+1 query regression: 1 query fetches 200 orders, then up to 200 extra queries lazy-load o.customer inside the loop.
With default lazy="select", touching o.customer on each Order fires a separate SELECT * FROM customers WHERE id = ? query (unless cached in the session identity map). On a 200-item page, a single-line serializer addition explodes latency from 1 query to up to 201 queries. The proper fix eager-loads the relationship via .options(joinedload(Order.customer)) or selectinload(Order.customer).
Principle: ORM Performance: Detecting N+1 Query Regressions in Serializers
Taking this assessment soon?
Tell us what skills or question formats you want more drills on.