Facebook (Android Developer) | E4 | London | Phone | June 2021
Anonymous User
540

I had my Phone interview for Facebook on June 22, 2021. It was a 45 minutes round. The interviewer introduced his name and told there will be 2 questions and jumped straight to the problem.

  1. Buildings with an Ocean View
    LC Link : https://leetcode.com/problems/buildings-with-an-ocean-view/

    I started off the discussion by saying let me try with Brute Force where Time Complexity is O(N^2). The interviewer asked whether I can optimise further. And then to which I came up with another approach where I was able to bring down the Time Complexity to O(N). I also walked him through the code with test cases. He said ok and moved on to the next question. The first question was completed in less than 15 mins.

  2. Word Ladder
    LC Link : https://leetcode.com/problems/word-ladder/

    Started off with Brute Force but the interviewer wanted me to do it differently. Then he asked whether can be this visualised as a graph and then what DS do you use for it. I got little tensed and went blank for a while. Then he asked do I know DFS or BFS. Then I replied and proposed how we could achieve it by DFS. He asked why do I prefer DFS to BFS. I wasn't able to code it as the time was already up by then.

I haven't heard back from theinterviewer yet. How long does it usually take? And what are my chances?

Comments (2)