LeetCode 2000 Solution - Reverse Prefix of Word #javascript #coding

preview_player
Показать описание
#leetcode #javascript #coding #tutorial #shorts #asmr
LeetCode 2000 - Reverse Prefix of Word

Description: 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.

For example, if word = "abcdefd" and ch = "d", then you should reverse the segment that starts at 0 and ends at 3 (inclusive). The resulting string will be "dcbaefd".

Return the resulting string.
Рекомендации по теме
Комментарии
Автор

LeetCode 2000 - Reverse Prefix of Word

Description: 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.

For example, if word = "abcdefd" and ch = "d", then you should reverse the segment that starts at 0 and ends at 3 (inclusive). The resulting string will be "dcbaefd".

Return the resulting string.

theengineeringnotes
join shbcf.ru