You are given an array of strings, where each string represents a non-negative integer. Rearrange the elements of the array such that when concatenated, they form the largest possible number. Return the result as a string.
Example:
Input: ["54", "546", "548", "60"]
Output: "6054854654"
Since the interviewer instructed me not to use any built-in functions, I implemented a bubble sort algorithm to arrange the given array of strings in decreasing order. After completing the sorting, I concatenated all the elements sequentially, which resulted in forming the largest possible number.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?