What are Las Vegas and Monte Carlo algorithms? Give an example of each

A strong answer

A strong candidate frames What are Las Vegas and Monte Carlo algorithms? Give an example of each around the exact memory layout, compiler semantics, and hardware execution model covered in Randomized algorithms. Contrast randomized algorithms that are always correct with ones that are always fast, and explain how repetition controls error.

A deterministic algorithm does the same thing every time on the same input. That makes it predictable, and predictability has a cost: if some input makes it slow, that input makes it slow every time, and anyone who knows the algorithm can find and send that input. A randomized algorithm makes some of its choices at random. Its behavior on a given input becomes a random variable, and its analysis asks two questions that hold for every input: what is the expected running time, and what is the probability of a wrong answer?

A Las Vegas algorithm is always correct, and its running time is random. Randomized quicksort is one: the output is always sorted, and only the time depends on the coin flips.

In a production interview, always connect the specification rule to its concrete runtime consequence: state what lives on the stack versus the heap or static storage segment, how the compiler or operating system validates alignments, lifetimes, and error codes, and what happens under adversarial or boundary inputs (such as zero-length buffers, integer overflow, concurrent mutation, or partial I/O). Backing your explanation with a small trace of register/memory state transitions immediately separates senior systems engineers from candidates who only memorized syntax.

What the interviewer is listening for

• Mastery of core invariant: Distinguish Las Vegas algorithms, always correct with random running time, from Monte Carlo algorithms, fast with a bounded error probability.
• Mastery of core invariant: Shuffle and sample uniformly with Fisher-Yates and reservoir sampling, and prove they are uniform.
• Mastery of core invariant: Use linearity of expectation and repetition to analyze and strengthen randomized algorithms.
• Hardware and ABI awareness: Explaining how sizes, alignments, calling conventions, or kernel boundaries behave on real 64-bit targets rather than relying on implementation-defined assumptions.
• Defensive engineering: Naming the exact compiler flags (-Wall -Wextra -Werror), static analyzers, or runtime sanitizers (-fsanitize=address,undefined,thread) that verify correctness in CI.

Common mistakes

• Explaining only surface syntax without tracing the underlying memory addresses, ownership lifetime, or kernel/user-space state transitions.
• Assuming undefined behavior (such as signed overflow, uninitialized reads, strict-aliasing violations, or dangling pointers) will "just work" because it passed an unoptimized -O0 debug build.
• Ignoring return codes, partial reads/writes, alignment padding, or cleanup paths when an allocation or syscall fails midway through a function.