Facebook | E4 | London | Interview Experience

Result
Ongoing
Location
London
Experience
3 years
Posted
10 Aug 2021
321 reads

Summary

I interviewed with Facebook for an E4 role in London, tackling various coding challenges, system design, and behavioral questions across multiple rounds, and I am currently awaiting the outcome.

How it went

Hey Everyone,

I interviewed with Facebook for an E4 role in London. I am currently waiting to hear back from them regarding the outcome of my interviews.

Phone Screen:

This round involved two coding questions. I felt confident in my ability to solve both on time.

  1. Binary Tree to Doubly linked List.
  2. Evaluating expression (Only with +/* operators).

Onsite Coding 1:

I successfully solved both problems presented in this round within the given time frame.

  1. Multiplying 2 strings.
  2. Course Schedule problem on LeetCode.

Onsite Coding 2:

Only one question was asked in this round. I was able to solve it on time, even though I required one hint from the interviewer. Overall, the interviewer seemed convinced by my solution.

  1. LFU Cache Implementation.

Behavioral:

This round consisted of standard behavioral questions and some inquiries about my past work experience. I managed to tackle all the questions well, with only one or two proving to be a bit tricky.

System Design:

The challenge here was to design a system similar to Google Drive. I was able to approach the problem, but the interviewer continuously introduced new scenarios. I could answer some of these, but got stuck on others. I feel this round went below average to average.

Questions asked (6)

  1. 01

    Convert Binary Tree to Doubly Linked List

    Data Structures & Algorithms · Medium

    Convert a binary tree into a circular doubly linked list in-place. The left and right pointers of the tree nodes should be used as previous and next pointers respectively in the doubly linked list.

  2. 02

    Evaluate Expression with Basic Operators (+, *)

    Data Structures & Algorithms · Medium

    Implement a basic calculator to evaluate a simple expression string that may contain integers and the operators '+' and '*'. The expression string does not contain any parentheses, division, or subtraction. Assume the given expression is always valid.

  3. 03

    Multiply Strings

    Data Structures & Algorithms · Medium

    Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Do not use any built-in BigInteger library or convert the inputs to integers directly.

    Open the problem
  4. 04

    Course Schedule

    Data Structures & Algorithms · Medium

    There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai. Return true if you can finish all courses. Otherwise, return false.

    Open the problem
  5. 05

    LFU Cache

    Data Structures & Algorithms · Hard

    Design and implement a data structure for a Least Frequently Used (LFU) cache. It should support get and put operations with O(1) average time complexity. When the cache reaches its capacity, it should invalidate the least frequently used item. If there is a tie in frequency, invalidate the least recently used item among them.

    Open the problem
  6. 06

    Design Google Drive

    System Design

    Design a system like Google Drive, focusing on aspects such as file storage (e.g., block storage, deduplication), synchronization across multiple devices, versioning of files, access control and permissions, and overall system scalability and reliability.

How they prepared

For my preparation, I primarily used LeetCode for algorithm and data structure questions. For System Design, I relied exclusively on YouTube resources.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Facebook recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!