Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 796 with 30 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 796 # by problem number
lcpy gen -s rotate_string # by problem name
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.
s = "abcde", then it will be "bcdea" after one shift.Input: s = "abcde", goal = "cdeab"
Output: true
Input: s = "abcde", goal = "abced"
Output: false
class Solution:
# Time: O(n)
# Space: O(n)
def rotate_string(self, s: str, goal: str) -> bool:
return len(s) == len(goal) and goal in s + s
| Time | Space |
|---|---|
| O(n) | O(n) |