How do a declared reference type, GetType(), and IsAssignableFrom answer different questions?
Runtime & concurrency
Discuss the question ↗Prepare with understandingExplain the idea.
Explain the idea.
Show your reasoning.
252 questions across coding, runtime and production engineering. Predict, explain and compare your answer. Then follow the connected lesson and real code.
252 questions
Choose a focused track or start a practice session. Sessions prioritize questions marked for review and mix distinct lessons where possible.
Self-review is saved only in this browser, separately from lesson completion. It is your assessment, not an interview score.
Practice session
Predict the three metadata lines and explain why the final compatibility check is false.
Runtime & concurrency
Discuss the question ↗Design a bounded handler registry that validates compatibility without confusing it with construction or authorization.
Runtime & concurrency
Discuss the question ↗What is the difference between a generic definition and a constructed Type, and why is an open definition not a ready-to-create object?
Runtime & concurrency
Discuss the question ↗Trace all four generic-metadata lines, including the argument ordering.
Runtime & concurrency
Discuss the question ↗How would you implement a generic capability matcher without using type names as wildcard patterns?
Runtime & concurrency
Discuss the question ↗Why should reflection discovery state BindingFlags explicitly and avoid assuming metadata order?
Runtime & concurrency
Discuss the question ↗Explain why Own is the only enumerated method while the separate inherited and private checks succeed.
Runtime & concurrency
Discuss the question ↗Design safe bounded discovery for annotated integer operations in a known container type.
Runtime & concurrency
Discuss the question ↗How does reading CustomAttributeData differ from requesting an attribute instance?
Runtime & concurrency
Discuss the question ↗Trace the metadata value and constructor counter before and after live attribute retrieval.
Runtime & concurrency
Discuss the question ↗Design an annotation reader for route labels that avoids unexpected constructor effects.
Runtime & concurrency
Discuss the question ↗Which failure does TargetInvocationException describe in this lesson, and what does it not describe?
Runtime & concurrency
Discuss the question ↗Predict the wrapper and inner exception names, then compare the directly invoked delegate.
Runtime & concurrency
Discuss the question ↗Design failure reporting for a reflection dispatcher that can return either values or Tasks.
Runtime & concurrency
Discuss the question ↗Why does the explicit static constructor matter to this initialization example?
Runtime & concurrency
Discuss the question ↗Trace the four lines and explain why init does not appear twice.
Runtime & concurrency
Discuss the question ↗How would you choose between static initialization and an explicit recoverable startup operation?
Runtime & concurrency
Discuss the question ↗Why are an expression tree and a delegate different values even when they compute the same result?
Runtime & concurrency
Discuss the question ↗Predict the inspected node kinds and both arithmetic results.
Runtime & concurrency
Discuss the question ↗Design a bounded arithmetic-expression service that can inspect and execute only its supported operations.
Runtime & concurrency
Discuss the question ↗Why can an interpreted expression observe a later local-variable assignment?
Runtime & concurrency
Discuss the question ↗Trace the effect of changing factor and explain the MemberAccess report.
Runtime & concurrency
Discuss the question ↗How would you make a cached computation independent of mutable request-local state?
Runtime & concurrency
Discuss the question ↗Why do dynamic-code flags and a warmup loop not identify a method's JIT tier?
Runtime & concurrency
Discuss the question ↗What does the portable warmup companion print, and what can those lines establish?
Runtime & concurrency
Discuss the question ↗Plan a real investigation of tiering effects without using fabricated timing expectations.
Runtime & concurrency
Discuss the question ↗What does a metadata-preservation annotation establish, and why is a JIT run not an AOT compatibility test?
Runtime & concurrency
Discuss the question ↗Trace the direct-registry companion and identify which deployment behavior it does not execute.
Runtime & concurrency
Discuss the question ↗Design a small extensibility feature intended to support NativeAOT without assuming unrestricted runtime discovery.
Runtime & concurrency
Discuss the question ↗How do monitor reentrancy and thread ownership differ from a semaphore permit?
Runtime & concurrency
Discuss the question ↗Trace IsEntered before, during nested entry, and after both lock scopes.
Runtime & concurrency
Discuss the question ↗How would you protect an operation that must await while preserving explicit acquisition and cleanup ownership?
Runtime & concurrency
Discuss the question ↗Why must a condition wait recheck protected state instead of treating Pulse as a stored message?
Runtime & concurrency
Discuss the question ↗Trace the portable queue-predicate companion without attributing monitor operations to it.
Runtime & concurrency
Discuss the question ↗Design a bounded producer/consumer condition protocol with completion and one overall deadline.
Runtime & concurrency
Discuss the question ↗What does a consistent resource order prevent, and what does it not prove about locking?
Runtime & concurrency
Discuss the question ↗Trace both sequential transfers and the final conservation check.
Runtime & concurrency
Discuss the question ↗Design a multi-resource update whose ordering and failure behavior remain inspectable.
Runtime & concurrency
Discuss the question ↗Why is an Interlocked increment stronger than separate volatile reads and writes but weaker than a multi-field transaction?
Runtime & concurrency
Discuss the question ↗Trace both increments and the successful integer CompareExchange return value.
Runtime & concurrency
Discuss the question ↗How would you maintain a capacity invariant spanning accepted and remaining state?
Runtime & concurrency
Discuss the question ↗Why can value-equal records fail reference CompareExchange, and what belongs outside a retry computation?
Runtime & concurrency
Discuss the question ↗Explain the successful first publication and the failed value-equal expected reference.
Runtime & concurrency
Discuss the question ↗Design a retryable immutable-state update with a clear effect and progress boundary.
Runtime & concurrency
Discuss the question ↗What does volatile publication provide, and why is it not a general transaction or freshness guarantee?
Runtime & concurrency
Discuss the question ↗Trace the publication flag and data in the sequential portable companion.
Runtime & concurrency
Discuss the question ↗How would you publish a sequence of changing snapshots when consumers need a precise delivery contract?
Runtime & concurrency
Discuss the question ↗Why can GetOrAdd publish one association after executing several value factories?
Runtime & concurrency
Discuss the question ↗Trace the sequential cached-key path and explain why it cannot prove the concurrent factory claim.
Runtime & concurrency
Discuss the question ↗Design a concurrent cache of expensive resources with explicit losing-candidate and failure behavior.
Runtime & concurrency
Discuss the question ↗Why does thread-safe TryPeek not reserve the item for the caller?
Runtime & concurrency
Discuss the question ↗Explain the two boolean/value pairs when zero is a legitimate queue item.
Runtime & concurrency
Discuss the question ↗Design a concurrent consumer workflow that handles claimed items without inventing queue guarantees.
Runtime & concurrency
Discuss the question ↗Why does SemaphoreSlim require logical release ownership even when a maximum is configured?
Runtime & concurrency
Discuss the question ↗Trace the nested zero-timeout wait, restored count, and extra release.
Runtime & concurrency
Discuss the question ↗Design asynchronous mutual exclusion with explicit cancellation and fairness requirements.
Runtime & concurrency
Discuss the question ↗How does the lease prevent repeated disposal from releasing the same permit twice?
Runtime & concurrency
Discuss the question ↗Trace the pending second acquisition and both pairs of disposal calls.
Runtime & concurrency
Discuss the question ↗Extend the lease with cancellation and define how the shared gate is shut down safely.
Runtime & concurrency
Discuss the question ↗How is AsyncLocal different from a static variable or a permanent OS-thread slot?
Runtime & concurrency
Discuss the question ↗Trace the three lines using the gate and execution-context boundaries, not thread timing.
Runtime & concurrency
Discuss the question ↗Design request correlation propagation without hiding mutable request state in ambient storage.
Runtime & concurrency
Discuss the question ↗Why does ConfigureAwait(false) not have the same effect as ExecutionContext.SuppressFlow?
Runtime & concurrency
Discuss the question ↗Trace the completed-await companion and identify which suppression operation it does not perform.
Runtime & concurrency
Discuss the question ↗How would you schedule deliberately detached work with a precise context and ownership policy?
Runtime & concurrency
Discuss the question ↗How do channel admission, buffered data, and Reader.Completion differ?
Runtime & concurrency
Discuss the question ↗Trace buffered values, the terminal exception type, and a later write attempt.
Runtime & concurrency
Discuss the question ↗Design a channel pipeline with two producers and clear terminal-failure ownership.
Runtime & concurrency
Discuss the question ↗Why are elapsed ticks and current-thread allocated bytes observations rather than a complete performance conclusion?
Runtime & concurrency
Discuss the question ↗What stable output can be predicted without inventing the measured byte or tick values?
Runtime & concurrency
Discuss the question ↗Plan a credible comparison of two implementations while preserving an independent correctness oracle.
Runtime & concurrency
Discuss the question ↗Why do amount = NULL, amount IS NULL, COUNT(*) and COUNT(amount) answer different questions, and why does CHECK(amount > 0) not replace NOT NULL?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain why the nullable comparison and the two counts differ. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design storage and reporting rules for an optional positive measurement. How will you distinguish absent, NULL, zero and malformed input and verify the persisted result?
Production engineering
Discuss the question ↗What makes the observed composite index relevant to this query, and what does a covering access establish or leave unproven?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain how filtering and the explicit price/id order produce the sequence. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design an index investigation for a category-sorted catalog with frequent writes. What results, plans and workload facts would you preserve before choosing a layout?
Production engineering
Discuss the question ↗Why can lower(name), NOCASE comparison and an active-only partial index require different query-plan evidence even when some sample results look similar?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain which ASCII names and active prices are selected by the actual C# operations. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design case-insensitive and active-only catalog queries without conflating text semantics, partial row coverage and provider access paths.
Production engineering
Discuss the question ↗Why can a stale SQLite WAL reader keep seeing ten after another connection commits twenty, and why must a retry repeat dependent reads?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain why the copied snapshot stays10 while a fresh decision produces21. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design a bounded retry for a unit that reads a balance-like value and updates it, while excluding or reconciling any external side effect.
Production engineering
Discuss the question ↗What does the outbox transaction actually make atomic, and why does one committed outbox row not prove delivery or an exactly-once remote effect?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain how the accepted immutable bundle and rejected quantity produce the three output lines. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design persistence and dispatch boundaries for an order plus integration event, including failures between writes, after commit and after delivery.
Production engineering
Discuss the question ↗Why does an outbox acknowledgment need a claim generation as well as an owner label, and what can lease fencing not undo?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain how known times, owner identity and generation determine the four booleans. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design a bounded dispatcher that can reclaim work after a crash while rejecting stale acknowledgments and tolerating uncertain external delivery.
Production engineering
Discuss the question ↗What must an inbox compare for a replay, and why is storing the key separately from the local effect or ignoring amount incorrect?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain why the same id can produce created, replay and conflict while the effect remains3. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design an inbox for messages from multiple producers, including full request equivalence, rollback and a side effect outside its database.
Production engineering
Discuss the question ↗Why does quarantining sequence2 leave sequence3 blocked, and what separate policy is needed before advancing an aggregate?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain how last sequence changes across a gap, a valid predecessor and a quarantined amount. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design per-aggregate delivery ordering with duplicate identities, gaps, poison input and an explicit authorized reconciliation path.
Production engineering
Discuss the question ↗Why can If-None-Match match a weak tag for GET, and what must a version-backed validator actually track?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain why the three known tag strings compare True, True and False without parsing real HTTP. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design conditional reads for a resource with multiple representations and changes, including parsed header lists and a consumer with a prior body.
Production engineering
Discuss the question ↗Why must the full If-Match condition be checked inside the authoritative write unit, and why is an earlier read insufficient for a multi-tag list?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain how one successful update changes the later stale and weak decisions. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design an optimistic HTTP update with missing, weak, wildcard and multi-tag conditions, including a controlled concurrent writer and persisted-state checks.
Production engineering
Discuss the question ↗Why can an extra response member be compatible for one consumer while renaming name to displayName breaks it despite200?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain why the known name predicate accepts two bodies and rejects the third. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design a v1-to-v2 rollout with explicit consumer, request, success and failure contracts rather than relying on route names alone.
Production engineering
Discuss the question ↗Why does this fixture invalidate after commit, and what inconsistency window still remains when cache removal itself fails?
Production engineering
Discuss the question ↗Portable .NET9 console only: predict every printed line and explain why the rejected candidate leaves rune cached and the accepted source change produces exactly two reads. State which real HTTP, SQL or infrastructure guarantee this program does not test.
Production engineering
Discuss the question ↗Design cache freshness and recovery for a database-backed representation across commits, invalidation failure and multiple process owners.
Production engineering
Discuss the question ↗What does HybridCache coordinate for one shared key, and which cancellation and process boundaries remain separate?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design a cache-miss policy for two processes, distinct keys and canceling callers without assuming cross-instance single-flight or an atomic database/cache transaction.
Production engineering
Discuss the question ↗Why do an HTTP200 status and a received record prefix fail to establish successful completion of this stream?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design a bounded consumer that publishes a batch only after a valid terminal record, and define behavior for error records, cancellation and truncated transport.
Production engineering
Discuss the question ↗What does a successful IOptionsMonitor file reload establish, and why is it different from a last-known-good application policy?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design a validated configuration publication boundary with explicit last-known-good behavior and limited secret exposure, without assuming that raw IOptionsMonitor reload provides it automatically.
Production engineering
Discuss the question ↗Why can a request from an unapproved Origin still receive HTTP200, and what does the classroom CORS policy actually control?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design browser sharing, caller authentication and authorization as separate controls for a credentialed API instead of treating Origin matching as an identity system.
Production engineering
Discuss the question ↗What does a valid antiforgery request-token/cookie pair prove here, and why does it provide neither authentication nor one-time replay prevention?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design an unsafe authenticated operation that separates antiforgery validation, business authorization and durable duplicate-request handling, including restart and key-lifetime policy.
Production engineering
Discuss the question ↗Why does HTML text encoding not make a value universally safe for a URL, script or attribute context?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design a response that contains untrusted display text and a separately validated HTTPS link, preserving distinct encoding and URL-policy responsibilities.
Production engineering
Discuss the question ↗What changes when the immediate peer is trusted for forwarded headers, and why does Request.Scheme=https not prove TLS on this connection?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design a reverse-proxy trust policy that preserves the immediate-peer boundary, limits the accepted chain and keeps TLS, host policy and user authorization separate.
Production engineering
Discuss the question ↗Why are the Host allowlist, canonical public base URI and tenant authorization three different contracts?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design canonical link generation behind a proxy while restricting accepted hosts and avoiding request-host-derived tenant identity.
Production engineering
Discuss the question ↗Why must an application-owned hosted worker create a scope per operation, and when does the completion signal become trustworthy in this fixture?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design cancellation, disposal and completion ownership for a bounded hosted worker using scoped dependencies, without treating the in-memory queue as durable delivery.
Production engineering
Discuss the question ↗Which inputs are bounded or redacted by the actual logger and Meter path, and why does that fail to establish complete-system anonymization?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design a telemetry policy that bounds metric dimensions and limits sensitive values across application, proxy and exporter paths, with explicit evidence for each owner.
Production engineering
Discuss the question ↗Why can HTTP200 carry an incompatible body while the same503 status can describe two different persisted outcomes?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design a mutation consumer that validates its required representation and reconciles an uncertain response without blindly repeating a non-idempotent effect.
Production engineering
Discuss the question ↗How do the conditional mutation, saved request receipt and outbox row share one storage boundary, and when is compatible replay deliberately refused?
Production engineering
Discuss the question ↗Execution context: this is the complete portable .NET9 console companion, using ordinary BCL code. Trace its exact stdout and justify each state or comparison; it does not start the external ASP.NET server or SQL database.
Production engineering
Discuss the question ↗Design recovery after an uncertain committed command, including full request equivalence, later unrelated updates and an external outbox effect without claiming universal exactly-once execution.
Production engineering
Discuss the question ↗Which contract decisions must be settled before aggregating the quantity rows, and what costs are hidden by saying dictionary lookup is constant-time?
Coding interviews
Discuss the question ↗Trace the complete program for clarify the contract before aggregating. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Extend the contract to accept signed stock adjustments without losing a nonnegative final-stock invariant. Decide whether validity applies after every row or only after all rows, and provide an example where those policies disagree. Preserve an explicit key comparer and checked arithmetic.
Coding interviews
Discuss the question ↗Why do the two statistics pipelines have the same big-O class but different source-visit and allocation behavior?
Coding interviews
Discuss the question ↗Trace the complete program for expose repeated enumeration and allocation. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a statistics API for a one-shot input with a maximum item budget. Decide whether to reject an oversized sequence, return a truncated result or stream partial statistics; specify which resource is bounded and how enumeration is disposed on failure.
Coding interviews
Discuss the question ↗Why does the slice guard use count <= length - start after validating start, and which empty ranges are valid?
Coding interviews
Discuss the question ↗Trace the complete program for build a boundary matrix for slicing. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a zero-copy alternative that returns ReadOnlySpan and state who owns the backing memory, how long the result is valid and whether concurrent source mutation is allowed. Explain why allocation reduction changes the interface contract.
Coding interviews
Discuss the question ↗Why must linked-list cycle detection compare node identity rather than values, and why does resetting one cursor locate the entry?
Coding interviews
Discuss the question ↗Trace the complete program for find a linked-list cycle by identity. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Compare the constant-space solution with an identity-based visited set during an interview. Explain the proof burden and memory tradeoff, then define whether a production caller can mutate links during inspection and how ownership would enforce that rule.
Coding interviews
Discuss the question ↗Which invariants make the LRU cache correct across reads, updates and eviction, and what does its capacity actually bound?
Coding interviews
Discuss the question ↗Trace the complete program for implement an lru cache with explicit updates. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a byte-bounded cache with expiration and concurrent callers. Decide whether hits update recency under one lock, whether oversized values are rejected and whether expiration is checked lazily. State which guarantees you would simplify rather than claiming the small cache already provides them.
Coding interviews
Discuss the question ↗Why does a trie need a terminal-word flag in addition to child links, and how do empty word and empty prefix differ?
Coding interviews
Discuss the question ↗Trace the complete program for separate trie words from prefixes. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design bounded autocomplete over this structure. Specify ranking, tie order, normalization and maximum returned suggestions before choosing traversal or cached counts. Explain how deleting a word differs from deleting every node on its path when other words share that prefix.
Coding interviews
Discuss the question ↗What makes this top-K ranking stable under ties, and why is the implementation not O(k) despite returning at most k keys?
Coding interviews
Discuss the question ↗Trace the complete program for define stable top-k ties before optimizing. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a streaming or distributed ranking requirement. Decide whether first seen means local arrival, a globally assigned sequence number or a timestamp with another tie breaker. Explain why merging partial counts alone cannot recover a global first-occurrence policy.
Coding interviews
Discuss the question ↗Which ordering and balance invariants make the two-heap streaming median correct, and how are integer extremes handled?
Coding interviews
Discuss the question ↗Trace the complete program for maintain a streaming median with two heaps. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a bounded-memory service for approximate percentiles rather than an exact all-history median. Specify error tolerance, mergeability and window semantics. Explain what you would stop promising when replacing the exact two-heap state with a summary.
Coding interviews
Discuss the question ↗What does the explicit inorder stack represent, and why does iterative traversal still require O(height) auxiliary storage?
Coding interviews
Discuss the question ↗Trace the complete program for explain an iterative inorder invariant. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design an API for traversing caller-owned mutable trees. Decide whether to snapshot, reject cycles, lock ownership or document a no-mutation precondition. State the memory and latency consequences before promising safe streaming traversal.
Coding interviews
Discuss the question ↗Under exactly which BST assumptions may the search discard one subtree, and when is its complexity linear?
Coding interviews
Discuss the question ↗Trace the complete program for state bst search assumptions explicitly. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a reusable BST container that prevents invalid construction. Define duplicate insertion, balancing, comparer ownership and mutation visibility. Explain when a sorted array or a framework sorted collection would be a better interview answer than writing a tree from scratch.
Coding interviews
Discuss the question ↗Why can BFS return the fewest-hop route but not the minimum-cost route in the supplied graph?
Coding interviews
Discuss the question ↗Trace the complete program for choose hops or cost before choosing a path algorithm. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a route API that exposes its metric, unreachable result and tie policy. State whether negative weights are valid and how overflow of accumulated cost is handled. Refer to the existing algorithms course for Dijkstra mechanics instead of duplicating it here.
Coding interviews
Discuss the question ↗What does the keyset continuation mean, and why does a bounded result page not bound this in-memory query work?
Coding interviews
Discuss the question ↗Trace the complete program for bound keyset pagination and continuation rules. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a timestamp-plus-ID continuation with a signed token and an indexed backing store. Define lexicographic comparison, tenant binding and expiry. Separate the bounded returned page from database work and explain which consistency guarantees remain unprovided.
Coding interviews
Discuss the question ↗Why does the quoted-field parser need a distinct after-quote state, and how do its length and field limits differ?
Coding interviews
Discuss the question ↗Trace the complete program for parse quoted fields with an explicit state machine. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a chunked parser that can stop in the middle of a doubled quote or UTF-8 sequence. Define retained state, byte versus character limits and error position reporting. Explain which responsibilities belong to decoding and which belong to field grammar.
Coding interviews
Discuss the question ↗Which comparator laws are exercised, and why is subtraction unsafe even when a sort appears to work on small values?
Coding interviews
Discuss the question ↗Trace the complete program for test comparator laws instead of subtracting. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a comparer for score descending, timestamp ascending and unique ID ascending. Explain how the final key stabilizes ties and how nulls are ordered. Add focused law fixtures rather than assuming a successful sort proves comparator correctness.
Coding interviews
Discuss the question ↗How do a filtered copy and RemoveAll differ in ownership, aliasing and allocation despite returning the same kept values?
Coding interviews
Discuss the question ↗Trace the complete program for debug mutation by choosing ownership. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Review an API returning a mutable List that callers may retain. Propose either a documented transfer of ownership or an immutable snapshot boundary, and discuss allocation, aliasing and synchronization rather than merely rewriting foreach as a for loop.
Coding interviews
Discuss the question ↗Why must widening and checked arithmetic occur at the actual billing multiplication, and which failures remain distinct?
Coding interviews
Discuss the question ↗Trace the complete program for reject overflow with a deliberate billing contract. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a batch billing operation that must either publish all line totals or none. Specify rounding units, accumulation overflow and error reporting. Explain why local checked arithmetic alone does not provide transactional storage or external-payment idempotency.
Coding interviews
Discuss the question ↗Why do UTF-16 length, Rune count and text-element count disagree for this sample, and what unit does truncation preserve?
Coding interviews
Discuss the question ↗Trace the complete program for clarify unicode units before truncating. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a username-length rule that also handles normalization, case comparison and security-sensitive lookalikes. State which rules are product decisions and which Unicode units you measure; do not claim grapheme-aware truncation solves spoofing or terminal column width.
Coding interviews
Discuss the question ↗What does injecting TimeProvider make testable here, and why does the manual clock not claim to control timers?
Coding interviews
Discuss the question ↗Trace the complete program for make a timed take-home policy testable. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a take-home submission service that records authoritative receipt time, supports retries and explains deadline appeals. Separate time measurement, durable acceptance and user-visible feedback instead of allowing the browser clock to decide final admission.
Coding interviews
Discuss the question ↗What behavior must remain stable when extracting this pure order decision, and what consistency problem remains outside it?
Coding interviews
Discuss the question ↗Trace the complete program for refactor review code around a pure decision. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design the boundary between this decision and an atomic persistence operation. Decide who owns concurrency checks, idempotency keys and logging redaction. Explain why dependency injection should support that boundary rather than replace the business contract.
Coding interviews
Discuss the question ↗Why does the bounded duplicate-request ledger check an existing key before capacity, and what does payload conflict mean?
Coding interviews
Discuss the question ↗Trace the complete program for bound duplicate-request decisions honestly. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a durable multi-replica operation with request fingerprinting and an explicit retention horizon. Identify transaction boundaries, in-progress states and crash recovery, while refusing to claim that a dictionary or a local file makes arbitrary external effects exactly once.
Coding interviews
Discuss the question ↗Why is the nested-loop first-unique oracle useful despite being slower, and what does passing generated cases fail to prove?
Coding interviews
Discuss the question ↗Trace the complete program for use a differential oracle and generated cases. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a testing portfolio with boundary examples, generated cases and invariants. Decide how to report the smallest reproducible failing input, and distinguish property-based testing with shrinking from this simple deterministic differential harness.
Coding interviews
Discuss the question ↗Who owns the enumerators inside the lazy paired-stream operation, and what happens when the consumer stops early?
Coding interviews
Discuss the question ↗Trace the complete program for own enumerators when consumers stop early. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a lazy API over files or network records with cancellation and explicit ownership. Decide whether callers can enumerate twice, which exceptions escape during iteration and whether a snapshot alternative is worth its allocation and early resource release.
Coding interviews
Discuss the question ↗What does the senior cache policy account for, and why is its byte counter not a complete managed-memory limit?
Coding interviews
Discuss the question ↗Trace the complete program for defend a bounded-cache policy with a senior rubric. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Design a rubric comparing entry bounds, payload bounds, eviction, TTL, consistency and operational complexity. Prioritize a measurable requirement, state assumptions and propose evidence for the chosen tradeoff rather than listing fashionable distributed components.
Coding interviews
Discuss the question ↗Which contracts must agree across parsing, aggregation, ranking and paging in the interview capstone?
Coding interviews
Discuss the question ↗Trace the complete program for deliver a checked interview capstone. State the exact stdout, then justify the state transitions and relevant edge conditions.
Coding interviews
Discuss the question ↗Present a time-boxed review explaining acceptance criteria, cost and one production extension. Choose whether to stream parsing, persist totals or sign continuation tokens, and state what additional tests and ownership rules that one extension would require.
Coding interviews
Discuss the question ↗Why can an old object keep a new child alive during a minor collection?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you distinguish allocation pressure from retained cache entries?
Memory & GC
Discuss the question ↗Why can a cycle be collectible while a tiny cache entry retains megabytes?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you prove that deleting one cache entry releases the intended object graph?
Memory & GC
Discuss the question ↗Does a static cancellation callback avoid retaining its explicit state?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you bound memory retained by slow asynchronous operations?
Memory & GC
Discuss the question ↗Why does 60 MiB of free heap space not prove a 40 MiB allocation can succeed?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you evaluate large-buffer reuse without hiding retained memory?
Memory & GC
Discuss the question ↗How do pinning an existing array and allocating a pinned array differ?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you design buffer ownership around an asynchronous native operation?
Memory & GC
Discuss the question ↗Why can a finalizable wrapper retain a large managed child longer than expected?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you release a native handle without relying on finalizer timing?
Memory & GC
Discuss the question ↗Why can caching twelve bytes as ReadOnlyMemory retain a megabyte?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗When should an asynchronous API accept Memory versus take ownership of IMemoryOwner?
Memory & GC
Discuss the question ↗Why can an object remain reachable but become invalid to use after Return?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you prove pool safety across success, cancellation and exceptions?
Memory & GC
Discuss the question ↗How can an app allocate gigabytes per minute while its live heap stays bounded?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you compare two implementations with repeatable allocation and latency evidence?
Memory & GC
Discuss the question ↗Why can a bounded channel still accompany unbounded retained memory?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you design admission, buffer ownership and cancellation for an overloaded upload API?
Memory & GC
Discuss the question ↗Why does enabling server GC not prove a container will stay below its memory limit?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you compare GC modes under a fixed production-sized workload and quota?
Memory & GC
Discuss the question ↗Why is a flat managed live heap insufficient to dismiss a process-memory incident?
Memory & GC
Discuss the question ↗Trace the portable program: what is guaranteed, and what does it not measure?
Memory & GC
Discuss the question ↗How would you run a repeatable memory investigation across several service replicas?
Memory & GC
Discuss the question ↗