Count users over n connections

Q: Count users over n connections

This question evaluates a candidate's ability to process dynamic graphs and maintain degree counts under a stream of relationship events, covering coding and algorithms, stream processing, and appropriate data structure selection for scalability.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Given a stream of relationship events in the form [[user_a, user_b, op], ...], where op ∈ {"connect", "disconnect"}, treat connections as undirected edges. Process events in order, updating the current graph. After all events, return the count of users whose number of current connections is strictly greater than a given integer n. Specify and implement an efficient approach that handles up to 100,000 events and users appearing lazily.

Count users over n connections

Overview

Comments (0)