Pick a focused question that fits your time, stack, and interview goal.
How much time do you have?
Show one-drill sessions you can finish now.
132 results across 1 active filter
Page 3 of 6
Uses a recursive CTE to return hierarchy depth and a readable root-to-node path.
Builds customer summaries from order rows using grouping, aggregation, and deterministic ordering.
Uses a test-only DbCommandInterceptor to fail a regression when database command count grows with page size.
Uses SQLAlchemy version counters and an HTTP precondition to reject stale writes without silently overwriting newer state.
Uses the client's original rowversion to detect a lost update and return a deliberate conflict response.
Separates caller cancellation from a dependency timeout and maps expected downstream outcomes safely.
Validates size and signature, writes under a generated storage key, and keeps untrusted files outside the public web root.
Validates a bounded command set completely before applying all updates in one SaveChanges transaction.
Builds a bounded readiness check for one required dependency while keeping liveness independent and responses non-sensitive.
Builds a Celery task that survives timeout ambiguity, retries temporary failures, and records one durable business outcome.
Builds a small immutable money type with explicit scale, rounding, arithmetic, ordering, and value equality.
Builds a frozen dataclass around Decimal with explicit scale, validation, arithmetic, ordering, and value equality.
Applies an immediate reversible mutation, blocks overlapping writes, and restores the previous state on failure.
Carries the version observed by the client into a conditional update and returns an explicit conflict instead of silently overwriting newer data.
Implements a database-backed idempotency boundary that replays one response and rejects key reuse with a different request.
Stores an idempotency key, request hash, and response in the same transaction as the created resource.
Uses a scoped idempotency key, request hash, unique constraint, and one transaction to create an order exactly once from the API perspective.
Implements a small in-memory fixed-window rate limiter with per-key counters.
Implements a small LRU cache using a dictionary plus linked list for O(1) get and put.
Implements descending keyset pagination in LINQ using a compound timestamp-and-id cursor.
Builds descending keyset pagination with a unique tie-breaker, opaque cursor, limit-plus-one query, and stable next page.
Implements descending cursor pagination with a unique tie-breaker, bounded projection query, and next-cursor detection.
Processes a large import in chunks with fresh DbContexts, idempotent keys, cancellation, and bounded tracker growth.
Verifies the exact request bytes, rejects stale signatures, deduplicates event ids, and queues processing durably.