Array Rotations and Extremes Sum | Dataford Interview Questions

For an algorithm used in Tata Consultancy Services (North America) data-processing workflows, transform an integer array using two sequential rotations. First rotate the array left by left_k positions, then rotate the resulting array right by right_k positions. Return the final array and the sum of its smallest and largest elements.

A rotation wraps elements around the array boundary. Rotation counts may be larger than the array length, so reduce them using modulo arithmetic. The smallest and largest values should be determined from the input values, without sorting the array.

Formal Specification

Implement rotate_and_extremes(nums, left_k, right_k), where nums is a non-empty list of integers and left_k and right_k are non-negative integers. Return a two-element list: [rotated_nums, min(nums) + max(nums)].

Constraints

1 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
0 <= left_k, right_k <= 10^18
The input array is non-empty
Do not sort the array

Function Signature

def rotate_and_extremes(nums, left_k, right_k):

Your question is Array Rotations and Extremes Sum. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Formal Specification

Constraints

1 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
0 <= left_k, right_k <= 10^18
The input array is non-empty
Do not sort the array

Function Signature

def rotate_and_extremes(nums, left_k, right_k):

Your question is Array Rotations and Extremes Sum. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.