CodingEasycod-g1226

Subject Data wranglingLevel Entry–Mid~11 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

An online quiz logs every submission in arrival order as rows "student,answer". Only a student's FIRST submission counts; later ones are ignored. Return the counting rows — one per student, the first they sent — in the order those students first appeared. Example: ["ava,B", "raj,C", "ava,D"] gives ["ava,B", "raj,C"].

Implement

first_submissions(rows: list[str]) → list[str]

Examples

in[["ava,B","raj,C","ava,D"]]out["ava,B","raj,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.

Learn the concepts

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.