Tap here to switch tabs
Problem
Ask
Submissions

Problem: Reverse String

easy
15 min
Explore how to reverse a character array in-place without using extra memory. Learn to apply the two pointers pattern to efficiently handle string reversal problems under space constraints.

Statement

You are given a character array, s, representing a string. Write a function that reverses the array in-place.

  • The reversal must be done by modifying the original array directly.

  • You cannot use extra memory beyond a constant amount O(1)O(1).

Constraints

  • 11 <=<= s.length <=<= 10001000

  • Each s[i] is a printable ASCII character.

Tap here to switch tabs
Problem
Ask
Submissions

Problem: Reverse String

easy
15 min
Explore how to reverse a character array in-place without using extra memory. Learn to apply the two pointers pattern to efficiently handle string reversal problems under space constraints.

Statement

You are given a character array, s, representing a string. Write a function that reverses the array in-place.

  • The reversal must be done by modifying the original array directly.

  • You cannot use extra memory beyond a constant amount O(1)O(1).

Constraints

  • 11 <=<= s.length <=<= 10001000

  • Each s[i] is a printable ASCII character.