Reverse Only Letters

In this video, I solved the LeetCode problem "Reverse Only Letters" using the Two Pointer Approach. Problem: Given a string s, reverse only the letters in the string. All non-letter characters should remain in their original positions. Approach: We use two pointers: * left pointer from the start * right pointer from the end Steps: * If the left character is not a letter, move left forward * If the right character is not a letter, move right backward * If both characters are letters, swap them * Continue until both pointers meet This keeps all special characters, digits, and symbols in the same position while reversing only letters. Time Complexity: O(n) Space Complexity: O(1) GitHub Link: https://github.com/Kumar-Aditya-DEV/Leetcode-Questions LeetCode Profile: https://leetcode.com/u/Aditya-Kumar-DEVP/ LinkedIn: https://www.linkedin.com/in/aditya-kumar-060ba6376/ Notes: * Uses Two Pointer Technique * Handles special characters correctly * In-place string manipulation * Beginner-friendly string problem Language: C++ If this helped you, Like, Share and Subscribe for more coding content. #leetcode #cpp #dsa #coding #strings #twopointers