Skip to content

Conversation

@arvinder004
Copy link

This PR adds an efficient algorithm to rotate an array to the right by [k] steps. The implementation uses the reversal method to achieve in-place rotation with O(n) time and O(1) space complexity. The function includes a docstring and an example usage block for clarity. This addition enhances the array algorithms collection and provides a common utility for array manipulation tasks.

@algorithms-keeper
Copy link

Closing this pull request as invalid

@arvinder004, this pull request is being closed as none of the checkboxes have been marked. It is important that you go through the checklist and mark the ones relevant to this pull request. Please read the Contributing guidelines.

If you're facing any problem on how to mark a checkbox, please read the following instructions:

  • Read a point one at a time and think if it is relevant to the pull request or not.
  • If it is, then mark it by putting a x between the square bracket like so: [x]

NOTE: Only [x] is supported so if you have put any other letter or symbol between the brackets, that will be marked as invalid. If that is the case then please open a new pull request with the appropriate changes.

@algorithms-keeper algorithms-keeper bot closed this Oct 2, 2025
@algorithms-keeper algorithms-keeper bot added the awaiting reviews This PR is ready to be reviewed label Oct 2, 2025
@arvinder004 arvinder004 deleted the rotate_array branch October 2, 2025 08:03
@arvinder004 arvinder004 restored the rotate_array branch October 2, 2025 08:04
@arvinder004 arvinder004 deleted the rotate_array branch October 2, 2025 08:06
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

awaiting reviews This PR is ready to be reviewed invalid

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant