Filter interviews by
Function to return mutual friends given two ids and getFriends(id) function
Call getFriends(id) for both ids to get their respective friend lists
Iterate through both lists and compare to find mutual friends
Return the list of mutual friends
Function to return list of friends of friends in decreasing order of mutual friends
Use a set to store all friends of friends
Iterate through the list of friends of the given id
For each friend, iterate through their list of friends and count mutual friends
Sort the set of friends of friends by decreasing number of mutual friends
Given time slots, find a specific time with maximum overlap. Prove solution.
Create a list of all start and end times
Sort the list in ascending order
Iterate through the list and keep track of the number of overlaps at each time
Return the time with the maximum number of overlaps
Prove solution by testing with different input sizes and edge cases
Find the longest sub-array with increasing order of integers.
Iterate through the array and keep track of the current sub-array's start and end indices.
Update the start index whenever the current element is smaller than the previous element.
Update the end index whenever the current element is greater than or equal to the next element.
Calculate the length of the sub-array and compare it with the longest sub-array found s
Find the length of longest increasing subsequence and print the sequence from an array of integers.
Use dynamic programming to solve the problem
Create an array to store the length of longest increasing subsequence ending at each index
Traverse the array and update the length of longest increasing subsequence for each index
Print the sequence by backtracking from the index with the maximum length
Time complexity: O(n^2)
Exam...
Code to find a given integer in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle edge cases such as the target integer not being present in the array.
Use a min-heap to keep track of the largest K numbers seen so far.
Create a min-heap of size K.
For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.
If the heap size exceeds K, remove the smallest element.
At the end, the heap will contain the largest K numbers in the input.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a doubly linked list to keep track of the order of items in the cache
Use a hash map to store the key-value pairs for fast access
When an item is accessed, move it to the front of the linked list
When the cache is full, remove the least recently used item from the back of the linked list and the hash map
I applied via Company Website and was interviewed in Jun 2024. There was 1 interview round.
I have implemented various technical improvements in codes to enhance performance and functionality.
Implemented caching mechanisms to reduce load times
Optimized database queries for faster retrieval of data
Introduced error handling techniques to improve code reliability
Utilized design patterns to make the codebase more maintainable
Refactored legacy code to adhere to best practices
I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.
I want to join Facebook because of its innovative technology, global impact, and opportunities for growth.
Innovative technology: Facebook is known for its cutting-edge technology and constant innovation.
Global impact: Working at Facebook would allow me to contribute to a platform that connects billions of people worldwide.
Opportunities for growth: Facebook offers a dynamic and fast-paced work environment with ample opp...
I appreciate the personalized news feed feature on Facebook.
Personalized news feed shows content based on user interests
Helps users stay updated on relevant information
Allows users to engage with content they are interested in
I applied via AmbitionBox and was interviewed before Oct 2023. There were 8 interview rounds.
I would like to teach a holistic approach to yoga and meditation that focuses on spiritual growth, physical well-being, and personal development for the next generation.
Incorporate mindfulness practices to cultivate self-awareness and inner peace
Teach asanas (yoga postures) for physical strength, flexibility, and balance
Guide students in pranayama (breath control) techniques for energy and relaxation
Introduce meditatio...
Whatever we know we have to discuss for each and every one to analyse the elements has different of quality of different of uses like that as I am a sky
Every person has come different places of different situation different area of different educations and different relationships so discussion of group is each and everyone to develop in self
Facebook interview questions for popular designations
I applied via Campus Placement and was interviewed in May 2024. There was 1 interview round.
Write program to sort data
Get interview-ready with Top Facebook Interview Questions
DSA round was there it was good
I applied via Job Portal and was interviewed in Dec 2023. There was 1 interview round.
I applied via Company Website and was interviewed in Dec 2023. There were 2 interview rounds.
All models should be made available or their complete information should be given in fresher training.
I applied for the position online and went through multiple rounds of interviews before being selected.
Applied online through company website
Participated in multiple rounds of interviews
Received offer after final interview
My ambition is to become a leading expert in embedded systems development, constantly pushing the boundaries of technology.
To continuously enhance my skills and knowledge in embedded systems design and development
To work on cutting-edge projects that challenge me and allow me to innovate
To eventually lead a team of talented engineers in creating groundbreaking embedded solutions
MVC (Model-View-Controller) architecture design pattern separates an application into three main components.
Model: Represents the data and business logic of the application
View: Represents the UI components of the application
Controller: Acts as an intermediary between Model and View, handling user input and updating the Model accordingly
Top trending discussions
Some of the top questions asked at the Facebook interview -
The duration of Facebook interview process can vary, but typically it takes about 2-4 weeks to complete.
based on 34 interviews
Interview experience
based on 161 reviews
Rating in categories
Software Engineer
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Apple
eBay