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).