I recently had a phone screening with Meta.\nThese are the two questions asked during the interview.\n\nQ1. https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/?envType=company&envId=facebook&favoriteSlug=facebook-thirty-days\nQ2. Given an int array find the second highest value after arranging the numbers in such a way that they form the largest possible concatenated number. \nEg: input = [1,2,3,4,5] output = [5,4,3,1,2] EDIT: input array is always single digit: [0-9]\n\nI was able to solve the first one but it ate up majority of the time. Barely got any time to discuss on Q2.\nI doubt Ill make it to the next round.\n\nGood luck to anyone preparing for phn interview.. Hope this helps :)

I recently had a phone screening with Meta.\nThese are the two questions asked during the interview.\n\nQ1. https://leetcode.com/problems/vertical-order-travers