Rotate the array to the right by k steps with Python

Question: Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.

Approach: We use slicing to extract the last k elements (nums[-k:]) and concatenate them with the elements from the beginning up to k (nums[:-k]). This effectively rotates the list in place by k positions.

The modified list is assigned back to nums[:] to update it in place.

Time Complexity: O(n)

Space Complexity: O(1)

#softwareengineer #interviewpreparation #dsa