<p>Given a list of non-negative integers <code>nums</code>, arrange them such that they form the largest number and return it.</p>

<p>Since the result may be very large, so you need to return a string instead of an integer.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [10,2]
<strong>Output:</strong> &quot;210&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,30,34,5,9]
<strong>Output:</strong> &quot;9534330&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
    string largestNumber(vector<int>& nums) {

        int n = nums.size();
        vector<string>str(n);
        string result = "";

        //convert nums from int to string
        for(int i = 0; i < n; i++){
            str[i] = to_string(nums[i]);
        }

         //lambda function to sort elements i.e; if ba > ab then swap.
        sort(str.begin(), str.end(), [](string& a, string& b) {
            return a + b > b + a;
        });
        
        //if all elements are 0 
        if (str[0] == "0") {
            return "0";
        }

         for(int i = 0; i < n; i++){
            result += str[i];
        }
        return result;

    }

};
17000