package
1.6.6
Repository: https://github.com/awesee/leetcode.git
Documentation: pkg.go.dev

# README

< Previous                  Next >

344. Reverse String (Easy)

Write a function that reverses a string. The input string is given as an array of characters s.

 

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:

 

Follow up: Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.

Related Topics

[Recursion] [Two Pointers] [String]

Similar Questions

  1. Reverse Vowels of a String (Easy)
  2. Reverse String II (Easy)

Hints

Hint 1 The entire logic for reversing a string is based on using the opposite directional two-pointer approach!