Upload Button Icon Add office photos

Meta

Compare button icon Compare button icon Compare

Filter interviews by

Meta SDE Interview Questions and Answers

Updated 14 Sep 2024

Meta SDE Interview Experiences

1 interview found

SDE Interview Questions & Answers

user image Anonymous

posted on 14 Sep 2024

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

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

Round 1 - Coding Test 

Binary Search in a rotated array, coding via coderpad

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare leetcode medium

Interview questions from similar companies

SDE Interview Questions & Answers

Facebook user image Anonymous

posted on 5 Jun 2015

Interview Questionnaire 

16 Questions

  • Q1. Given a set of 2D points, some integer k, find the k points closest to the origin, (0,0)
  • Ans. 

    Find k closest points to origin from a set of 2D points.

    • Calculate distance of each point from origin using distance formula

    • Sort the points based on distance in ascending order

    • Return first k points from the sorted list

  • Answered by AI
  • Q2. How will you describe iOS manual memory management for a new developer in few words?
  • Ans. 

    iOS manual memory management requires developers to manually allocate and deallocate memory for objects.

    • Developers must manually allocate memory for objects using methods like alloc and init.

    • Developers must also manually deallocate memory for objects using methods like release.

    • Failure to properly manage memory can lead to memory leaks and crashes.

    • ARC (Automatic Reference Counting) was introduced in iOS 5 to automate me...

  • Answered by AI
  • Q3. Write a program to print the powerset. E.g. given this set {1,2,3}, it will print {},{1},{2},{3},{1,2},{1,3}, {2,3}, {1,2,3}
  • Ans. 

    Program to print powerset of a given set

    • Create an empty list to store subsets

    • Loop through all possible binary numbers from 0 to 2^n-1 where n is the length of the set

    • For each binary number, convert it to binary and use the 1's as indices to select elements from the set

    • Add the selected elements to the list of subsets

    • Return the list of subsets

  • Answered by AI
  • Q4. Convert a string of Roman numerals to an integer in O(n) time
  • Ans. 

    Convert Roman numerals to integer in O(n) time

    • Create a dictionary to map Roman numerals to integers

    • Iterate through the string from right to left

    • If the current numeral is less than the previous, subtract it from the total

    • Else, add it to the total

    • Return the total

  • Answered by AI
  • Q5. Given a list of integer numbers, a list of symbols [+,-,*,/] and a target number N, provide an expression which evaluates to N or return False if that is not possible. e.g. let the list of numbers be [1,...
  • Ans. 

    Given a list of numbers and symbols, provide an expression that evaluates to a target number.

    • Use recursion to try all possible combinations of numbers and symbols

    • Check for division by zero and negative numbers

    • Return False if no expression evaluates to the target number

  • Answered by AI
  • Q6. Given an expression (in single variable) like 4x+13(x-(4x+x/3)) = 9, evaluate x The expression is a string and the variable is always x
  • Ans. 

    Solve for x in a given expression with single variable.

    • Simplify the expression by applying the distributive property and combining like terms.

    • Isolate the variable term on one side of the equation and the constant terms on the other side.

    • Solve for x by dividing both sides of the equation by the coefficient of the variable term.

    • Check the solution by substituting the value of x back into the original equation.

    • In this case...

  • Answered by AI
  • Q7. Given a hashmap M which is a mapping of characters to arrays of substitute characters, and an input string S, return an array of all possible mutations of S (where any character in S can be substituted wit...
  • Ans. 

    Given a hashmap M and an input string S, return an array of all possible mutations of S using M's substitutes.

    • Iterate through each character in S and get its substitutes from M

    • Use recursion to generate all possible combinations of substitutes for each character

    • Time complexity: O(n^m) where n is the average number of substitutes per character and m is the length of S

    • Space complexity: O(n^m) due to the number of possible...

  • Answered by AI
  • Q8. Brain storming:How does facebook implement graph search
  • Ans. 

    Facebook implements graph search by indexing user data and using natural language processing.

    • Facebook indexes user data to create a graph of connections and relationships.

    • Natural language processing is used to interpret user queries and return relevant results.

    • Graph search allows users to search for specific information within their network, such as 'friends who like hiking'.

  • Answered by AI
  • Q9. How does facebook chat work
  • Ans. 

    Facebook chat is a real-time messaging service that allows users to communicate with each other through the Facebook website or mobile app.

    • Facebook chat uses XMPP (Extensible Messaging and Presence Protocol) to enable real-time communication between users.

    • Messages are sent and received through Facebook's servers, which act as intermediaries between users.

    • Users can see when their friends are online and available to chat...

  • Answered by AI
  • Q10. How does fb store likes/dislikes ?
  • Ans. 

    Facebook stores likes/dislikes as data points in their database.

    • Likes and dislikes are stored as separate data points.

    • Each like/dislike is associated with a unique ID for the post or comment.

    • The data is stored in Facebook's database and can be accessed through their API.

    • Likes/dislikes can also be used to personalize a user's newsfeed.

    • Facebook also uses likes/dislikes to gather data for targeted advertising.

  • Answered by AI
  • Q11. How do u implement status updates ?
  • Ans. 

    Status updates can be implemented through various methods such as push notifications, real-time updates, and periodic polling.

    • Use push notifications to instantly update users on important changes.

    • Implement real-time updates using websockets or server-sent events for a seamless user experience.

    • Periodically poll the server for updates using AJAX or other similar technologies.

    • Provide a clear and concise interface for user...

  • Answered by AI
  • Q12. How do u implement timeline/newsfeed ?
  • Ans. 

    A timeline/newsfeed can be implemented using a combination of algorithms and data structures.

    • Use a database to store user activity data

    • Implement an algorithm to sort the data by time

    • Use pagination to limit the number of items displayed at once

    • Include options for filtering and searching

    • Consider using caching to improve performance

  • Answered by AI
  • Q13. What exactly happens when you add someone as your friend ?
  • Ans. 

    Adding someone as a friend allows you to connect with them on the platform and see their updates.

    • When you add someone as a friend, they receive a notification and can choose to accept or decline your request.

    • Once they accept your request, you can see their updates and they can see yours.

    • You can also message each other and tag each other in posts.

    • Adding someone as a friend does not give them access to your personal info...

  • Answered by AI
  • Q14. Explain more about hadoop and how it is used ?
  • Ans. 

    Hadoop is a distributed computing framework used for storing and processing large datasets.

    • Hadoop is based on the MapReduce programming model.

    • It allows for parallel processing of large datasets across multiple nodes.

    • Hadoop consists of two main components: HDFS for storage and MapReduce for processing.

    • It is commonly used for big data analytics, machine learning, and data warehousing.

    • Examples of companies using Hadoop in

  • Answered by AI
  • Q15. How do fb messages work ?
  • Ans. 

    FB messages work by allowing users to send and receive text, images, videos, and other media through the Facebook platform.

    • Messages can be sent to individuals or groups of people.

    • Users can also send voice messages and make voice and video calls through the messaging feature.

    • Messages can be archived or deleted, and users can also choose to ignore or block certain senders.

    • Facebook uses end-to-end encryption to protect th...

  • Answered by AI
  • Q16. How does fb mail work ?
  • Ans. 

    FB Mail is a messaging service that allows Facebook users to send and receive messages from other users.

    • FB Mail is integrated into the Facebook platform and can be accessed through the Messenger app or website.

    • Users can send messages to individuals or groups, and can also attach files, photos, and videos.

    • FB Mail also includes features such as message requests, message filtering, and message archiving.

    • Messages can be se...

  • Answered by AI

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

6 Questions

  • Q1. Find a equilibrium index in array
  • Ans. 

    Find an index in array where sum of elements on left side is equal to sum of elements on right side.

    • Loop through array and calculate sum of all elements

    • Then loop through array again and check if sum of elements on left side is equal to sum of elements on right side

    • Return the index if found, else return -1

  • Answered by AI
  • Q2. Find the minimum no of jumps required to reach the end of array.where element at each index represent how many max moves you will take in right
  • Ans. 

    Find minimum number of jumps required to reach end of array with max moves in right direction at each index.

    • Use dynamic programming approach to solve the problem

    • Maintain an array to store minimum number of jumps required to reach each index

    • Traverse the array and update the minimum number of jumps for each index

    • Return the minimum number of jumps required to reach the end of array

  • Answered by AI
  • Q3. Tournament tree puzzle and write code for that
  • Ans. 

    Tournament tree is a binary tree where each node represents a match between two players/teams.

    • Tournament tree is used in sports tournaments to determine the winner.

    • The leaf nodes represent the players/teams and the internal nodes represent the matches.

    • The winner of each match is the node with the higher score.

    • Code can be written using a recursive function to traverse the tree and determine the winner.

  • Answered by AI
  • Q4. Find the 2 maximum elements in array in O(n+log(n)) comparison
  • Ans. 

    Find 2 maximum elements in array in O(n+log(n)) comparison

    • Use divide and conquer approach

    • Divide array into two halves

    • Recursively find max elements in each half

    • Compare the two max elements to find the overall max elements

  • Answered by AI
  • Q5. Celebrity Problem puzzle and write code for that
  • Q6. Given a 2D array of 0 and 1. where each row is sorted. find the row with maximum no of 1 in minimum time complexcity
  • Ans. 

    Find row with maximum 1s in a sorted 2D array of 0s and 1s.

    • Use binary search to find the first occurrence of 1 in each row.

    • Calculate the number of 1s in each row using the index found in step 1.

    • Keep track of the row with maximum number of 1s.

    • Time complexity: O(m log n), where m is the number of rows and n is the number of columns.

  • Answered by AI

Interview Preparation Tips

College Name: IIT GANDHINAGAR

Skills evaluated in this interview

Interview Questionnaire 

8 Questions

  • Q1. Given an array A[n] such that A[i+1] = A[i]+1 OR A[i]-1, and a number k, find out whether k is present in A[n] or not, in most efficient way?
  • Ans. 

    Efficiently check if a number is present in an array where each element differs by 1.

    • Use binary search to find the element in the array

    • Calculate the difference between the middle element and the first element

    • If the difference is equal to the index of the middle element minus the index of the first element, then the left half of the array is consecutive

    • If the difference is not equal, then the right half of the array is ...

  • Answered by AI
  • Q2. Name any 1 microsoft product that you have been using and suggest 5 improvements in it alongwith priority assignments p1....p5
  • Ans. 

    Microsoft Excel

    • Add more chart types (p1)

    • Improve collaboration features (p2)

    • Enhance data analysis tools (p3)

    • Integrate with more external data sources (p4)

    • Improve error handling and debugging (p5)

  • Answered by AI
  • Q3. A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square
  • Ans. 

    Program to rearrange shuffled 16 squares to get original big square

    • Create a 4x4 matrix to represent the big square and fill it with shuffled squares

    • Loop through the matrix and check if each square is in the correct position

    • If a square is not in the correct position, swap it with the square in the correct position

    • Repeat until all squares are in the correct position

  • Answered by AI
  • Q4. There are 9 identical Marbels out of which 1 is heavy. find out that Marbel
  • Q5. Given 3 sorted arrays, array a, b, c. find all pairs where a[i] + b[j] = c[k] note : a, b , c are sorted arrays
  • Q6. What is the difference between the two declarations? int p=*(int*)i; int p=*(int*)&i;
  • Ans. 

    The first declaration casts i to int pointer and dereferences it, while the second declaration casts the address of i to int pointer and dereferences it.

    • The first declaration assumes i is already an int pointer.

    • The second declaration takes the address of i and casts it to an int pointer.

    • The first declaration may cause a segmentation fault if i is not an int pointer.

    • The second declaration may cause unexpected behavior i...

  • Answered by AI
  • Q7. Given an unsorted array of size 5. How many minimum comparisons are needed to find the median? then he extended it for size n
  • Ans. 

    Minimum comparisons needed to find median in unsorted array of size n

    • For odd n, median is the middle element. For even n, median is the average of middle two elements

    • Minimum comparisons needed for odd n is (n-1)/2. For even n, it is n/2

    • Various sorting algorithms can be used to find median in an unsorted array

  • Answered by AI
  • Q8. Given an array which is alternatively sorted. What will be the time complexity to find out an element in it. e.g. 14,3,16,6,22,7,24,11,27
  • Ans. 

    Time complexity to find an element in an alternatively sorted array.

    • The time complexity will be O(log n) using binary search.

    • Check the middle element and compare with the target element.

    • If the middle element is greater than the target, search in the left half of the array.

    • If the middle element is smaller than the target, search in the right half of the array.

    • Repeat until the target element is found or the array is exha

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: #Given an array A[n] such that A[i+1] = A[i]+1 OR A[i]-1, and a number k, find out whether k is present in A[n] or not, in most efficient way?
#Name any 1 microsoft product that you have been using and suggest 5 improvements in it alongwith priority assignments p1....p5.
#A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.
#There are 9 identical Marbels out of which 1 is heavy. find out that Marbel.
#given 3 sorted arrays, array a, b, c.
find all pairs where a[i] + b[j] = c[k]
note : a, b , c are sorted arrays.
#What is the difference between the two declarations?
int p=*(int*)i;
int p=*(int*)&i;
#Given an unsorted array of size 5.
How many minimum comparisons are needed to find the median? then he extended it for size n.
#Given an array which is alternatively sorted. What will be the time complexity to find out an element in it.
e.g. 14,3,16,6,22,7,24,11,27

College Name: NA

Skills evaluated in this interview

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 24 May 2015

Interview Questionnaire 

5 Questions

  • Q1. What happens when we type amazon.com ?
  • Ans. 

    Typing amazon.com in the browser's address bar takes you to Amazon's website.

    • The browser sends a request to the DNS server to resolve the domain name 'amazon.com' to an IP address.

    • The browser establishes a TCP connection with the server at the resolved IP address.

    • The browser sends an HTTP request to the server for the homepage of Amazon's website.

    • The server responds with the HTML code for the homepage, which the browse

  • Answered by AI
  • Q2. Describe transaction process in detail if we want to transfer from one account to other. Also design scheme for it
  • Ans. 

    The transaction process involves transferring funds from one account to another. A scheme is designed to ensure secure and accurate transfers.

    • Verify the availability of sufficient funds in the sender's account

    • Authenticate the sender's identity and authorization for the transaction

    • Deduct the transfer amount from the sender's account balance

    • Initiate a request to transfer the funds to the recipient's account

    • Validate the r...

  • Answered by AI
  • Q3. What happens on server side on receiving HTTP requests and how operating system interacts and then discussion related with threading, thread pool ,synchronization, hashing etc
  • Ans. 

    When a server receives an HTTP request, it interacts with the operating system, handles threading, thread pooling, synchronization, and hashing.

    • Upon receiving an HTTP request, the server creates a new thread to handle the request.

    • The operating system manages the allocation of system resources to the server process.

    • Thread pooling is used to efficiently manage and reuse threads for handling multiple requests.

    • Synchronizat...

  • Answered by AI
  • Q4. Describe ACID properties in detail
  • Ans. 

    ACID properties ensure reliability and consistency in database transactions.

    • ACID stands for Atomicity, Consistency, Isolation, and Durability.

    • Atomicity ensures that a transaction is treated as a single unit of work, either all or none of its operations are executed.

    • Consistency ensures that a transaction brings the database from one valid state to another.

    • Isolation ensures that concurrent transactions do not interfere w...

  • Answered by AI
  • Q5. How to find kth- smallest element in BST? -----/
  • Ans. 

    To find kth-smallest element in BST, perform inorder traversal and return the kth element.

    • Perform inorder traversal of the BST

    • Maintain a counter variable to keep track of the number of nodes visited

    • When the counter reaches k, return the current node's value

    • If k is greater than the number of nodes in the BST, return null or throw an exception

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Online Round: (Duration – 90 minutes)

20 MCQs and 2 coding questions. MCQs were on Algorithms, Time Complexity, Quantitative Aptitude, Probability, Operating Systems, Graphs, Data Structures, Recursion outputs etc.

Coding Questions:

1. In one of Amazon fulfillment centers, there are a no. of empty boxes kept in increasing order in a row. Kiva robots are designed to put a product in a box. The product size is given. Design a program to find the best fit box for given product size. First line contains no. of empty boxes and next line contains size of boxes with space. The next line contains size of given product. The output shows the best fit box size and -1 otherwise.For example, Input: 6

2 7 9 11 13 16

12

Output: 13 2. You have to find a string in two-dimensional array. The input contains 2-D array of characters and given string. You can move in one of eight directions . The output contains location of first letter of string if string found completely, otherwise return -1. Any one out of multiple answers is accepted, if possible.

For example, Input:

b t g

p a d

r k jString: rat

Output: (2,0)

Round: TECHNICAL INTERVIEW
Experience: Brief introduction about myself and my project.

1. Given an array of positive and negative integers, rearrange positive and negative numbers in 0(n) time .

First, I solved it using 2 arrays,each for positive and negative integers and place elements of array in these 2 arrays and them combine them back by taking one element from each array. Then he told me to do without extra space. I then segregated positive and negative elements using quicksort .Below is the link:

-----. Program to check whether strings are rotation of each other or not. I approached as below:

-----/

He then told to solve without using strstr. I used naive searching method.

Round: HR INTERVIEW
Experience: Brief introduction and some behavioral questions.

Given a BST and a key sum, design an algorithm to find all pairs of integers whose sum equal to key.

I first approached using an array and placing elements into it in inorder fashion and then find pairs. He told to do in-place and I solved with 2 traversals (inorder and reverse- inorder

Round: Technical Interview
Experience: Based on CS Fundamentals and also had 15 minutes discussion on my internship project.
Q.Given a Binary tree, full_path_sum is sum of all nodes from root to leaf in a path. Given a min_sum value, delete nodes if path has full_path_sum less than min_sum . Delete all such nodes . For example,Given min_sum =8 1
2 3
4 5 6 7

College Name: NA

Skills evaluated in this interview

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 25 May 2015

Interview Preparation Tips

Round: Test
Experience: Online Round :(Duration – 90 minutes)20 MCQs to solve and 2 coding questions. 20MCQs were on Algorithms,Data Structures, C Output, Quantitative Aptitude, etc.

Coding questions were of 10 marks each.

MCQ’s had negative marking.

Correct : +1

Wrong : -0.25Q1– Given an array of numbers, arrange them in an alternate fashion such that every number is followed by a number of opposite sign. Also the order was to be maintained. If the count of negative numbers is more keep the extra at last in array and same for positive numbers.Example :

Input: -3 -2 6 0 7 -1 -8

Output: -3 6 -2 0 -1 7 -8Q2– String of characters as arranged in a cellphone i.e.

1- NULL

2-a,b,c

3-d,e,f

4-g,h,i

.

.

.

9-w,x,y,z

0-NULLPrint all combinations for given number of digits(k) in lexicographical order .

Constraint : 1<=k<4

For Example : Input = 234

Output : adg adh adi aeg aeh aei afg afh afi bdg bdh bdi beg beh bei bfg bfh bfi cdg cdh cdi ceg che dei cfg cfh cfi

Round: TECHNICAL INTERVIEW
Experience: Q1– Design a shuffle function which would play songs randomly in your device (unique song_id) and code it.

After i gave him a solution with hash function , he asked me to improve the algorithm such that once a song is played it should be played only when all the other songs are played,

Solution’s Complexity : Space – O(n) , Time – O(1) ; n—> number of songs

After that he asked me to improve my solution and do it without using extra space.

Solution’s Complexity : Space – O(1) , Time – O(n) ; n—>number of songs

Hint : Maintain indices and once a song is played shift it in range of played songs index.

After that i was asked about each part of the hash function and how i came up with that.Q2– Add two linked lists. And code it.Input : 1->2->3->4->NULL

8->2->NULL

Output : 1->3->1->6->NULLFirst he asked to do it without recursion and then with recursion.We also talked about theproblem we face if we store the value of the linked list in an integer or long if the number of digits were above certain limits in the non-recursive function.

Round: TECHNICAL INTERVIEW
Experience: Q1 – Find the largest sub tree which is binary search tree in a given Binary Tree. Then to optimize it and then asked me to code it.
Q2 – Given a linked list with a next pointer and an arbitrary pointer pointing to any node in the list , copy the linked list.After i gave him a solution which changed the links of the initial linked list, he asked me to do without changing the links.So i gave him a O(n^2) solution . He asked me to give another way or optimize my solution.He helped me to figure out the solution.Hint – Hash map.The interviewers were really helping and supporting and were more interested in seeing the efforts you make and the way you get to the logic.They help throughout by giving hints.

College Name: NA

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 4 Jun 2015

Interview Questionnaire 

7 Questions

  • Q1. In a binary tree, a random pointer is given in each node. If this pointer pointing other than any successor of the node then set it as NULL. Otherwise let it remain untouched. Write code
  • Q2. You will be given the number of pairs of parenthesis. Find out the total possible valid unique combinations and there should not be any duplicity. Write code
  • Ans. 

    Find total possible valid unique combinations of given number of pairs of parenthesis without duplicity.

    • Use recursion to generate all possible combinations

    • Check for validity of each combination using a stack

    • Use a set to avoid duplicity

  • Answered by AI
  • Q3. Given an in-order traversal of a special binary tree having property that the node is always greater than its left and right child. Construct the tree and write code
  • Ans. 

    Construct a binary tree from in-order traversal with nodes greater than left and right child.

    • The root node will be the maximum value in the in-order traversal

    • Recursively construct the left and right subtrees using the left and right portions of the in-order traversal

    • Repeat until all nodes are added to the tree

  • Answered by AI
  • Q4. Find top 10 trending words inserted by users in sites like twitter. Only algorithm
  • Ans. 

    An algorithm to find top 10 trending words inserted by users in sites like Twitter.

    • Collect a large dataset of tweets

    • Tokenize the tweets into individual words

    • Remove stop words and punctuation

    • Count the frequency of each word

    • Sort the words by frequency in descending order

    • Select the top 10 words

  • Answered by AI
  • Q5. Write an efficient code to find the first occurrence of 1 in a sorted binary array
  • Ans. 

    Find the first occurrence of 1 in a sorted binary array.

    • Use binary search to find the first occurrence of 1.

    • If the mid element is 1, check if it's the first occurrence or if the element before it is 0.

    • If the mid element is 0, search in the right half of the array.

    • If the mid element is 1 and the element before it is also 1, search in the left half of the array.

  • Answered by AI
  • Q6. Remove duplicated from a string in O(n) without using hash
  • Ans. 

    Remove duplicates from a string in O(n) without using hash

    • Use an array of boolean values to keep track of characters already seen

    • Iterate through the string and mark characters as seen in the array

    • If a character has already been seen, remove it from the string

  • Answered by AI
  • Q7. Ind the first occurrence of 1 in a sorted infinite binary tree
  • Ans. 

    Find the first occurrence of 1 in a sorted infinite binary tree.

    • Use binary search to traverse the tree.

    • If the current node is 1, check if its left child is also 1. If yes, move to the left subtree, else return the current node.

    • If the current node is 0, move to the right subtree.

    • Repeat until the first occurrence of 1 is found or the tree is exhausted.

  • Answered by AI

Interview Preparation Tips

Round: Telephonic
Experience: Q1. For a given number, find the next greatest number which is just greater than previous one and made up of same digits.

Q2. Find immediate ancestor of a given Node

Q3. Clone the linked list having an extra random pointer in nodes which is pointing random node in the list.

Round: HR Interview
Experience: Amazon has many visitors to its site. And it tracks what pages the customers visited, etc and other stuff.Make an efficient data structure for storing 3 days of information of all those customers who have visited site exactly two different days and searched more than 3 unique pages of the site in those 2 days.So whoever visited site exactly two days out of these three days and visited more then 3 unique pages should be in the contact list.

College Name: NA

Skills evaluated in this interview

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 25 May 2015

Interview Questionnaire 

7 Questions

  • Q1. Find the second largest element in an array. (-----/)
  • Ans. 

    Find the second largest element in an array.

    • Sort the array and return the second last element

    • Iterate through the array and keep track of the two largest elements

    • Use a priority queue to find the second largest element

  • Answered by AI
  • Q2. Given a sorted array which can have repeated elements, find the occurrence of an element. (Most optimal solution is O(logn) – Using binary search to find start and end occurrence)
  • Ans. 

    Given a sorted array with repeated elements, find the occurrence of a given element using binary search.

    • Use binary search to find the first occurrence of the element

    • Use binary search to find the last occurrence of the element

    • Calculate the occurrence by subtracting the indices of the last and first occurrences and adding 1

  • Answered by AI
  • Q3. Make a data structure and implement an algorithm to print all the files in a directory. (the root directory can have sub-directories too.) I used an n-ary tree and BFS to print files. It can also be done u...
  • Ans. 

    Implement a data structure and algorithm to print all files in a directory, including sub-directories.

    • Use an n-ary tree or stack to represent the directory structure

    • Implement a BFS or DFS algorithm to traverse the directory and print files

    • Handle sub-directories recursively

    • Consider using a queue or stack to keep track of directories to visit

  • Answered by AI
  • Q4. He asked some question about my CV
  • Q5. Print a matrix diagonally. (-----/)
  • Ans. 

    Print a matrix diagonally.

    • Start from the top left corner and print the diagonal elements

    • Move down and right to print the next diagonal

    • Repeat until all diagonals are printed

  • Answered by AI
  • Q6. DFS of binary tree, n-ary tree
  • Ans. 

    DFS is a traversal algorithm used to visit all nodes of a tree or graph. It can be applied to binary as well as n-ary trees.

    • DFS stands for Depth First Search.

    • In DFS, we start from the root node and visit its children recursively until we reach a leaf node.

    • There are two types of DFS: Preorder (root, left, right) and Postorder (left, right, root).

    • DFS can be implemented using recursion or a stack data structure.

    • Example: I...

  • Answered by AI
  • Q7. Then he asked some question from other subjects. OS – Scheduling DBMS – Normalization, Transaction OOPS – Abstraction

Interview Preparation Tips

Round: Test
Experience: They had an online aptitude test on day 1. It was 90 minutes: 20 MCQs + 2 coding questions (choice between C/C++/Java for coding). MCQs were based on DSA, OS, and Math. They were apparently difficult.

Round: Test
Experience: 1. Keypad problem ( -----/ )– Little difficult problem on backtracking.2. Given an array, find the count of impossible triangle ( -----/ )

Round: Test
Experience: Questions involved DSA and strongly based on optimising the code:



1. Given a linked list, reverse K nodes in it eg :- 1->2->3->4->5->NULL , k = 3 3->2->1->5->4 2. Search for an element in an array which has elements who’s values are first increasing and then decreasing. (Use modified binary search)
Duration: 60 minutes
Total Questions: 2

College Name: NA

Skills evaluated in this interview

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 25 May 2015

Interview Preparation Tips

Round: Telephonic round
Experience: 1. An array is given with element name and their respective pH values. Print the combination of 2 elements which make a neutral compound.

A discussion started and best solution was O(n) time complexity and O(1) space complexity.

Then I got call for F2F interviews and here are those-

Round: Technical Interview
Experience: 1. Print Matrix in spiral form.

2. A store have n customers and any 1 can visit them any time through out the year.Data is stored in a file.Design a data structure to find given person visited on so n so date or not.

Round: Technical Interview
Experience: 1.There are N packages P1, P2…Pn. A package may depend on another or many other for its compilation. Given a matrix of dependency, find a sequence of package compilation.

2.A 2D matrix is given, with each elements representing number of gold coin at that position. I have to travel from (0,0) to last element of matrix collecting maximum no. of coins.I can travel either right of an element or down of it.

3.In Galaxy there are trillions of stars. I am provide distance of every star from earth. Tell me nearest 1Million stars to earth, provided with best time and space complexity.

Round: Technical Interview
Experience: 1. Implement LRU.

2.In Android phones we have 3X3 grid for making a pattern. Given a length, find number of combinations for that length in that grid.

Round: HR Interview
Experience: 1. Project deep discussion.
2. Few given scenarios and how you will tackle.
3. Strengths and weaknesses.
4. Given a file with many statements. Print all the strings with their anagrams through the file.Logic to check anagrams and to store them

Round: Technical Interview
Experience: 1. Behavioral Questions like
>Why you want to leave your organization?
>What is most challenging work you have done till date?
>Why you want to join Amazon?
etc.
2. Which data structure you know?
3.Say I have few words and their meaning, and I want to store them which DS will you use and why.
I started with Hashmap and we kept on discussing about pros and cons.Finally ended up with trie.He asked me to write code for it, for adding new word and for fetching meaning from Trie.The whole process started in 1st week and yesterday got a call from HR for I am invited to be part of Amazon.

College Name: NA

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 2 Jun 2015

Interview Questionnaire 

2 Questions

  • Q1. Find top 10 selling product given the count of sales of each product
  • Ans. 

    To find the top 10 selling products, sort the products by their sales count in descending order and select the first 10.

    • Sort the products by their sales count in descending order

    • Select the first 10 products from the sorted list

  • Answered by AI
  • Q2. Design a valet parking lot with basic use-case of assigning ticket to customer and retrieving the car later. Three sizes available. Use best fit and nearest distance
  • Ans. 

    Design a valet parking lot with ticket assignment and car retrieval using best fit and nearest distance.

    • Create a parking lot with designated spots for each size of car

    • Assign a ticket to the customer upon entry and record the spot number

    • Retrieve the car by searching for the nearest available spot of the appropriate size

    • Use best fit algorithm to minimize empty spots

    • Implement a system for payment upon exit

  • Answered by AI

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

Meta Interview FAQs

How many rounds are there in Meta SDE interview?
Meta interview process usually has 1 rounds. The most common rounds in the Meta interview process are Coding Test.

Tell us how to improve this page.

Meta SDE Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

SDE Interview Questions from Similar Companies

Amazon SDE Interview Questions
4.1
 • 44 Interviews
Google SDE Interview Questions
4.4
 • 15 Interviews
TCS SDE Interview Questions
3.7
 • 12 Interviews
Infosys SDE Interview Questions
3.6
 • 4 Interviews
HCLTech SDE Interview Questions
3.5
 • 3 Interviews
Facebook SDE Interview Questions
4.3
 • 1 Interview
Wipro SDE Interview Questions
3.7
 • 1 Interview
ABCD SDE Interview Questions
3.9
 • 1 Interview
Bhanzu SDE Interview Questions
3.8
 • 1 Interview
View all
Software Engineer
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
15 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Scientist
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Marketing Manager
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Meta with

Google

4.4
Compare

Facebook

4.3
Compare

Amazon

4.1
Compare

Apple

4.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview