LeetCode 541 | Reverse String II | Algorithm Explained (Java)
The description reads:
"Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and left the other as original.
Input: s = "abcdefg", k = 2
Output: "bacdfeg"
"
Running Time: O(N)
Space Complexity: O(N)
FOLLOW ME:
Slack Channel: https://join.slack.com/t/xavierelonle...
Github: https://github.com/xavierelon1
Facebook: / xavier.hollingsworth.3
Instagram: / xavierelon
LinkedIn: / xavier-hollingsworth-524144127
Twitter: / elon_xavier
On this page of the site you can watch the video online LeetCode 541 | Reverse String II | Algorithm Explained (Java) with a duration of hours minute second in good quality, which was uploaded by the user Xavier Elon 15 August 2020, share the link with friends and acquaintances, this video has already been watched 6,839 times on youtube and it was liked by 84 viewers. Enjoy your viewing!
