Salesforce SDE OA2024 | Minimize Malware Spread & Partition Array Into Two Equal Halves

Problem 1 - Network Virus Spread Problem Statement You are given a network of N computers represented by an N × N adjacency matrix graph. graph[i][j] = 1 indicates that computer i and computer j are directly connected. You are also given an array initial containing the computers initially infected by a virus. The virus spreads throughout all connected computers. You are allowed to permanently patch and immunize exactly one infected computer before the virus spreads. Return the index of ...