Loading
Pick a focused question that fits your time, stack, and interview goal.
17 results across 1 active filter
Page 1 of 1
Explains physical connection reuse, pool partitioning, short ownership, exhaustion causes, diagnostics, and why increasing the pool is not the first fix.
Uses an ordered window aggregate to calculate a deterministic running balance per account.
Combines daily aggregation, a calendar table, and a window frame to calculate true seven-calendar-day revenue.
Designs a narrow covering index from predicates and ordering, then weighs eliminated lookups against storage, write overhead, cache efficiency, overlap, and maintenance cost.
Protects transactional traffic from reporting load through freshness requirements, bounded asynchronous jobs, tuned summaries, workload isolation, replicas or warehouses, and explicit capacity gates.
Separates a live blocking chain from a deadlock victim, gathers the right database evidence, stabilizes the incident, and fixes lock duration or access order.
Explains N plus one query behavior, symptoms in APIs, fixes with set-based reads, batching, projections, and monitoring.
Compares offset and keyset pagination for stable API lists, large tables, and user-facing result consistency.
Writes predicates the optimizer can use as index search arguments, then proves the effect through plans and reads while balancing computed columns, composite indexes, and write overhead.
Explains parameter sniffing, data skew, cached plans, symptoms, and cautious mitigation options in SQL Server.
Explains how statistics and cardinality estimates affect plan choice, joins, memory grants, and slow queries.
Uses the gaps-and-islands pattern to find consecutive login-day streaks after deduplicating same-day activity.
Implements descending keyset pagination with a compound cursor and stable ordering.
Converts local-day boundaries to UTC once, preserving correct daylight-saving behavior and index use on stored UTC timestamps.
Uses an actual execution plan, row-flow evidence, runtime measurements, and representative parameters to diagnose a slow query without guessing.
Uses ROW_NUMBER with a deterministic tie-breaker to return the complete latest status row per order.
Aggregates product sales and ranks independently inside each category with a deterministic top-N rule.