← Flipkart questions

Find the connected component with the largest sum of priorities.

Filed under Flipkart

Given n nodes with individual priority values and m undirected edges, find the connected component that has the maximum total sum of priorities.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Flipkart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.