NewThe Learning module is now liveSee what's new

You are given a list of unordered server access logs. Each entry is a three-element array [<timestampString>, <userId>, <resource>]. Build a transition graph showing how users move between resources. Each user's timestamps are distinct.

For a path [r1, r2, ..., rN], the transitions are "START" → r1, r1 → r2, ..., and rN → "END", where "START" is a virtual state before any user's first resource and "END" is a virtual terminal state after any user's last resource. Neither "START" nor "END" appears as an actual resource name. If multiple users produce the same transition, their counts accumulate.

Test Cases
Input
Output
Expected