Loading
Pick a focused question that fits your time, stack, and interview goal.
18 results across 1 active filter
Page 1 of 1
Aggregates log entries into per-minute error counts with deterministic output.
Implements a safe in-memory paging helper with metadata and boundary handling.
Implements invoice total calculation with quantity, unit price, percentage discount, and rounding.
Implements chunking for batch processing without dropping final partial batches.
Implements comparison for simple semantic version strings with missing patch parts treated as zero.
Implements a word-frequency counter with normalization, punctuation handling, and stable ordering.
Implements duplicate suppression while preserving the first event for each idempotency key.
Implements a stable first-unique-character search using counts and original order.
Flattens a tree into display paths while preserving order and preventing simple cycles.
Builds customer summaries from order rows using grouping, aggregation, and deterministic ordering.
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 interval merging for scheduling-style time ranges with sorted output.
Parses a simple filter expression into a validated dictionary without accepting arbitrary keys.
Implements safe redaction of known sensitive keys in a dictionary before logging.
Implements a bounded async retry helper that respects cancellation and does not retry every exception blindly.
Implements top-K frequency selection with deterministic tie-breaking.
Implements a small validation helper for date ranges with clear error messages.