BlackRock OA 2025 | Pair Sums, Matrix Transpose & Stack Validation

Problem 1 - Corporate Dividend Pay-Out Calculations Problem Statement You are managing an equity dividend dispatch queue. You are given an array of positive integers stockHoldings, where each value represents the number of shares owned by a client. You are also given an integer targetBonus. Find the total number of unique client pairs whose combined holdings equal exactly targetBonus. A pair can only use two different indices and should be counted once regardless of order. In other words, (A, B) ...