Facebook(Meta) SDE Sheet: Interview Questions and Answers Last Updated : 23 Jul, 2025 Comments Improve Suggest changes Like Article Like Report Facebook(Meta) is an online social media and social networking service owned by the American company Meta Platforms. It employs around 72000 people across the globe and is ranked 27th in the fortune 500 rankings. This sheet will assist you to land a job at Facebook we have compiled all the interview questions and answers..Facebook SDE Sheet Many people aspire to be an employee at Meta because of the company's unique culture which promotes both personal and cultural growth. The recruitment at Meta is broadly a 4 step process:Resume Screenings: Recruiters will screen your resume for technical requirements, education, and experience, to check if you’re a potential fit.Phone screenings: There are usually two rounds of phone screenings at meta: Pre-Screen(20 mins): HR recruiter will contact you to ask a few behavioral questions on the phone to assess your background and qualities.Technical Phone Screening: A Facebook engineer will ask some questions from your resume for 10-15 minutes, then you will be given one or two coding questions (e.g. data structures, algorithms, etc.) on a simple online code editor, to be solved within 30 minutes,On-site Interviews: This involves 4-5 interviews with a team of recruiters, each interview lasts for about 45 mins. For Technical roles, there are two main types of interviews. 2 or more interviews for each type. Coding on-site interviews: whiteboarding solutions to slightly harder data structures and/or algorithmic problems.System Design on-site interviews: You will be asked to come up with high-level design architectures for real-life products. Hiring Committee reviews: It is more like a candidate assessment meeting where team leaders/ managers will determine whether you’re a good fit for their respective teams.Facebook SDE Roadmap Resume Builder Phone screenings Behavioral Skills Technical Phone Screening Coding on-site interview Array String Linked List Tree Graph Searching & Sorting Stack & Queue Dynamic Programing System Design Why this sheet?Landing a job at Facebook is challenging. Facebook as a recruiter has high standards which is justified as it is one of the most iconic tech companies and also the competition is tough. We have come up with this sheet to help you beat that competition and grab your dream job. This sheet covers all the important and popular technical questions asked in Facebook interviews so far. Questions and answers in this sheet are grouped topic-wise and cover all major DSA topics that have weightage in meta interviews with the practice link.Resume BuilderThe sole purpose of a resume is to make you land your dream job. It introduces your qualifications, skills, achievements, and everything regarding your expertise. It helps you land your career. When you have a perfect resume, nothing can be a hindrance to the best job.We have our own resume Builder which can help you build a powerful resume to get through the resume screening round. You can check it out here- GFG resume builderPhone screeningsBehavioral SkillsMany people are very afraid of behavioral interview questions in technical interviews as they seem to be just something most programmers are not good at.Unlike technical questions, which are very standard and usually have clear answers, behavioral interview questions are much more flexible and sometimes may make candidates quite uncomfortable. We have tips for Prepare Behavioural Interview Questions Technical Phone ScreeningEven though telephonic interviews have many benefits, including the flexibility to attend from anywhere and the ability to go back to notes, there are still some complexity and problems that are part of them, so you must be ready for them if you want to be approved for final selection.We have prepared tips to crack a telephonic Interview.Coding on-site interviewArray: An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together.ArticlesPracticeMove all zeroes to the end of arraySolveSubarray with given sumSolveFind k numbers with most occurrences in the given arraySolveBest meeting point in 2D binary arraySolveLargest Sum Contiguous SubarraySolveMatrix RotationSolveTrapping Rain WaterSolveNext PermutationSolveProduct of Array except itselfSolveSearch a Word in a 2D Grid of charactersSolveProgram for Conway’s Game Of LifeSolvePascal’s TriangleSolveNumber of square matrices with all 1sSolveMinimum time required to produce m itemsSolveCount of submatrix with sum X in a given MatrixSolveThird largest element in an array of distinct elementsSolveCount Smaller elementsSolveMinimum number of jumps to reach endSolveLargest Fibonacci SubsequenceSolveMajority ElementSolveString: Strings are defined as an array of characters. The difference between a character array and a string is the string is terminated with a special character ‘\0’.ArticlesPracticeJustify the given Text based on the given width of each lineSolveProgram to convert a given number to wordsSolveIterative Letter Combinations of a Phone NumberSolveFind the smallest window in a string containing all characters of another stringSolvePrint all combinations of balanced parenthesesSolveGiven a sequence of words, print all anagramsSolveSum of two large numbersSolveConverting Roman Numerals to Decimal lying between 1 to 3999SolveGiven a string, find its first non-repeating characterSolveProgram to validate an IP addressSolveSimplify the directory pathSolveLook-and-Say SequenceSolveGenerate all binary strings from given patternSolveMultiply Large Numbers represented as StringsSolveFind if a given string can be represented from a substring by iterating the substring “n” timesSolveHow to replace a substring of a stringSolveLength of the smallest sub-string consisting of maximum distinct charactersSolvePut spaces between words starting with capital letters loveSolveLinkedList: Linked List is the data structure that can overcome all the limitations of an array. A Linked list is a linear data structure, in which the elements are not stored at contiguous memory locations, it allocates memory dynamically.ArticlesPracticeReverse a linked listSolveMerge K sorted linked listsSolveAdd two numbers represented by linked listsSolveClone a linked list with next and randomSolveFunction to check if a singly linked list is palindromeSolveReverse a Linked List in groups of given sizeSolveWrite a function to get the intersection point of two Linked ListsSolveDetect loop in a linked listSolveDelete a Linked List node at a given positionSolveRemove duplicates from a sorted linked listSolveTree: A tree is non-linear and a hierarchical data structure consisting of a collection of nodes such that each node of the tree stores a value, a list of references to nodes (the “children”).ArticlesPracticeBinary Tree to DLLSolveSerialize and Deserialize a Binary TreeSolveLevel Order Binary Tree TraversalSolveConvert a Binary Tree to a Circular Doubly Link ListSolveLowest Common Ancestor in a Binary TreeSolveA program to check if a binary tree is BST or notSolveDiameter of a Binary TreeSolveCheck if a binary tree is subtree of another binary treeSolveGiven a binary tree, print all root-to-leaf pathsSolveMinimum number of cameras required to monitor all nodes of a Binary TreeSolveInorder Successor in Binary Search TreeSolveConnect nodes at same level using constant extra spaceSolveGraph: A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.ArticlesPracticeClone an Undirected GraphSolveCheck whether a given graph is Bipartite or notSolveTopological SortingSolveFind the number of islandsSolveDetect Cycle in a Directed GraphSolveDetect Cycle in a directed graph using colorsSolveArticulation Points (or Cut Vertices) in a GraphSolveImplementing Dijkstra AlgorithmSolveStrongly Connected Components (Kosaraju's Algo)SolvePrerequisite TasksSolveDistance from the Source (Bellman-Ford Algorithm)SolveWord Boggle - IISolveSorting and Searching:Sorting: The sorting Algorithm is used to rearrange a given array or list of elements according to a comparison operator on the elements.Searching: Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored.ArticlesPracticeKey PairSolveFind all triplets with zero sumSolveMedian of two sorted arrays of different sizesSolveMerge Overlapping IntervalsSolveSquare root of an integerSolveSearch in a Rotated ArraySolveSort an array of 0s, 1s and 2sSolveInsert in sorted and non-overlapping interval arraySolveFind H-Index for sorted citations using Binary SearchSolveNumber of subarrays having sum in a given rangeSolveStack and Queue:Stack: A stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the top. A stack follows the LIFO (Last In First Out) principle.Queue: A queue is a linear data structure in which elements can be inserted only from one side of the list called the rear, and the elements can be deleted only from the other side called the front. The queue data structure follows the FIFO (First In First Out) principle.ArticlesPracticeCheck for Balanced Brackets in an expression (well-formedness) using StackSolveRemove Invalid ParenthesesSolveLargest Rectangular Area in a HistogramSolveThe Celebrity ProblemSolveSort a stackSolveCircular tourSolveDynamic Programming: Dynamic Programming is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming.ArticlesPracticeCount Possible Decoding's of a given Digit SequenceSolveMaximum size square sub-matrix with all 1sSolveStock Buy Sell to Maximize ProfitSolveWord BreakSolveWildcard Pattern MatchingSolveMaximum size rectangle binary sub-matrix with all 1sSolveMax sum of M non-overlapping subarrays of size KSolveMaximum average sum partition of an arraySolvePainting Fence AlgorithmSolveLongest Increasing SubsequenceSolveFind size of the largest ‘+’ formed by all ones in a binary matrixSolveCount All Palindrome Sub-Strings in a StringSolveCount ways to reach the n’th stairSolveBurst Balloon to maximize coinsSolveLargest divisible subset in arraySolveTarget SumSolveConstruct all possible BSTs for keys 1 to NSolveSystem DesignSystem Design is the process of designing the architecture, components, and interfaces for a system so that it meets the end-user requirements. System Design for tech interviews is something that can’t be ignored!Almost every IT giant whether it be Facebook, Amazon, Google, or any other asks various questions based on System Design concepts such as scalability, load-balancing, caching, etc. in the interview. This specifically designed System Design Tutorial & System Design Course will help you to learn and master System Design concepts in the most efficient way from basics to advanced level. Comment More infoAdvertise with us K kartik Follow Improve Article Tags : DSA Software Development Interview Questions Facebook Interview-Questions GFG Sheets SDE Sheet Company SDE Sheet +4 More Practice Tags : Facebook Similar Reads Basics & PrerequisitesLogic Building ProblemsLogic building is about creating clear, step-by-step methods to solve problems using simple rules and principles. It’s the heart of coding, enabling programmers to think, reason, and arrive at smart solutions just like we do.Here are some tips for improving your programming logic: Understand the pro 2 min read Analysis of AlgorithmsAnalysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.BasicsWhy is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best Cases Asymptotic NotationsB 1 min read Data StructuresArray Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 3 min read String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 2 min read Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The 2 min read Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List: 2 min read Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first 2 min read Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems 2 min read Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most 4 min read Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of 3 min read Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this 15+ min read AlgorithmsSearching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input 2 min read Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get 3 min read Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net 3 min read Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of 3 min read Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read AdvancedSegment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree 3 min read Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i 2 min read GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br 2 min read Interview PreparationInterview Corner: All Resources To Crack Any Tech InterviewThis article serves as your one-stop guide to interview preparation, designed to help you succeed across different experience levels and company expectations. Here is what you should expect in a Tech Interview, please remember the following points:Tech Interview Preparation does not have any fixed s 3 min read GfG160 - 160 Days of Problem SolvingAre you preparing for technical interviews and would like to be well-structured to improve your problem-solving skills? Well, we have good news for you! GeeksforGeeks proudly presents GfG160, a 160-day coding challenge starting on 15th November 2024. In this event, we will provide daily coding probl 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding PlatformGeeksforGeeks Practice is an online coding platform designed to help developers and students practice coding online and sharpen their programming skills with the following features. GfG 160: This consists of most popular interview problems organized topic wise and difficulty with with well written e 6 min read Problem of The Day - Develop the Habit of CodingDo you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:Suppose you commit to improve yourself an 5 min read Like