Quick Overview

Count the transitive connected groups represented by a symmetric relationship matrix. Candidates should explain graph traversal or union techniques, visited-state correctness, dense-matrix complexity, and why direct neighbor counts do not reveal component count.

Count Connected Groups in a Relationship Matrix

Company: Visa

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Online Assessment

Overview: Count the transitive connected groups represented by a symmetric relationship matrix. Candidates should explain graph traversal or union techniques, visited-state correctness, dense-matrix complexity, and why direct neighbor counts do not reveal component count.

Read the full Visa Software Engineer interview experience this question came from

Loading…