Build Maximum Integer from Subarray (Google India)

Problem Overview

• Build the largest possible integer by concatenating elements from any contiguous subarray of length k.
• Input: an array of digits and an integer k; Output: the maximum integer formed from one such subarray (e.g., [4, 9, 0, 2], k=2 -> 92).
• Context: Relevant to array processing and selecting optimal consecutive items in real-world data scenarios.
• Source: A Google India interview question from Google interviews, commonly seen as a coding interview problem.