<p>Given a string <code>s</code>, reverse only all the vowels in the string and return it.</p>

<p>The vowels are <code>&#39;a&#39;</code>, <code>&#39;e&#39;</code>, <code>&#39;i&#39;</code>, <code>&#39;o&#39;</code>, and <code>&#39;u&#39;</code>, and they can appear in both lower and upper cases, more than once.</p>

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

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s = &quot;IceCreAm&quot;</span></p>

<p><strong>Output:</strong> <span class="example-io">&quot;AceCreIm&quot;</span></p>

<p><strong>Explanation:</strong></p>

<p>The vowels in <code>s</code> are <code>[&#39;I&#39;, &#39;e&#39;, &#39;e&#39;, &#39;A&#39;]</code>. On reversing the vowels, s becomes <code>&quot;AceCreIm&quot;</code>.</p>
</div>

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

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s = &quot;leetcode&quot;</span></p>

<p><strong>Output:</strong> <span class="example-io">&quot;leotcede&quot;</span></p>
</div>

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

<ul>
	<li><code>1 &lt;= s.length &lt;= 3 * 10<sup>5</sup></code></li>
	<li><code>s</code> consist of <strong>printable ASCII</strong> characters.</li>
</ul>

class Solution {
public:
    bool isVowel(char i){
            if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u' or
               i=='A' or i=='E' or i=='I' or i=='O' or i=='U'){
                   return true;
               }
            return false;
    }
    string reverseVowels(string s) {
        
      int i=0, j=s.size()-1;

      while(i<j){

          if(isVowel(s[i]) and isVowel(s[j])){
              if(s[i]==s[j]){
                  j--;
                  i++;
              }
              else{
                  swap(s[i],s[j]);
                  i++;j--;
              }
          }
          else if(isVowel(s[i]) and !isVowel(s[j])){
              j--;
          }
          else{
              i++;
          }
      }
      return s;
    }
};
9100