Skip to main content

Meta Interview Questions

Review this list of 663 Meta interview questions and answers verified by hiring managers and candidates.
  • Meta logoAsked at Meta 

    "asdsad"

    Develop games G. - "asdsad"See full answer

    Engineering Manager
    Product Design
    +2 more
  • Meta logoAsked at Meta 
    Video answer for 'Sort a doubly linked list using merge sort.'
    +4

    "arr1.append(arr2); arr1.sort();"

    Gennady O. - "arr1.append(arr2); arr1.sort();"See full answer

    Data Structures & Algorithms
    Coding
    +1 more
  • Meta logoAsked at Meta 
    +3

    "function main(){ const v1=[2,3, 4, 10] const v2= [3,4 ,5,20, 23] return merge(v1,v2); } function merge(left, right){ const result=[]; while(left.length>0&& right.length>0){ if(left[0]0){ result=result.concat(left) } if(right.length>0){ result=result.concat(right) } return result; }"

    Samuel M. - "function main(){ const v1=[2,3, 4, 10] const v2= [3,4 ,5,20, 23] return merge(v1,v2); } function merge(left, right){ const result=[]; while(left.length>0&& right.length>0){ if(left[0]0){ result=result.concat(left) } if(right.length>0){ result=result.concat(right) } return result; }"See full answer

    Software Engineer
    Data Structures & Algorithms
    +4 more
  • Meta logoAsked at Meta 
    +6

    "bool isValidBST(TreeNode* root, long min = LONGMIN, long max = LONGMAX){ if (root == NULL) return true; if (root->val val >= max) return false; return isValidBST(root->left, min, root->val) && isValidBST(root->right, root->val, max); } `"

    Alvaro R. - "bool isValidBST(TreeNode* root, long min = LONGMIN, long max = LONGMAX){ if (root == NULL) return true; if (root->val val >= max) return false; return isValidBST(root->left, min, root->val) && isValidBST(root->right, root->val, max); } `"See full answer

    Data Engineer
    Data Structures & Algorithms
    +4 more
  • 🧠 Want an expert answer to a question? Saving questions lets us know what content to make next.

  • Meta logoAsked at Meta 

    "int[] sqSorted(int[] nums) { int i = 0, j = nums.length-1; int k = nums.length-1; int[] sqs = new int[nums.length]; while(i n1) { sqs[k--] = n2; j--; } else { sqs[k--] = n1; i++; } } for(int n: sqs) System.out.println(n); return sqs; }"

    Mahaboob P. - "int[] sqSorted(int[] nums) { int i = 0, j = nums.length-1; int k = nums.length-1; int[] sqs = new int[nums.length]; while(i n1) { sqs[k--] = n2; j--; } else { sqs[k--] = n1; i++; } } for(int n: sqs) System.out.println(n); return sqs; }"See full answer

    Data Engineer
    Data Structures & Algorithms
    +2 more
  • Meta logoAsked at Meta 
    Machine Learning Engineer
    Behavioral
    +1 more
  • "when we are discussing about some issues, subjects or problem . we should consider all of the possibility cases which envolved inside the scenario.all of persons has own atitudes . challenging has a this benefite to see the problems and solves on other ways."

    Nick L. - "when we are discussing about some issues, subjects or problem . we should consider all of the possibility cases which envolved inside the scenario.all of persons has own atitudes . challenging has a this benefite to see the problems and solves on other ways."See full answer

    Technical Program Manager
    Program Sense
  • Meta logoAsked at Meta 
    Video answer for 'Print the left view of a binary tree.'

    "Initially I asked clarifying questions like whether the tree can be empty or not and asked the interviewer to explain what is meant by left view and the explanation for the sample inputs. Then I came up with the level order traversal approach where we visit each level in the binary tree at once using a queue and at each level print the value of the first node. Interviewer seemed satisfied with the approach and asked me to code it up. Finally gave the time and space complexity of the solution."

    Ds S. - "Initially I asked clarifying questions like whether the tree can be empty or not and asked the interviewer to explain what is meant by left view and the explanation for the sample inputs. Then I came up with the level order traversal approach where we visit each level in the binary tree at once using a queue and at each level print the value of the first node. Interviewer seemed satisfied with the approach and asked me to code it up. Finally gave the time and space complexity of the solution."See full answer

    Software Engineer
  • Meta logoAsked at Meta 
    Product Manager
    Product Design
  • "Clarify: Across all platforms? - Yes Specific geographies? - No Any specific users? Like >60 years - No Benefits of profile picture: User can find their friends by identifying them through profile picture. Helps in understanding if the profile is genuine. Also establishes trust in the platform. Users checking profiles is also a way for users to engage on the platform. Possible decisions: Remove profile upload feature Make it optional No change Approach to make decis"

    Nishant V. - "Clarify: Across all platforms? - Yes Specific geographies? - No Any specific users? Like >60 years - No Benefits of profile picture: User can find their friends by identifying them through profile picture. Helps in understanding if the profile is genuine. Also establishes trust in the platform. Users checking profiles is also a way for users to engage on the platform. Possible decisions: Remove profile upload feature Make it optional No change Approach to make decis"See full answer

    Product Manager
    Analytical
    +2 more
  • Meta logoAsked at Meta 

    "Clarifying questions and assumptions: Personalised news feed is the culmination of curated posts, events, ads , videos, etc that is unique to each user. potentially this means that no 2 feeds are the same. I am assuming we are talking about the Facebook Blue app, since the term Newsfeed is generally associated with this app although the feed on Insta too is personalised. Thank you for this question. here is how i would structure my thoughts on arriving at success metrics for Personalised Ne"

    Sneha S. - "Clarifying questions and assumptions: Personalised news feed is the culmination of curated posts, events, ads , videos, etc that is unique to each user. potentially this means that no 2 feeds are the same. I am assuming we are talking about the Facebook Blue app, since the term Newsfeed is generally associated with this app although the feed on Insta too is personalised. Thank you for this question. here is how i would structure my thoughts on arriving at success metrics for Personalised Ne"See full answer

    Product Manager
    Analytical
  • +1

    "I would structure my answer in the following way: What's the situational context? Mission of Uber Making transportation easy by creating a platform for connecting drivers and riders Key market trends: In top tier cities there are players in the food delivery market and the size of the pie is growing fast What would feed into the decision-making? The new platform should be able to connect customers and restaurants. The key things needed to make this platform success"

    pmpractice - "I would structure my answer in the following way: What's the situational context? Mission of Uber Making transportation easy by creating a platform for connecting drivers and riders Key market trends: In top tier cities there are players in the food delivery market and the size of the pie is growing fast What would feed into the decision-making? The new platform should be able to connect customers and restaurants. The key things needed to make this platform success"See full answer

    Product Manager
    Analytical
    +1 more
  • Meta logoAsked at Meta 
    +2

    "This could be done using two-pointer approach assuming array is sorted: left and right pointers. We need track two sums (left and right) as we move pointers. For moving pointers we will move left to right by 1 (increment) when right sum is greater. We will move right pointer to left by 1 (decrement) when left sum is greater. at some point we will either get the sum same and that's when we exit from the loop. 0-left will be one array and right-(n-1) will be another array. We are not going to mo"

    Bhaskar B. - "This could be done using two-pointer approach assuming array is sorted: left and right pointers. We need track two sums (left and right) as we move pointers. For moving pointers we will move left to right by 1 (increment) when right sum is greater. We will move right pointer to left by 1 (decrement) when left sum is greater. at some point we will either get the sum same and that's when we exit from the loop. 0-left will be one array and right-(n-1) will be another array. We are not going to mo"See full answer

    Software Engineer
    Data Structures & Algorithms
    +2 more
  • Meta logoAsked at Meta 
    Machine Learning Engineer
    Behavioral
    +1 more
  • Meta logoAsked at Meta 
    Product Manager
    Analytical
    +2 more
  • Meta logoAsked at Meta 

    "Law is my passion. Traveling all over the world in 5 years"

    Moshe S. - "Law is my passion. Traveling all over the world in 5 years"See full answer

    Software Engineer
    Behavioral
    +4 more
  • "Learn to know why they want to switch and also make sure their understanding about the new role is in line with organization standards. Train them if they are lagging in some aspects and make sure to layout a plan for them to grow in that direction. Put them in pilot project or as shadow manager for some time if there are any opportunities in the organization. Once they are up to speed help them applying internally to the specific position."

    BePostive - "Learn to know why they want to switch and also make sure their understanding about the new role is in line with organization standards. Train them if they are lagging in some aspects and make sure to layout a plan for them to grow in that direction. Put them in pilot project or as shadow manager for some time if there are any opportunities in the organization. Once they are up to speed help them applying internally to the specific position."See full answer

    Behavioral
  • +1

    "Define Groups: Platform where users ( organizers and members) with shared interests can come together and express their thoughts and opinions. Meta's mission: To bring ppl closer together by giving them access to tools and technology. Groups Mission alignment: Gives Organizers and members to come closer together over shared interests and build community. Users : Organizers ( create a group-> invite people on the platform --> can accept or deny a member to the group --> Intera"

    Anjali M. - "Define Groups: Platform where users ( organizers and members) with shared interests can come together and express their thoughts and opinions. Meta's mission: To bring ppl closer together by giving them access to tools and technology. Groups Mission alignment: Gives Organizers and members to come closer together over shared interests and build community. Users : Organizers ( create a group-> invite people on the platform --> can accept or deny a member to the group --> Intera"See full answer

    Analytical
    Execution
  • "Use an index, two pointers, and a set to keep track of elements that you've seen. pseudo code follows: for i, elem in enumerate(array): if elem in set return False if i > N: set.remove(array[i-N])"

    Michael B. - "Use an index, two pointers, and a set to keep track of elements that you've seen. pseudo code follows: for i, elem in enumerate(array): if elem in set return False if i > N: set.remove(array[i-N])"See full answer

    Machine Learning Engineer
    Coding
Showing 401-420 of 663