Zensar Technologies OA 2025 | Retail POS Transaction Matching & Cloud Compute Buffer Threshold

Problem 1 - Retail POS Transaction Matching Problem Statement You are given a sorted integer array transactionAmounts representing daily retail transactions and an integer targetSettlement. Find two distinct transactions whose sum equals targetSettlement. Return their 1-based indices. It is guaranteed that exactly one valid answer exists. Constraints Constraint 2 ≤ N ≤ 30,000 -1000 ≤ transactionAmounts[i] ≤ 1000 -2000 ≤ targetSettlement ≤ 2000 Example Input Output transactionAmounts = [2,7,11,15] targetSettlement = 9 [1,2] Problem 2 - Cloud Compute Buffer Threshold ...