Code Room
CodingMedium
Question
Given a list of non-negative integers nums, arrange them so that concatenating their decimal representations forms the largest possible number, and return that number as a string. If the result would be all zeros (e.g. [0, 0]), return "0".
Implement
largest_concat_number(nums: list[int]) → strExamples
in
[[10,2]]out"210"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.