Leetcode - Reverse String Solution — The Poor Coder

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

Example 1:

Text

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

Example 2:

Text

Input: s = ["H","a","n","n","a","h"]
Output: ["h","a","n","n","a","H"]

Constraints:

1 <= s.length <= 10⁵
s[i] is a printable ascii character.

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.

Solution in python#

Python

class Solution:
    def reverseString(self, s: List[str]) -> None:
        s.reverse()
        """
        Do not return anything, modify s in-place instead.
        """

May 022021

Leetcode - Long Pressed Name Solution

Your friend is typing his name into a keyboard. Sometimes, when typing a character c, the key might get long pressed, and the character will be typed 1 or more times. You examine the typed characters of the keyboard…

leetcode Two Pointers string1 min read

Apr 242021

Leetcode - Reverse Vowels of a String Solution

Given a string s, reverse only all the vowels in the string and return it. The vowels are 'a', 'e', 'i', 'o', and 'u', and they can appear in both cases. Example 1: Example 2: Constraints: 1 <= s.length <= 3 * 105 s…

leetcode Two Pointers string1 min read

Mar 202021

Leetcode - Implement strStr() Solution

Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Clarification: What should we return when needle is an empty string? This is a great question…

leetcode Two Pointers string1 min read

Solution in python#

Related posts

Leetcode - Long Pressed Name Solution

Leetcode - Reverse Vowels of a String Solution

Leetcode - Implement strStr() Solution