Skip to content

Latest commit

 

History

History
12 lines (9 loc) · 430 Bytes

File metadata and controls

12 lines (9 loc) · 430 Bytes

Problem 3: Stack-Based Inversion (Reverse String - Recursive)

Problem Statement

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 (recursion stack excluded).

Input Format

  • An array of characters s.

Example

Input: s = ["h", "e", "l", "l", "o"]
Output: ["o", "l", "l", "e", "h"]