Code Room
CodingEasycod-g1243
Subject HashingLevel Entry–Mid~10 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Two listeners merged their playlists by simple concatenation, so some songs now appear multiple times. Write a function that cleans the merged playlist: keep only the first occurrence of each song id and drop every later repeat, preserving the original order of those first occurrences. For example, ["a", "b", "a", "c", "b"] becomes ["a", "b", "c"]. The order of the surviving entries must not change, so sorting is not an option.

Implement
dedupe_playlist(songs: list[str]) → list[str]
Examples
in[["a","b","a","c","b"]]out["a","b","c"]
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.