How are strings represented in memory in Go, why does `s[i]` return a `byte` while `for _, r := range s` yields a `rune`, when does `string(byteSlice)` avoid.

A strong answer

A strong candidate frames How are strings represented in memory in Go, why does s[i] return a byte while for _, r := range s yields a rune, when does string(byteSlice) avoid. around the exact memory layout, compiler semantics, and hardware execution model covered in [16-Byte Strings, UTF-8 Runes, and Zero-Copy strings.Builder]. Explain the 16-byte (ptr, len) string header, UTF-8 byte vs rune indexing, compiler zero-copy optimizations for m[string(b)], and strings.Builder + Grow().

A developer writes if len(username) <= 10 and truncates a display name with short := username[:10]. When a Japanese user or someone with an emoji ('Go🚀') signs up, len('Go🚀') returns 6 instead of 3, and username[:4] slices the 4-byte UTF-8 emoji '🚀' (0xF0 0x9F 0x9A 0x80) right in the middle—emitting invalid UTF-8 replacement garbage '�' that breaks downstream JSON/Postgres parsers!

When engineers encounter this bottleneck in production, a surface-level API description rarely explains what went wrong. In real workloads, every line of code executes against concrete hardware constraints: fixed-width memory cells, CPU cache lines, kernel descriptor tables, network socket buffers, or accelerator memory buses. Without a clear mental model of Go's 16-byte immutable string header, UTF-8 rune decoding, and strings.Builder, debugging degrades into guesswork—tuning timeouts, adding retries, or scaling instances blindly while the underlying architectural flaw remains untouched.

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: Trace Go's 16-byte (ptr, len) string header and distinguish $O(1)$ byte indexing (s[i]) from $O(N)$ UTF-8 rune iteration (range s).
• Mastery of core invariant: Build strings in $O(N)$ time with zero final copy using strings.Builder and explain why copying a non-empty Builder panics.
• Mastery of core invariant: Leverage Go compiler zero-allocation optimizations for m[string(byteSlice)] map lookups.
• 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.