Upload Button Icon Add office photos

Facebook

Compare button icon Compare button icon Compare

Filter interviews by

Facebook Software Developer Interview Questions and Answers for Freshers

Updated 30 Oct 2024

7 Interview questions

A Software Developer was asked
Q. 

Longest Route Problem Statement

Given a 2-dimensional binary matrix called Mat of size N x M that consists solely of 0s and 1s, find the length of the longest path from a specified source cell to a destinat...

Ans. 

Find the length of the longest path from a source cell to a destination cell in a binary matrix.

  • Use depth-first search (DFS) to explore all possible paths from source to destination.

  • Keep track of visited cells to avoid revisiting them.

  • Return the length of the longest path found, or -1 if no path exists.

A Software Developer was asked
Q. 

Course Schedule II Problem Statement

You are provided with a number of courses 'N', some of which have prerequisites. There is a matrix named 'PREREQUISITES' of size 'M' x 2. This matrix indicates that for...

Ans. 

Given courses with prerequisites, determine a valid order to complete all courses.

  • Use topological sorting to find a valid order of courses.

  • Create a graph with courses as nodes and prerequisites as edges.

  • Start with courses that have no prerequisites and remove them from the graph.

  • Continue this process until all courses are taken or there are no valid courses left.

  • If there is a cycle in the graph, it is impossible t...

Software Developer Interview Questions Asked at Other Companies for Fresher

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Nagarro
Q2. Crazy Numbers Pattern Challenge Ninja enjoys arranging numbers in ... read more
asked in Mr Cooper
Q3. Connect Ropes Problem Statement Given a number of ropes denoted a ... read more
asked in TCS
Q4. Palindromic Numbers Finder Given an integer 'N', your task is to ... read more
Q5. Validate Binary Tree Nodes Problem You are provided with 'N' bina ... read more
A Software Developer was asked
Q. 

Path Counting in Directed Graph

Given a directed graph with a specified number of vertices V and edges E, your task is to calculate the total number of distinct paths from a given source node S to all oth...

Ans. 

Calculate the total number of distinct paths from a given source node to all other nodes in a directed graph.

  • Use dynamic programming to keep track of the number of paths from the source node to each node in the graph.

  • Consider using modular arithmetic to handle large numbers and prevent overflow.

  • Start by initializing the number of paths from the source node to itself as 1.

  • Iterate through the edges of the graph and ...

A Software Developer was asked
Q. 

Rank from Stream Problem Statement

Given an array of integers ARR and an integer K, determine the rank of the element ARR[K].

Explanation:

The rank of any element in ARR is defined as the number of eleme...

Ans. 

Given an array and an index, find the number of elements smaller than the element at that index appearing before it in the array.

  • Iterate through the array up to index K and count the number of elements smaller than ARR[K].

  • Return the count as the rank of ARR[K].

  • Handle edge cases like empty array or invalid index K.

A Software Developer was asked
Q. 

Search In Rotated Sorted Array Problem Statement

Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.

Note:
1. If 'K' is not present ...
Ans. 

Given a rotated sorted array, find the index of a given integer 'K'.

  • Use binary search to find the pivot point where the array is rotated.

  • Then perform binary search on the appropriate half of the array to find 'K'.

  • Handle cases where 'K' is not present in the array by returning -1.

A Software Developer was asked
Q. 

Longest Increasing Subsequence Problem Statement

Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This ...

Ans. 

Find the length of the longest strictly increasing subsequence in an array of integers.

  • Use dynamic programming to solve this problem efficiently.

  • Initialize an array to store the length of the longest increasing subsequence ending at each index.

  • Iterate through the array and update the length of the longest increasing subsequence for each element.

  • Return the maximum value in the array as the result.

A Software Developer was asked
Q. 

Merge Intervals Problem Statement

You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.

Your task is to merge all overlapping intervals an...

Ans. 

Merge overlapping intervals and return sorted list of merged intervals.

  • Sort the intervals based on start times.

  • Iterate through intervals and merge overlapping intervals.

  • Return the merged intervals in sorted order.

Are these interview questions helpful?

Facebook Software Developer Interview Experiences for Freshers

2 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - HR 

(2 Questions)

  • Q1. Why you want to join facebook?
  • Ans. 

    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...

  • Answered by AI
  • Q2. Whats the best feature you like in Facebook?
  • Ans. 

    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

  • Answered by AI

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Hard

