Hey y'all, sharing a recent interview experience on behalf of anonymous.

Q1: LC1091 Shortest Path in a Binary Matrix
The variant is what if you had to return the shortest path, not the length of the shortest path?
It's noted that storing the path in the queue state was acceptable and interviewer was satisfied.

Q2: LC26 Remove Duplicates from Sorted Array
This was asked straight-up, and IMO I've seen it pop up a lot more recently.

I'm not sure of any information beyond that. Much luck to everyone studying!