Round 0: CV must be shortlisted.

Round 1: Tech Online Test Round.

Round 2: HR Telephonic Round.

Round 3: Tech Telephonic Round. This is where I was stuck. Duration: 40 minutes.

It was on a collaborative screen. Two members from the core backend team joined the call and fired questions.

log = [ { 'user': 'A', 'page': 1}, { 'user': 'B', 'page': 5}, { 'user': 'A', 'page': 2}, { 'user': 'A', 'page': 1}, { 'user': 'B', 'page': 2}, { 'user': 'C', 'page': 7}, { 'user': 'C', 'page': 3}, { 'user': 'A', 'page': 3}, { 'user': 'C', 'page': 1}, ]

Implement discover_site_map(log).

discover_site_map returns a representation of the links between pages, using a suitable data structure.

For example: 1 -> 2, 3 2 -> 1 3 -> 1 5 -> 2 7 -> 3

Given any number of arrays containing numbers, write a function which finds the numbers that appear in exactly two arrays.

arrays = [ [6, 2, 2, 0, 4], [5, 0, 2, 6, 7, 1], [6, 7, 9, 9], ]

find_in_two(arrays) should return [2, 0, 7].