Facebook interview experiences - All Combined from LC - Till Date 07-Jun-2020
Summary
This is a comprehensive collection of interview experiences at Facebook, compiled from various LeetCode posts up to June 7, 2020. It covers questions encountered in Phone Screens, Coding Rounds, Design discussions, and Behavioral interviews, offering insights into the breadth of topics tested.
Full Experience
I've gathered a wide array of questions encountered by candidates interviewing at Facebook, organized by interview rounds. The compilation includes numerous Data Structures & Algorithms problems, often linked directly to LeetCode, as well as custom problem statements. System Design questions cover a range of topics from debugging server issues to designing scalable services like Google Search, Instagram, or file storage systems. Behavioral questions delve into common scenarios, personal experiences, and career aspirations. This collection aims to provide a broad overview of the types of challenges faced in Facebook interviews.
Interview Questions (94)
You are given a mn grid. You are asked to generate k mines on this grid randomly. Each cell should have equal probability of k / mn of being chosen. Your algorithm should run in O(m) time.
Given two strings, return true if they are similar, meaning only 2 positions in the strings are swapped (e.g., 'face', 'eacf' -> true because 'f' and 'e' are swapped).
Given two binary search trees, merge everything so it prints inorder.
You have an API to check if it's possible to move left, right, up, down and one more method to check if current position is the last one. Find the shortest way to the last position. You don't have any data structure - only API.
Calculate tax if Salary and Tax Brackets are given as a list in the form [ [10000, 0.3],[20000, 0.2], [30000, 0.1], [null, .1]], where null represents the rest of the salary.
Is there a way to reach (0,0) from a mXn matrix to (m-1,n-1) position and give the path.
N-ary Tree with each node having a boolean flag. Traverse all the nodes with only boolean flag = True. Return the total distance traveled from root to all those nodes.
A remote server is not responding. Debug the issue, covering the entire TCP/IP stack (fragmentation, ICMP, etc.), machine metrics (vmstat, iostat, strace etc.), and describe virtual memory in terms of demand paging.
Two machines are connected, suddenly one machine is responding slowly. Identify potential causes (NFS, Networking, Kernel resources like buffer-cache, inodes, virtual memory) and discuss diagnostic commands (strace, lsof, readlink, cat /proc/pid etc).
Design a system to copy resources from N sources (N < 10) to M sinks (M could be 10k/Millions etc.).
Design a scheduling service, focusing on a SQL approach. Discuss concurrency issues, table schemas, and composite keys.
Design a type-ahead feature for a website, discussing various data structures, their advantages/disadvantages, and different cases/scenarios.
Design a service for music providers (like Spotify, Apple Music) to display the top 10 songs played by each user. Includes designing ER tables and APIs.
Tell me about a time when you had to give someone difficult feedback. How did you handle it? What kind of feedback did you give?
Tell me about a time when you had a conflict with a manager and how you resolved it.
Which environment is best to you to work ?
Tell about best decision in your life from childhood ? Decision that changed your life
On which topics you want improve? What are doing to impoving on that topics ? Did you try build project on that topics ?