Reverse String In Place With O(1) Extra Memory
Reverse String: Use two pointers, one at start & end, swap elements & increment left, decrement right until left < right. Time complexity O(n), space complexity O(1).
344. Reverse String Difficulty: Easy Topics: Two Pointers, String Write a function that reverses a string. The input string is given as an array of characters s. You must do this by modifying the input array in-place with O(1) extra memory. Example 1: Input: s = ["h","e","l","l","o"] Output: ["o","l","l","e","h"] Example 2: Input: s = ["H","a","n","n","a","h"] Output: ["h","a","n","n","a","H"] Constraints: 21 <= s.length <= 105 s[i] is a printable ascii character. Hint: The entire logic for reversing a string is based on using the opposite directional two-pointer approach! Solution: To...