Loading
Pick a focused question that fits your time, stack, and interview goal.
39 results across 1 active filter
Page 1 of 2
Pre-aggregates two one-to-many relationships before joining them to prevent fanout from corrupting financial totals.
Builds several daily business metrics in one grouped query while keeping each metric definition explicit.
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.
Chooses constraints, conditional writes, optimistic conflicts, or stronger isolation to protect a limited-resource reservation without unnecessary blocking.
Designs a narrow covering index from predicates and ordering, then weighs eliminated lookups against storage, write overhead, cache efficiency, overlap, and maintenance cost.
Builds a race-safe upsert around database-enforced identity, explicit conflict semantics, retries, ordering, and side-effect boundaries.
Protects transactional traffic from reporting load through freshness requirements, bounded asynchronous jobs, tuned summaries, workload isolation, replicas or warehouses, and explicit capacity gates.
Implements correct half-open interval overlap logic for booking validation.
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.
Explains join behavior using API-shaped data, missing related rows, and result-cardinality trade-offs.
Compares offset and keyset pagination for stable API lists, large tables, and user-facing result consistency.
Explains relational modeling, duplication, write consistency, read performance, and when denormalized data is justified.
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 SQL three-valued logic, null-safe filters, optional relationships, and API behavior around missing values.
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 EXISTS instead of a row-multiplying join when the related table is only a filter.
Groups normalized email values to identify duplicates before adding or repairing a uniqueness rule.
Uses the gaps-and-islands pattern to find consecutive login-day streaks after deduplicating same-day activity.
Solves a many-to-many all-match filter with grouping and a deliberate empty-selection rule.
Uses NOT EXISTS to express an anti-join without null traps or duplicate parent rows.
Uses a recursive CTE to return hierarchy depth and a readable root-to-node path.