<p>You are given a string <code>s</code>. Reorder the string using the following algorithm:</p>
<ol>
<li>Pick the <strong>smallest</strong> character from <code>s</code> and <strong>append</strong> it to the result.</li>
<li>Pick the <strong>smallest</strong> character from <code>s</code> which is greater than the last appended character to the result and <strong>append</strong> it.</li>
<li>Repeat step 2 until you cannot pick more characters.</li>
<li>Pick the <strong>largest</strong> character from <code>s</code> and <strong>append</strong> it to the result.</li>
<li>Pick the <strong>largest</strong> character from <code>s</code> which is smaller than the last appended character to the result and <strong>append</strong> it.</li>
<li>Repeat step 5 until you cannot pick more characters.</li>
<li>Repeat the steps from 1 to 6 until you pick all characters from <code>s</code>.</li>
</ol>
<p>In each step, If the smallest or the largest character appears more than once you can choose any occurrence and append it to the result.</p>
<p>Return <em>the result string after sorting </em><code>s</code><em> with this algorithm</em>.</p>