Intersection of Multiple Arrays (LC 2248)

Problem Overview

Citadel asked LeetCode 2248, Intersection of Multiple Arrays, in a phone screen. The report gives only the problem number, so the statement below is the public LeetCode one. Given a 2D integer array nums where nums[i] is a non-empty array of distinct positive integers, return the list of integers that…

• 1 candidate-reported follow-up — the exact probes interviewers asked, with the trigger for each
• The rest of the problem statement — full requirements, constraints, and edge cases
• Approach and trade-offs — what passing candidates did, and the mistakes that sink people