Amazon | 23rd Aug 2025 | OA | | Minimize Finish Time | Binary Ad Visibility | Greedy Array Grouping & Bit Manipulation | Aug 23rd Campus Assessment

Question 1: Minimize Finish Time Problem Statement: You are given two arrays: arr1 of size n and arr2 of size 4 * n. Your task is to divide arr2 into n groups, with 4 elements in each group, and assign each group to one element in arr1. Each element in arr1 represents a base time. When you assign a group to a base time, each of the 4 elements in that group is added to the base time to produce ...