Technical Screen
Nearest-Duplicate-Within-K, Then a DFS Question I Didn't Finish
MetaSoftware Engineer · Technical Screen · Aug 2025
The first question was to find the nearest matching numbers in an array, where the index distance needs to be within k. Honestly a pretty simple question — basically just use a map to store value-to-index, then do one pass through the array. The follow-up was how to improve the space complexity. My first thought was that I'd need to clear out the earlier entries in the map, so she had me write th…
Shared by a candidate · reported Aug 2025. Interview formats change; use it as a guide, not a script.