Plaid Software Engineer OA 2026 | Transaction Processing, Fraud Detection Graphs, Sliding Window & BFS

Problem 1 - Maximum Transaction Volume Problem Statement You are given a 2D integer array transactions where: transactions[i] = [day, amount] represents a transaction processed on a specific day. You are also given an integer k representing a rolling window of k consecutive days. The transaction volume of a day is the sum of the absolute values of all transaction amounts occurring on that day. Return the maximum total transaction volume contained within any k-day window. Constraints Constraint 1 ≤ ...