This was an online coding round where we were supposed to solve 2 questions under 90 minutes . Both the questions in my set were related to Graphs and were quite tricky and heavy to implement.

  • Q1. 

    Path Counting in Directed Graph

    Given a directed graph with a specified number of vertices V and edges E, your task is to calculate the total number of distinct paths from a given source node S to all ot...

  • Q2. 

    Course Schedule II Problem Statement

    You are provided with a number of courses 'N', some of which have prerequisites. There is a matrix named 'PREREQUISITES' of size 'M' x 2. This matrix indicates that fo...

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a Data Structures and Algorithms round with some standard questions . I was expected to come up with an
efficient approach and code it as well .

  • Q1. 

    Merge Intervals Problem Statement

    You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.

    Your task is to merge all overlapping intervals a...

  • Q2. 

    Longest Route Problem Statement

    Given a 2-dimensional binary matrix called Mat of size N x M that consists solely of 0s and 1s, find the length of the longest path from a specified source cell to a destina...

  • Ans. 

    Find the length of the longest path from a source cell to a destination cell in a binary matrix.

    • Use depth-first search (DFS) to explore all possible paths from source to destination.

    • Keep track of visited cells to avoid revisiting them.

    • Return the length of the longest path found, or -1 if no path exists.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was also a DSA round where I was asked to code only one of the questions but I eventually ended up coding both
as I had some spare time and explained my approches very smoothly to the interviewer . This round went preety well .

  • Q1. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Q2. 

    Search In Rotated Sorted Array Problem Statement

    Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.

    Note:
    1. If 'K' is not present...
Round 4 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was also a DSA round with 2 questions of Medium to Hard difficulty . I was expected to follow some clean code and OOPS principles to write the code in this round .

  • Q1. 

    Rank from Stream Problem Statement

    Given an array of integers ARR and an integer K, determine the rank of the element ARR[K].

    Explanation:

    The rank of any element in ARR is defined as the number of elem...

  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFacebook interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Top trending discussions

