Facebook | Phone Screening | Word Ladder | April 2020 | [Rejected]

I was approached by tech recruitment team member from Facebook - London on LinkedIn as they were looking for senior engineer.

  1. First scheduled call with recruiter: (10th March,2020)

    I was asked about my role in current organisation and brief about any project that I have delivered. Then recruiter told me about the role and culture at Facebook. The grooming phase and how developers get to choose the project they can work on, after getting onboarded and understanding various teams at Facebook. Recruiter also asked some basic questions like time complexity of searching in hashmap and BST.

  2. Second online phone screening round: (6th April,2020)

    https://leetcode.com/problems/word-ladder/
    I didn't know how to approach this question so was trying to solve recursively. Wrote the code after explaining only approach which I could think of. After that did a dry run by taking an example. Follow up questions like time complexity and space complexity were asked.

Comments (3)