Watch 10 video solutions for Perform String Shifts, a easy level problem involving Array, Math, String. This walkthrough by Techdose has 17,027 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
You are given a string s containing lowercase English letters, and a matrix shift, where shift[i] = [directioni, amounti]:
directioni can be 0 (for left shift) or 1 (for right shift).amounti is the amount by which string s is to be shifted.s and append it to the end.s and add it to the beginning.Return the final string after all operations.
Example 1:
Input: s = "abc", shift = [[0,1],[1,2]] Output: "cab" Explanation: [0,1] means shift to left by 1. "abc" -> "bca" [1,2] means shift to right by 2. "bca" -> "cab"
Example 2:
Input: s = "abcdefg", shift = [[1,1],[1,1],[0,2],[1,3]] Output: "efgabcd" Explanation: [1,1] means shift to right by 1. "abcdefg" -> "gabcdef" [1,1] means shift to right by 1. "gabcdef" -> "fgabcde" [0,2] means shift to left by 2. "fgabcde" -> "abcdefg" [1,3] means shift to right by 3. "abcdefg" -> "efgabcd"
Constraints:
1 <= s.length <= 100s only contains lower case English letters.1 <= shift.length <= 100shift[i].length == 2directioni is either 0 or 1.0 <= amounti <= 100