CodingEasycod-g1386

Subject StringsLevel Entry–Mid~12 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

A build tool groups artifacts by shared name endings. Given a list of file names, return their longest common suffix — the longest string that every name ends with. Return an empty string if the list is empty or the names share no common ending. For example, ['report_final.txt', 'summary_final.txt', 'final.txt'] share the suffix 'final.txt'.

Implement

common_suffix(names: list[str]) → str

Examples

in[["report_final.txt","summary_final.txt","final.txt"]]out"final.txt"

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.