Array Rotation | Temporary Variable

Different Approaches to Perform an Array Rotation Approach 2 - Temporary variable algorithm for rotate the array to the left or right by 'r' steps, where 'r' is non-negative. Problem: We have an array consisting of Integers ∈ Z of size (n) and a positive integer of rotation count (r) ∈ Z+. We are allowed to shift each of the array's elements by one position. We have to perform left or right rotations in an array. Algorithm Concept: Left Rotation Store the element of first position in a temporary variable and then shifts each rest element of the array towards its left by one position and finally store the temporary value to the last position of the array for 'r' times. Right Rotation Store the element of last position in a temporary variable and then shifts each rest element of the array towards its right by one position and finally store the temporary value to the first position of the array for 'r' times. Outline (check the comment section for a clickable version): 00:00 : Introduction 00:11 : Left Rotation | Algorithm Steps 01:15 : Time and Auxiliary Space Complexity Analysis 02:18 : Right Rotation | Algorithm Steps 02:48 : Animation Example 04:47 : Code Implementation of Algorithm Code Available At: https://sites.google.com/view/arrayrotatetemporaryvariable Other Approaches: Approach 1 - Using Brute Force - https://youtu.be/72Zelk_XCy8 Approach 3 - Using Auxiliary Array - https://youtu.be/HXhgfPdjWG0 Approach 4 - Using Juggling Algorithm - https://youtu.be/VEUta79Lt2c Approach 5 - Using Reversal Algorithm - https://youtu.be/m6dS2R9A7Tg Approach 6 - Using Block Swap Algorithm - https://youtu.be/lzL4w624N_Y