796. Rotate String
Published
•1 min read
class Solution:
def rotateString(self, s: str, goal: str) -> bool:
return len(goal) == len(s) and goal in s * 2
Command Palette
Search for a command to run...
Comments
Join the discussionNo comments yet. Be the first to comment.
More from this blog
1382. Balance a Binary Search Tree
# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def balanceBST(self, root: TreeNode) -...
Feb 9, 20261 min read
3010. Divide an Array Into Subarrays With Minimum Cost I
class Solution: def minimumCost(self, nums: List[int]) -> int: return nums.pop(0) + sum(sorted(nums)[:2])
Feb 1, 20261 min read
3507. Minimum Pair Removal to Sort Array I
class Solution: def minimumPairRemoval(self, nums: List[int]) -> int: def checkSorted(arr): return arr == sorted(arr) def findAndMerge(arr): minSum = float("inf") trackIndex = -1 ...
Jan 24, 20261 min read
1877. Minimize Maximum Pair Sum in Array
class Solution: def minPairSum(self, nums: List[int]) -> int: ''' Sort it out Scan and track max sum ''' nums.sort() l = len(nums) maxSum = 0 for i in range(l//2): ...
Jan 24, 20261 min read
Solving a 2 Year Old Problem on Leetcode
Hey folks! Today I encounted a problem which I tried solving 2 years back (2023) Question Link → 1498. Number of Subsequences That Satisfy the Given Sum Condition So, looking at my 2 year old attempt, I wanted to challenge myself to solve it this ti...
Jun 29, 20254 min read
