CodingHardcod-g610

Subject Suffix structuresLevel Senior–Staff~38 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a string s, return its lexicographically smallest suffix (the suffix that would sort first among all suffixes of s). 1 <= len(s) <= 50000, lowercase letters. Example: for 'banana' the suffixes sorted are a < ana < anana < banana < na < nana, so the answer is 'a'.

Implement

smallest_suffix(s: str) → str

Examples

in["banana"]out"a"

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.