def merge_sources(sources: list[list[str]]) -> list[str]:
Online assessment (NXT Engineering Test): the first of two coding problems.
You are given sources, a 2D array of strings. Each row is one source: a list of key-value entries such as P1:a. Return a 1D array of strings with one value per key, where
sources:
P1:a P3:b P5:x
P1:b P2:q P5:x
output: b b x q
The keys first appear in the order P1, P3, P5, P2. P1's value a from the first source is overridden by the second source's b, but P1 keeps its first position.
"KEY:value" string per entry (as here), or key and value in separate cells, and whether spaces can sit around the colon (the post writes both P1: a and P3:b);One report, from October 2025, of Citadel's NXT Engineering Test online assessment: 90 minutes for two coding problems and eight multiple-choice questions. The poster found this first problem's description convoluted but the problem itself simple string processing. The second coding problem was a shortest path from the top-left to the bottom-right of a 2D array, which the poster described as a simple DFS. The multiple-choice questions covered debugging, caching and locks, which the poster compared to undergraduate operating systems and distributed systems courses, and did not find very hard.
Online assessment (NXT Engineering Test): the first of two coding problems.
You are given sources, a 2D array of strings. Each row is one source: a list of key-value entries such as P1:a. Return a 1D array of strings with one value per key, where
sources:
P1:a P3:b P5:x
P1:b P2:q P5:x
output: b b x q
The keys first appear in the order P1, P3, P5, P2. P1's value a from the first source is overridden by the second source's b, but P1 keeps its first position.
"KEY:value" string per entry (as here), or key and value in separate cells, and whether spaces can sit around the colon (the post writes both P1: a and P3:b);Observed variants: Given a 2D array of sources with key-value pairs (e.g., P1:a, P3:b, P5:x), return a 1D array of values in order of first appearance, where later occurrences of the same key override earlier values.
Send them this page. It is free to read, no account needed.
What you just read — canonical solution, follow-up arc, what passing candidates actually did — exists for all 62 Citadel questions, refreshed monthly from new candidate reports.