← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Meta E6 Phone Screen
Problem 1: Given an array of digits (e.g., [1, 2, 3, 4]), construct the second largest number possible using these digits. For the example provided, the second largest number is [4, 3, 1, 2].
Problem 2: A variation of the Longest Increasing Path in a Matrix problem. The constraint is that traversal is only allowed if the numbers are consecutively increasing (e.g., 1 -> 2 -> 3 -> 4).
I was able to implement solutions for both problems. However, I missed a boundary case in the second problem and did not identify it during the dry run. The interviewer pointed out the error, and I was able to locate and correct it. I am uncertain if this oversight will impact my chances of advancing in the interview process.