TRT
Sign in
easyFoundationsconcept

Why does -1 compare greater than an unsigned int?

Explain the usual arithmetic conversions that promote a signed negative operand to unsigned, making it a huge positive value.

TRT practice prompt — not a verified question from a named employer.

The Runtime Theory Team2 min read
Learn it firstPrimitive Types and Integer EncodingsInspect binary representations of fundamental types, two's complement signed integer mechanics, and sign extension rules in memory.

A strong answer

A strong candidate frames Why does -1 compare greater than an unsigned int? around the exact memory layout, compiler semantics, and hardware execution model covered in Primitive Types and Integer Encodings. Explain the usual arithmetic conversions that promote a signed negative operand to unsigned, making it a huge positive value.

Modern programming languages often treat numbers as abstract mathematical entities that scale to any magnitude. In C, numbers are physical bit patterns stored in hardware registers and RAM cells of fixed width. When a programmer forgets that numbers have hardware boundaries, silent bugs occur.

Mathematically, -1 is less than 4. A developer reading this code expects "Offset is within safety bounds." to print every time.

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: Calculate two's complement binary representations for signed integers.
  • Mastery of core invariant: Differentiate between machine word sizes across LP64 and LLP64 data models.
  • Mastery of core invariant: Predict promotion behaviors when mixing signed and unsigned operands.
  • 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.

This answer walks

Practice follow-ups

  1. 01How can you avoid this class of comparison bugs?

More interviews in this topic

easy · languageWalk through the internal structure of a Go channel (`hchan`), explain the exact table of channel state behaviors (nil vs open vs closed for send, receive.easy · languageHow does Go's compiler decide whether a variable is allocated on the stack or the heap (Escape Analysis), why is returning a value `User` often faster than.easy · languageExplain how Go's Concurrent Tri-Color Mark-and-Sweep GC works—why doesn't Go use a compacting/generational GC like the JVM, how does the Hybrid Write Barrier.

Not started

Sign in to save your learning progress.

Sign in to save