Reverse Prefix of Word

Given a 0-indexed string word and a character ch, reverse the segment of word that starts at index 0 and ends at the index of the first occurrence of ch (inclusive). If the character ch does not exist in word, do nothing.

Return the resulting string.

Example 1
Inputword = "abcdefd", ch = "d"
Output"dcbaefd"
The first occurrence of "d" is at index 3, so reversing word from index 0 to 3 gives "dcbaefd".
Example 2
Inputword = "xyxzxe", ch = "z"
Output"zxyxxe"
The first and only occurrence of "z" is at index 3, so reversing word from index 0 to 3 gives "zxyxxe".

Constraints

  • 1 <= word.length <= 250
  • word consists of lowercase English letters.
  • ch is a lowercase English letter.

Asked at 5 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate