Facebook Vice President (VP) Interview Questions and Answers

Q1. How did you know about this job?
Add your answer

Q1. Talking about my experience
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Online coding round , 2-3 questions. Level - med-hard

Q1. 
Fibonacci Number Verification
Identify if the provided integer 'N' is a Fibonacci number.
A number is termed as a Fibonacci number if it appears in the Fibonacci sequence, where each number is the sum of...read more
Ans. 
Check if a given number is a Fibonacci number or not.
• Iterate through the Fibonacci sequence until you find a number greater than or equal to the given number.

• Check if the given number matches the Fibonacci number found in the sequence.

• If the given number matches, output 'YES'; otherwise, output 'NO'.
Answered by AI
Add your answer
Q2. 
Break The Board Problem Statement
Your task is to break a board of given dimensions 'L' by 'W' into 'L' * 'W' smaller squares, ensuring the total cost of breaking is minimized.
Input:
The first line con...read more
Ans. 
Minimize cost of breaking a board into smaller squares by optimizing horizontal and vertical cuts.
• Iterate through all possible horizontal and vertical cuts to find the minimum cost

• Use dynamic programming to store and reuse subproblem solutions

• Calculate the cost of breaking the board into smaller squares based on the given dimensions and cut costs
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

2 interviewers , coding problem, no compilation.

Q1. 
Minimum Number Of People To Teach
Ninja has started a social networking site called Ninjas Space. The platform consists of ‘N’ users and supports ‘M’ different languages. Users communicate if they know at...read more
Ans. 
Determine the minimum number of users to teach a common language so all friends can communicate on a social networking site.
• Create a graph where users are nodes and friendships are edges.

• Find connected components in the graph.

• For each connected component, determine the minimum number of users to teach a common language.

• Return the sum of minimum users needed for all connected components.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

CS fundamentals. Tough round. 40 mins interview. 1 interviewer from USA

Round duration - 40 minutes
Round difficulty - Hard

System Design Problem

Q1. Design a Facebook-like application.
Ans. 
Design a Facebook-like application for social networking.
• User profiles with personal information and photos

• News feed displaying posts from friends

• Ability to like, comment, and share posts

• Friend requests and messaging functionality

• Groups and events for community engagement
Answered by AI
Add your answer

Standard Leetcode Medium question.

Q1. DSA Questions and database questions.
Add your answer

Leetcode similar coding tests

Q1. How do you test the feasibility of an idea?
Add your answer
Q2. Explain the process of calling an API
Add your answer

Q1. What design tool can be implemented to determine if A and B are friends, and if B and C are friends, subsequently making A and C friends automatically?
Ans. 
A graph traversal algorithm like Depth First Search (DFS) can be implemented to determine if A and B are friends, and if B and C are friends, subsequently making A and C friends automatically.
• Implement a graph where each person is a node and friendships are edges between nodes

• Use Depth First Search (DFS) to traverse the graph and check for connections between A and B, and B and C

• If both connections exist, then A and C
Answered by AI
Add your answer

1 hour, 2 question. 1. Meetting scheduler (leetcode)

Q1. Interviewer asked introduction
Add your answer
Q2. After Introduction he will dig into my projects and after that one DSA Problem
Add your answer

Q1. Word search II from leetcode
Ans. 
Word search II is a problem where you have to find all words from a given list in a 2D board of characters.
• Use a trie data structure to efficiently search for words in the board.

• Implement a backtracking algorithm to explore all possible paths in the board.

• Optimize the search by pruning branches that cannot lead to a valid word.
Answered by AI
Add your answer