Скачать или смотреть 🔄 Reverse Vowels in a String | Leetcode 75 Explained! 🚀

🚀 Reverse Vowels in a String - Leetcode 75 Solution 💡

In this short, we solve the "Reverse Vowels of a String" problem using an efficient two-pointer approach. Let's break it down step by step!

🔹 Problem: Given a string s, we need to reverse only the vowels (a, e, i, o, u - both uppercase and lowercase) while keeping the rest of the string unchanged.

Step-by-Step Explanation:

1️⃣ Use a Set for Quick Lookup: We define a set of vowels (aeiouAEIOU) to quickly check if a character is a vowel.

2️⃣ Convert String to a List: Strings are immutable in Python, so we convert s into a list to allow modification.

3️⃣ Two-Pointer Approach:

One pointer (left) starts from the beginning and moves forward.

Another pointer (right) starts from the end and moves backward.

We keep moving these pointers until they both find a vowel.

4️⃣ Swap the Vowels: Once both left and right pointers find vowels, we swap them.

5️⃣ Return the Modified String: Finally, we join the list back into a string and return it.

Time Complexity:

⏳ O(N) – We scan the string once, making this an optimal solution!

📌 Example:

🔹 Input: "IceCreAm"
🔹 Output: "AceCreIm"

💻 Code Implementation: Watch the full video to understand every step! 🎥

💬 Comment below if you have any questions! 👇

🔥 Don't forget to LIKE, SHARE, and SUBSCRIBE for more Leetcode Shorts! 🚀

#Python #Leetcode #Coding #DSA #Programming #InterviewPrep #Leetcode75