Juspay SDE-1 Hiring Challenge 2025 | Maximum Weight Node, Nearest Meeting Cell & Largest Sum Cycle

Problem 1 - Maximum Weight Node Problem Statement You are given a directed graph with N nodes numbered from 0 to N - 1. The graph is represented using an array edges of size N, where: edges[i] = j denotes a directed edge from node i to node j. edges[i] = -1 means node i has no outgoing edge. The weight of a node is defined as the sum of the indices of all nodes pointing to it. Your task ...