WELLS FARGO Hiring | Off Campus OA (2024) | Maximum Number of Achievable Transfer Requests

Problem Statement A company has n buildings numbered from 0 to n-1. Each transfer request is represented as:   requests[i] = [from, to] where: from = source building to = destination building An employee wants to move from building from to building to. A set of requests is considered achievable if, after performing all selected requests: Every building ends up with the same number of employees it started with. In other words, for every building: Incoming Transfers = Outgoing Transfers ...