Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Apr 2023. There were 3 interview rounds.
Leetcode question on DFS and BFS. Passed
Develop a ml model to predict pass/no pass decision.
I applied via Job Fair and was interviewed before Dec 2023. There was 1 interview round.
Facebook interview questions for popular designations
I applied via Company Website and was interviewed before Sep 2023. There was 1 interview round.
I am passionate about networking and believe that working at FB will provide me with challenging opportunities to grow and learn.
I am excited about the cutting-edge technology and infrastructure at FB
I admire FB's commitment to innovation and collaboration
I believe FB's global reach will allow me to work on diverse and impactful projects
Yes, I have an account on Facebook.
Yes, I have an active account on Facebook.
I use Facebook to connect with friends and family.
I also use Facebook for networking and staying updated on industry news.
Yes, I have experience in network engineering.
I have worked as a network engineer for 5 years
I have experience with Cisco routers and switches
I have implemented and maintained network security protocols
Get interview-ready with Top Facebook Interview Questions
I applied via Company Website and was interviewed in Apr 2022. There were 4 interview rounds.
Written behavioural assignment
I have a strong background in data engineering with experience in various industries.
Bachelor's degree in Computer Science with a focus on data engineering
Worked as a Data Engineer at XYZ Company, where I developed and maintained data pipelines
Implemented data quality checks and automated data validation processes
Collaborated with cross-functional teams to design and implement scalable data solutions
Experience with clo...
Facebook is a leading social media platform with vast user base and cutting-edge technology.
Facebook has over 2.8 billion monthly active users, providing a massive data source for analysis and engineering.
The company has a strong focus on innovation and constantly develops new technologies and tools.
Facebook's data infrastructure is highly advanced, allowing for complex data processing and analysis.
Working at Facebook ...
Spark is a distributed computing framework used for big data processing.
Spark is an open-source project under Apache Software Foundation.
It can process data in real-time and batch mode.
Spark provides APIs for programming in Java, Scala, Python, and R.
It can be used for various big data processing tasks like machine learning, graph processing, and SQL queries.
Spark uses in-memory processing for faster data processing.
Coding questions on SQL - given 2 tables, join and find the results after the join
I was interviewed in Jun 2022.
I was interviewed in Jul 2021.
Round duration - 90 minutes
Round difficulty - Hard
This was an online coding round where we had 2 questions to solve under 90 minutes . Both the questions were preety hard according to me . One has to have a fair share of knowledge in Data Structures and Algorithms to pass this round .
Given a matrix of non-negative integers of size 'N x M', where 'N' and 'M' denote the number of rows and columns respectively, find the length of t...
The task is to find the length of the longest increasing path in a 2D matrix, where you can move in four directions: left, right, up, or down from each cell.
Traverse the matrix and for each cell, find the longest increasing path starting from that cell
Use dynamic programming to store the length of the longest increasing path for each cell
Recursively explore all four directions from each cell, checking if the next cell ...
Ninja is adventurous and loves traveling while being mindful of his expenses. Given a set of 'N' stations connected by 'M' trains, each train starting from station 'A' and r...
The task is to find the cheapest price from the given source to destination with up to K stops.
Read the number of test cases
For each test case, read the number of stations and trains
Read the details of each train (source, destination, ticket price)
Read the source station, destination station, and maximum number of stops
Implement a graph data structure to represent the stations and trains
Use a modified version of Dijkst...
Round duration - 60 Minutes
Round difficulty - Medium
This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the
approach the time complexity and proper code covering all cases.
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...
The task is to print every path of a binary tree with the sum of nodes in the path as 'K'.
Traverse the binary tree and keep track of the current path and its sum
At each node, check if the sum of the current path equals 'K'
If yes, add the current path to the result
Continue traversing the left and right subtrees recursively
Remove the current node from the path before backtracking
Given an array of distinct positive integers ARR
and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...
The task is to find all unique combinations in an array whose sum is equal to a given target sum.
Use backtracking to generate all possible combinations
Sort the array in non-decreasing order to ensure elements in each combination are in non-decreasing order
Start with an empty combination and iterate through the array, adding each element to the combination and recursively calling the function with the remaining sum
If th...
Round duration - 50 Minutes
Round difficulty - Medium
This Round was DS/Algo + Core round and it started with formal introduction, followed by 3 problems. We first dicussed
the approach the time complexity and proper code covering all cases for the 2 coding problems . The last question was
related to OS and was a bit theoretical .
Given a list ACCOUNTS
where each element consists of a list of strings, with the first element being the name of the account holder, and the subsequent elements being the email ad...
The task is to merge accounts belonging to the same person based on common emails and return the merged accounts.
Iterate through each account and create a mapping of emails to account holders
Iterate through the mapping and merge accounts with common emails
Sort the merged accounts and return the result
The goal is to construct a binary tree from given preorder and inorder traversal lists of the tree nodes.
preorder = [1, 2, ...
The task is to construct a binary tree using the given inorder and preorder traversals.
Use the preorder traversal to determine the root of the binary tree
Use the inorder traversal to determine the left and right subtrees of the root
Recursively construct the left and right subtrees
Return the root node of the constructed binary tree
Demand paging is a memory management technique where pages are loaded into memory only when needed.
Demand paging allows for efficient memory utilization by loading pages into memory on demand.
It reduces the amount of initial memory required to start a process.
When a page is needed but not in memory, a page fault occurs and the required page is loaded from disk.
Demand paging allows for larger virtual memory space than p...
Round duration - 60 minutes
Round difficulty - Medium
This was a preety intense round as I was grilled more on my System Design concepts but eventually I was able to
asnwers all the questions with some help from the interviewer.
General Tip : While preparing for Facebook Interviews , make sure you read and understand some of the most important features that Facebook incorporates like Graph Search , Adding a friend , Removing a friend , Storing Likes/Dislikes and so on.
All these features are important to learn because at their core they are nothing but Data Structures used and implemented very elegantly . So before your next Facebook interview , do read these topics and be confident about your LLD as well as HLD skills.
Facebook stores likes/dislikes using a combination of databases and caching systems.
Likes/dislikes are stored in a distributed database system like Cassandra or HBase.
Each like/dislike is associated with a user and the content being liked/disliked.
The database is sharded to handle the large volume of likes/dislikes.
Caching systems like Memcached or Redis are used to improve read performance.
Likes/dislikes can be stored...
Facebook implements graph search by indexing user connections and content to enable efficient search queries.
Facebook indexes user connections and content to build a graph database.
The graph database is used to store and retrieve information about users, their relationships, and their content.
Graph search queries are executed by traversing the graph database to find relevant connections and content.
Facebook uses variou...
Facebook Chat is a real-time messaging system that allows users to send and receive instant messages.
Facebook Chat uses a client-server architecture.
It utilizes long polling or WebSockets for real-time communication.
Messages are stored in a message queue for delivery.
Chat messages are encrypted for security.
Facebook Chat supports features like read receipts, typing indicators, and group chats.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Interview experience
based on 159 reviews
Rating in categories
Bangalore / Bengaluru
3-7 Yrs
Not Disclosed
Software Engineer
73
salaries
| ₹56.5 L/yr - ₹120 L/yr |
Software Developer
19
salaries
| ₹32.6 L/yr - ₹59.5 L/yr |
Senior Software Engineer
16
salaries
| ₹15.4 L/yr - ₹52.5 L/yr |
Manager
15
salaries
| ₹21 L/yr - ₹80 L/yr |
Data Scientist
14
salaries
| ₹42.6 L/yr - ₹160 L/yr |
Amazon
Apple
eBay