InMobi SDE-1 OA | Connected Components in Graph & Group Anagrams

Problem 1 - Ad-Campaign Network Connectivity Problem Statement You are analyzing user tracking data across a mobile advertising network. You are given an integer N representing the total number of campaign hubs labeled from 0 to N - 1. You are also given a 2D integer array hubLinks where: hubLinks[i] = [u, v] indicates a bidirectional communication connection between hub u and hub v. A campaign cluster is defined as a group of hubs that can all reach one another ...