0

37/38 test cases are passed

Code:

class Solution:
    def rotate(self, nums: List[int], k: int) -> None:

        for i in range(1, k+1):
            nums[:] = nums[-1:] + nums[0:-1]
Vinayak S
  • 1
  • 1
  • 1
  • What's the requirement for it? Could not expect everyone has access to leetcode! – Daniel Hao Jun 03 '22 at 15:05
  • Please clarify your specific problem or provide additional details to highlight exactly what you need. As it's currently written, it's hard to tell exactly what you're asking. – Community Jun 03 '22 at 15:07

0 Answers0