Solving Leetcode Problems - 796. Rotate String

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 rightmost position.

For example, if s = "abcde", then it will be "bcdea" after one shift.

---

LeetCode is a platform that provides a collection of coding challenges, typically in the form of algorithmic problems and data structure exercises. It is widely used by programmers, software engineers, and those preparing for technical interviews. The platform covers a variety of topics, including but not limited to arrays, strings, linked lists, trees, dynamic programming, and graph algorithms. It allows to discover proven strategies and tackle real-world coding challenges that top tech companies love to throw your way during interviews.Sharpen your skills with a diverse range of problems covering arrays, strings, trees, and more. Become a coding virtuoso with hands-on experience in essential algorithms and data structures.