<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:
static bool comp(string &s1,string &s2)
{
    int n=s1.size();
    int m=s2.size();
    int i=0,j=0;
    while(s1[i]!=' ')i++;
    while(s2[j]!=' ')j++;
    i++;
    j++;
    while(i<n&&j<m)
    {
        if(s1[i]==s2[j])
        {
              i++;
                j++;
                continue;
        }
        else if(s1[i]>s2[j])return false;
        else return true;
     

    }
    
    if(i<n)return false;
    if(j<m)return true;
    

    return s1<s2;
}
    vector<string> reorderLogFiles(vector<string>& s) {
        vector<string>let,dig;
        for(int i=0;i<s.size();i++)
        {
            string ans=s[i];
             for(int j=0;j<ans.size()-1;j++)
             {
                
                if(ans[j]==' ')
                {
                    if(ans[j+1]>='0'&&ans[j+1]<='9')
                    {
                        dig.push_back(s[i]);
                        break;
                    }
                     else
                {
                    let.push_back(s[i]);
                    break;
                }
                }
               
             }
        }
        sort(let.begin(),let.end(),comp);
        let.insert(let.end(),dig.begin(),dig.end());

        return let;

        
    }
};
13092