Leetcode 1699. Number of Calls Between Two Persons

Given a list of phone-call records forming a directed (possibly time-ordered or multi-edge) graph, count how many call chains or interactions connect two specified persons under constraints such as maximum chain length or time window; the core challenge is graph traversal/path-counting while handling cycles and duplicate edges efficiently (DFS with memoization or DP/topological reasoning).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1699. Number of Calls Between Two Persons

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact