Round 1
Questions: You are given a n-ary tree. You need to assign prime numbers to each edge such that any path with three nodes has a prime sum. This means if we choose any path that has three nodes, then the sum of all the assigned values to the edges between those three nodes should also be prime.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.