CodingMediumcod-g389

Subject StringsLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a string s of lowercase letters (1 <= len(s) <= 500), rearrange its characters so that no two ADJACENT characters are the same and return any such arrangement. If it is impossible, return the empty string. For these tests the reference uses a deterministic max-heap tie-broken by lowest character.

Implement

reorganize_string(s: str) → str

Examples

in["aab"]out"aba"

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.