<p>You are given an array of <code>logs</code>. Each log is a space-delimited string of words, where the first word is the <strong>identifier</strong>.</p>

<p>There are two types of logs:</p>

<ul>
	<li><b>Letter-logs</b>: All words (except the identifier) consist of lowercase English letters.</li>
	<li><strong>Digit-logs</strong>: All words (except the identifier) consist of digits.</li>
</ul>

<p>Reorder these logs so that:</p>

<ol>
	<li>The <strong>letter-logs</strong> come before all <strong>digit-logs</strong>.</li>
	<li>The <strong>letter-logs</strong> are sorted lexicographically by their contents. If their contents are the same, then sort them lexicographically by their identifiers.</li>
	<li>The <strong>digit-logs</strong> maintain their relative ordering.</li>
</ol>

<p>Return <em>the final order of the logs</em>.</p>

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

<pre>
<strong>Input:</strong> logs = [&quot;dig1 8 1 5 1&quot;,&quot;let1 art can&quot;,&quot;dig2 3 6&quot;,&quot;let2 own kit dig&quot;,&quot;let3 art zero&quot;]
<strong>Output:</strong> [&quot;let1 art can&quot;,&quot;let3 art zero&quot;,&quot;let2 own kit dig&quot;,&quot;dig1 8 1 5 1&quot;,&quot;dig2 3 6&quot;]
<strong>Explanation:</strong>
The letter-log contents are all different, so their ordering is &quot;art can&quot;, &quot;art zero&quot;, &quot;own kit dig&quot;.
The digit-logs have a relative order of &quot;dig1 8 1 5 1&quot;, &quot;dig2 3 6&quot;.
</pre>

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

<pre>
<strong>Input:</strong> logs = [&quot;a1 9 2 3 1&quot;,&quot;g1 act car&quot;,&quot;zo4 4 7&quot;,&quot;ab1 off key dog&quot;,&quot;a8 act zoo&quot;]
<strong>Output:</strong> [&quot;g1 act car&quot;,&quot;a8 act zoo&quot;,&quot;ab1 off key dog&quot;,&quot;a1 9 2 3 1&quot;,&quot;zo4 4 7&quot;]
</pre>

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

<ul>
	<li><code>1 &lt;= logs.length &lt;= 100</code></li>
	<li><code>3 &lt;= logs[i].length &lt;= 100</code></li>
	<li>All the tokens of <code>logs[i]</code> are separated by a <strong>single</strong> space.</li>
	<li><code>logs[i]</code> is guaranteed to have an identifier and at least one word after the identifier.</li>
</ul>

class Solution {
public:
    vector<string> reorderLogFiles(vector<string>& logs) {
        vector<string> result;
        vector<tuple<string, string, bool, int>> tuples;

        for(int idx=0; idx<logs.size(); idx++) {
            string log = logs[idx];

            string identifier = "";
            string actualStr = "";
            bool isAllDigits = false;
            bool isIdentifierFound = false;

            for(char ch : log){
                if(ch == ' ' && !isIdentifierFound){
                    isIdentifierFound = true;
                    continue;
                }

                if(isIdentifierFound){
                    actualStr += ch;
                    if(ch >= '0' && ch <= '9') isAllDigits = true;
                } else {
                    identifier += ch;
                }
            }

            tuples.push_back(make_tuple(identifier, actualStr, isAllDigits, idx));
        }

        sort(tuples.begin(), tuples.end(), [] (const tuple<string, string, bool, int> &a, tuple<string, string, bool, int> &b){
            if(get<2>(a) != get<2>(b)) return get<2>(a) < get<2>(b);

            if(get<2>(a) == 0){
                if(get<1>(a) == get<1>(b)) return get<0>(a) < get<0>(b);
                return get<1>(a) < get<1>(b);
            } else {
                return get<3>(a) < get<3>(b);
            }
        });

        for(tuple<string, string, bool, int> t : tuples) {
            result.push_back(get<0>(t) + " " + get<1>(t));
        }
        
        return result;
        
    }
};

// Input
// logs =
// ["1 n u", "r 527", "j 893", "6 14", "6 82"]

// Use Testcase
// Output
// ["1 n u","j 893","6 82","r 527","6 14"]
// Expected
// ["1 n u","r 527","j 893","6 14","6 82"]
15192