Reverse vowels of a String | LeetCode problem 345

Reverse vowels of a String
Leetcode problem number 345
Solution in JAVA

JAVA interview programming playlist:

#java #interviewquestions #leetcode

[siddheshb.kukade]

class Solution {
public:
bool isVowel(char ch){
ch = tolower(ch);
if(ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u')
return true;
return false;
}
string reverseVowels(string ch) {
//using two pointers start and end;
int start=0, end=ch.size()-1;
while(start<=end){
bool isLowVowel = isVowel(ch[start]);
bool isHighVowel = isVowel(ch[end]);

if(isLowVowel && isHighVowel){
// now both the pointers must be on vowels
char temp = ch[start];
ch[start] = ch[end]; /// SWAP
ch[end] = temp;
start++; end--;
}
if(!isLowVowel){
start++;
}
if(!isHighVowel){
end--;
}
}
return ch;
}
};

[rojidansari]

Great explanation👍👍
Plz upload more such problem

[khushiprasad]

Thanks for the explanation, the concept is clear. Although the time complexity will be too high for this, leet code doesn't accept this solution. Needs optimization.

[smasifhossain]

Your solution will not be accepted in Leetcode

[raadali]

Why are you not uploading leetcode problem