Meta E4 Phone Screen

Round 1

Questions:

1. Convert a Binary Tree to a Circular Doubly-Linked List in place using in order traversal. #426
2. Find shortest path in a binary matrix from top left to bottom right. I was asked to return a list of indices in the shortest path #1091