View All
Interview Tips & Stories
1w (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about Facebook?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Easy

This round was held during university hours and consisted of 2 coding questions.

Round 2 - Face to Face 

(1 Question)

Round duration - 120 minutes
Round difficulty - Easy

Make sure you do no cutting and are clear about the approach you'd be following. 
 

  • Q1. What is the running median of an input stream?
  • Ans. 

    Running median of an input stream is the median value of the numbers seen so far in a continuous stream of data.

    • Maintain two heaps - a max heap for the lower half of the numbers and a min heap for the upper half.

    • Keep the number of elements in the two heaps balanced or differ by at most 1.

    • If the total number of elements is odd, the median is the root of the max heap. If even, it is the average of the roots of the two he...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Electronics & Communication Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Java, Object-Oriented Programming System, System Design, Operating System.Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Prepare for company-wise interview questions according to the company in which you are applying. Try to write the code yourself and if got stuck in between then take help from the internet. I recommend you Codezen of Coding Ninjas for practicing Data Structures and Algorithms based questions.

Application resume tips for other job seekers

Be sure 100% of what you write in your resume and prepare for that before the interview what is written on resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Dec 2015.

Interview Questionnaire 

2 Questions

  • Q1. 1 question from basic data structures and algorithms The question was similar to the one in the given link- -----/
  • Q2. Why do you want to join the company?

Interview Preparation Tips

Round: Resume Shortlist
Experience: Resumes were shortlisted with a short aptitude round where we are asked basic questions about databases, basic programming(C and C ++ questions)

Round: Technical Interview
Experience: The questions were asked were simple - related to arrays and data structures. Some questions were asked regarding my resume and projects.
Tips: Be thorough with geeksForGeeks, and your projects.

Round: HR Interview
Experience: I told him how I found the story of the founder of Infoedge very inspiring.
Tips: This round should be more simpler , be prepared with why you want to join the company and general HR questions

Skills: Basic C/C++, Programming Skills In Any Language Like C
College Name: IIIT Allahabad

Interview Preparation Tips

Round: Technical Interview
Experience: Ques will be based on arrays( duplicate element, missing element in 1 to n array), link list(reverse, remove loop, middle node etc), Hashing, sql join, normalisation, indexing in sql, singlton pattern and sorting and searching.
Tips: Focus will remain on algorithms. Whatever program they will ask to write, they will also ask to optimize the solution.

Skill Tips: Puzzle on mislabled jar, odd weight ball. As I had exp in Java, so some more que on Java, java script and web technology. All you need in interview is to be confident and show your interest in web domain.
Skills: Java, Data structure, Algorithm
College Name: NA

Interview Questionnaire 

10 Questions

  • Q1. What do you do when your schedule is interrupted? How you handle it?
  • Ans. 

    I prioritize tasks, communicate effectively, and adapt my plans to manage interruptions while maintaining productivity.

    • Assess the interruption: Determine its urgency and importance. For example, if a team member needs immediate help, I prioritize that.

    • Reorganize my tasks: I create a new plan that accommodates the interruption while ensuring critical deadlines are met.

    • Communicate with stakeholders: I inform my team or m...

  • Answered by AI
  • Q2. PreOrder traversal without recursion?
  • Q3. Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?
  • Ans. 

    Yes

    • Create an empty binary search tree (BST)

    • Loop over the unsorted array

    • For each element, insert it into the BST using the appropriate insertion logic

    • Repeat until all elements are inserted

    • The resulting BST will be built from the unsorted array

  • Answered by AI
  • Q4. Find 2 elements in array whose sum is equal to given number?
  • Ans. 

    The question asks to find two elements in an array whose sum is equal to a given number.

    • Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.

    • Use a hash set to store the elements as you iterate through the array for efficient lookup.

    • Return the pair of elements if found, otherwise return a message indicating no such pair exists.

  • Answered by AI
  • Q5. How many types of trigger?
  • Ans. 

    There are two types of triggers: DML triggers and DDL triggers.

    • DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.

    • DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.

    • Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt...

  • Answered by AI
  • Q6. Can trigger be used with select statement?
  • Ans. 

    Yes, triggers can be used with select statements in SQL.

    • Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.

    • While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.

    • Using triggers with select statements allows you to perform additional actions or validations before or af...

  • Answered by AI
  • Q7. Indexing in mysql? How many types of indexing in mysql?
  • Ans. 

    Indexing in MySQL improves query performance. There are several types of indexing in MySQL.

    • Indexes are used to quickly locate data without scanning the entire table.

    • Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.

    • B-tree indexes are the most common and suitable for most use cases.

    • Hash indexes are used for exact match lookups.

    • Full-text indexes are used for searching text-based data efficie...

  • Answered by AI
  • Q8. Engines in mysql?
  • Ans. 

    Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.

    • MySQL supports multiple storage engines, each with its own strengths and features.

    • Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.

    • InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.

    • MyISAM is known for its simplicity and speed but lacks transaction suppo...

  • Answered by AI
  • Q9. Singlton pattern?
  • Ans. 

    The Singleton pattern ensures a class has only one instance and provides a global point of access to it.

    • Restricts instantiation of a class to a single object.

    • Useful for managing shared resources, like database connections.

    • Implemented using private constructors and static methods.

    • Example in Java: public class Singleton { private static Singleton instance; private Singleton() {} public static Singleton getInstance() { if...

  • Answered by AI
  • Q10. Can a constructor be private?
  • Ans. 

    Yes, a constructor can be private.

    • A private constructor can only be accessed within the class itself.

    • It is often used in singleton design pattern to restrict object creation.

    • Private constructors are also useful for utility classes that only contain static methods.

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.

  • Q1. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper. 
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.

  • Q1. 

    Add Two Numbers as Linked Lists

    You are given two singly linked lists, where each list represents a positive number without any leading zeros.

    Your task is to add these two numbers and return the sum as ...

Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.

  • Q1. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Q2. 

    DFS Traversal Problem Statement

    Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...

  • Q3. 

    Dijkstra's Shortest Path Problem

    Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.

    • Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Update the distances of neighboring nodes based on the current node's distance and edge weight...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA, Eligible branches : Computer Science & Engineering, Mathematics & Computing, Electrical Engineering and Electronics & Communication Engineering.Myntra interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Be thorough with Data Structures and Algorithms and also with your resume.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 4 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Interview Questions & Answers

Myntra user image Thommandru Vishnu

posted on 10 Mar 2015

Interview Questionnaire 

9 Questions

  • Q1. All the leaf nodes of tree are doubly linked,print only the leaf nodes of a tree
  • Ans. 

    Print only the leaf nodes of a doubly linked tree.

    • Traverse the tree and check if a node has no children and both left and right pointers are null.

    • If yes, then it is a leaf node and print it.

    • If no, then continue traversing the tree.

    • Use recursion to traverse the tree in a depth-first manner.

  • Answered by AI
  • Q2. LRU page Replacement Algorithm for large data
  • Ans. 

    LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.

    • LRU stands for Least Recently Used

    • It is a cache eviction algorithm

    • It is used to manage memory in operating systems

    • It works by keeping track of the pages that are used recently and the ones that are not

    • When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time ...

  • Answered by AI
  • Q3. Given a linked list with 2 parameters m,n. Now start reversing the m nodes and leave n nodes and continue it till u reach the end
  • Ans. 

    Reverse m nodes and leave n nodes in a linked list till the end.

    • Traverse the linked list till m nodes and reverse them

    • Traverse n nodes and continue reversing m nodes

    • Repeat the above step till the end of the linked list

    • Handle edge cases like m or n being greater than the length of the linked list

  • Answered by AI
  • Q4. Inorder Traversal of a tree
  • Ans. 

    Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.

    • Start at the root node

    • Traverse the left subtree recursively

    • Visit the root node

    • Traverse the right subtree recursively

    • Repeat until all nodes have been visited

  • Answered by AI
  • Q5. Inorder Travesal of a tree without recursion(write the code)
  • Q6. Given an array of numbers in which duplicates are there and one triplicate is there. find that number
  • Ans. 

    Find the triplicate number in an array of duplicates.

    • Iterate through the array and keep track of the frequency of each number.

    • Return the number that appears three times.

    • If no number appears three times, return null.

  • Answered by AI
  • Q7. Explain all the serach algorithm you know with space and Time complexities
  • Ans. 

    Explanation of search algorithms with their space and time complexities.

    • Linear Search - O(n) time complexity, O(1) space complexity

    • Binary Search - O(log n) time complexity, O(1) space complexity

    • Jump Search - O(√n) time complexity, O(1) space complexity

    • Interpolation Search - O(log log n) time complexity, O(1) space complexity

    • Exponential Search - O(log n) time complexity, O(1) space complexity

    • Fibonacci Search - O(log n) ...

  • Answered by AI
  • Q8. Given a situation and asks you which search algorithm suits the best in that situation
  • Ans. 

    Choosing the right search algorithm depends on data structure, size, and specific requirements like speed or memory usage.

    • Binary Search: Efficient for sorted arrays, O(log n) time complexity. Example: Finding a number in a sorted list.

    • Linear Search: Simple and works on unsorted arrays, O(n) time complexity. Example: Searching for a name in an unsorted list.

    • Depth-First Search (DFS): Suitable for tree/graph traversal, ex...

  • Answered by AI
  • Q9. Given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times
  • Ans. 

    Find the most repeated number in an array of length n with numbers 1-n.

    • Create a dictionary to store the count of each number in the array

    • Iterate through the array and update the count in the dictionary

    • Find the key with the highest count in the dictionary

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: Basically, it's not resume shortlist, it's a 9 pointer shortlist

Round: Test
Experience: The Entire Test is held in HackerRank Platform. it has
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
it took me 30 min for each coding questions.I was not known that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic c and c++ concepts
Duration: 120 minutes
Total Questions: 7

Round: Technical Interview
Experience: It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.There are 2 more questions which I haven't mentioned.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

Round: Technical Interview
Experience: The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Tips: Go to the website -----/ and study all the interview questions and modules

Round: HR Interview
Experience: It's Technical+ HR interview all the technical questions went around resume. it went around 45 minutes they are very particular about what you wrote in the resume.HR questions are general like
whats your future plans
where will u see yourself in the office after 5 years?
Tips: please make sure that whatever you write in resume should be known to you very well.Don't write false things about yourself.And make sure you know completely about the projects you are going to write in resume(atleast the part you worked)

General Tips: Be sure of what you are saying. Don't be tensed and answer to your best.
Skills: Programming, Data Structures
College Name: VIT VELLORE

Skills evaluated in this interview

Interview Questionnaire 

10 Questions

  • Q1. Change Binary tree so that parent node is the sum of root nodes
  • Q2. Reverse a linkedlist ?
  • Q3. Given an array of +ve and -ve numbers , have to rearrange them ( like +ve numbers to left and -ve numbers to right of the array)
  • Q4. Singleton pattern, observer pattern?
  • Q5. String pool and how garbage collection functionality works?
  • Ans. 

    String pool is a cache of string literals in memory. Garbage collection frees up memory by removing unused objects.

    • String pool is a cache of string literals in memory

    • Strings are immutable and can be shared among multiple objects

    • Garbage collection removes unused objects to free up memory

    • String objects that are no longer referenced are eligible for garbage collection

  • Answered by AI
  • Q6. HashMap , how can you synchronize ?
  • Q7. Process vs Thread differences and synchronization,deadlock examples?
  • Ans. 

    Process vs Thread differences and synchronization, deadlock examples

    • Process is an instance of a program while thread is a subset of a process

    • Processes are independent while threads share the same memory space

    • Synchronization is used to coordinate access to shared resources

    • Deadlock occurs when two or more threads are blocked waiting for each other to release resources

    • Examples of synchronization include mutex, semaphore, ...

  • Answered by AI
  • Q8. Database: Design with one-one mapping, one-many mapping…some basic questions, I don’t remember all
  • Q9. Design a website where after user request. A bunch of processes need to be executed and then a mail is sent to user with the result. Take care of scalability etc?
  • Ans. 

    Design a scalable website to process user requests and send email results asynchronously.

    • Use a microservices architecture to handle different processes independently.

    • Implement a message queue (e.g., RabbitMQ, Kafka) to manage requests and responses.

    • Utilize cloud services (e.g., AWS Lambda) for scalable processing of tasks.

    • Send emails using a reliable service (e.g., SendGrid, Amazon SES) to ensure delivery.

    • Implement loa...

  • Answered by AI
  • Q10. CTO round

Interview Preparation Tips

Round: HR Interview
Experience: This was CTO round, if you make this round…you are doing pretty good. 
He asked a lot on what I worked on and asked questions relevant to that. Process thread, stacks heaps. A minor system design on component in their system. How they are shared between and trade-off. We discussed about scalability and challenge.

General Tips: Process:5 technical ( 3 rounds+ SVP round + CTO round ) + 1 HR
I got almost the same package that I am currently getting (Myntra gave stock options, which I don’t have in my current company) but I am looking for a change so accepted the offer.
Skills: Algorithm, data structure, database
College Name: na

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

The Entire Test is held in HackerRank Platform. It has: 
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
It took me 30 min for each coding questions. I did not know that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic C and C++ concepts

  • Q1. 

    Binary Tree to Doubly Linked List

    Transform a given Binary Tree into a Doubly Linked List.

    Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.

    Input:

    The fi...
  • Q2. 

    Unique Element in Array

    Given an arbitrary array arr consisting of N non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...

Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it. 
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Parse the input level-order tree elements to construct the binary tree.

    • Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.

    • Return the traversals as lists of lists for each test case.

  • Answered by AI
  • Q2. 

    Delete N Nodes After M Nodes in a Linked List

    Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...

Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked to put everything on the blackboard and write down the code of each and everything.

Question : Explain all the search algorithm you know with space and Time complexities. 
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1). 
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half. 
Steps : 
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half. 
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.

  • Q1. 

    Maximum Frequency Number Problem Statement

    Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

    If multip...

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMyntra interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Facebook Interview FAQs

How many rounds are there in Facebook Software Developer interview for freshers?
Facebook interview process for freshers usually has 1 rounds. The most common rounds in the Facebook interview process for freshers are HR.

Tell us how to improve this page.

Overall Interview Experience Rating

5/5

based on 1 interview experience

Difficulty level

Moderate 100%

Duration

2-4 weeks 100%
View more
Facebook Software Developer Salary
based on 25 salaries
₹27.8 L/yr - ₹51.5 L/yr
272% more than the average Software Developer Salary in India
View more details

Facebook Software Developer Reviews and Ratings

based on 8 reviews

4.2/5

Rating in categories

4.2

Skill development

4.2

Work-life balance

4.2

Salary

4.1

Job security

4.3

Company culture

4.1

Promotions

4.4

Work satisfaction

Explore 8 Reviews and Ratings
Software Engineer
88 salaries
unlock blur

₹73.3 L/yr - ₹120 L/yr

Data Scientist
32 salaries
unlock blur

₹55 L/yr - ₹109.2 L/yr

Software Developer
25 salaries
unlock blur

₹27.8 L/yr - ₹51.5 L/yr

Senior Software Engineer
21 salaries
unlock blur

₹29.3 L/yr - ₹61.2 L/yr

Program Manager
15 salaries
unlock blur

₹32.4 L/yr - ₹53.1 L/yr

Explore more salaries
Compare Facebook with

Google

4.4
Compare

Amazon

4.0
Compare

Apple

4.3
Compare

eBay

4.0
Compare
write
Share an Interview