// Problem Statement: Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s. // A shift on s consists of moving the leftmost character of s to the ...