Interview Questions

Mark - "Questions: Is "Facebook Search" referring to the overall search bar at the top where users can search across multiple facebook products (people, events, groups, marketplace, etc.) Interview (I): Assume it is for the overall search experience What's the current goal for Facebook as a company? How does Facebook search fit into the current company goal? I: Your call **What's the goal for this improvement for Facebook Search? Are we aiming to drive engagement overall?"See full answer

Himanshu V. - "Video engagement: time spent, frequency, recency Video completion rate Time spent on Facebook vs Time spent on watching FB videos Video recommendation: Switching from 1st to 2nd and so on "See full answer

Swaroop M. - "Formulate a draft format of idea, open to feedback, communicate your progress"See full answer

Ben L. - "First I want to look at how Facebook stories overlaps with Facebook’s mission. I can see pretty instantly that stories stays true to Facebook’s mission with bringing the world together and connecting friends and families. I want to make sure I understand the product journey. Facebook stories allows users to post videos and photos. While also being able to add filters, music, and stickers. Users are also able to comment on other stories and react to them. Does that sound correct? Interview: Ye"See full answer

Bill P. - "benefit to the project Probability of intended outcome Affect on resources needed to complete project"See full answer

Bg - "My use of Pinterest is somewhat limited. Pinterest is a social network that enables users to save and share ideas in a visual manner. So whether you are interested in fashion, health, lifestyle, decor, sports, you can learn about those in a visual manner. Am I correct? Of course, Pinterest provides recommendations for people to follow, makes it easy to save images as pins, categorize into various topics. The source of revenue is advertisements. That’s my understanding. Is there anything else I"See full answer

Anjaly J. - "Wing is a subsidiary of Alphabet that provides technology for drone delivery of freight. Current pain points : Noise level when drones are flying Competitive landscape in terms of traffic management system Broadcast network IDs to identify the recipient - privacy concern Considering that privacy concern is a large issue by itself and traffic management system is something I assume Wing would have plans for the future, Idea would be work on the noise level as a recently joined PM. "See full answer

Amishr - "For a mature product, I would do the following - Review the list of backlog items Meet with stakeholders and business owners to verify the relevance (are they still valid? esp. for new feature request) Break down the backlog list by a. Product improvements b. New features c. Operational Resiliency Do a 70-30 split with New features+Product Imp =70%, Resiliency =30% Prioritize by impact/scale and effort (team's capacity) by quarter Revisit Quarterly For a new product - Start"See full answer

Mark - "Clarification Am I the PM for overall Xbox or certain part of the Xbox team? Interview (I): let's assume you own the overall Xbox product Are there particular user segments that the MSFT Gaming division is trying to focus on as their strategy? I: nothing in particular, why don't you tell me where we should focus? What are some challenges that Xbox have been facing? (ie revenue from xbox hardware purchase? xbox live subscription purchase? engagement?) I: nothing in pa"See full answer

Rick E. - " O(n) time, O(1) space from typing import List def maxsubarraysum(nums: List[int]) -> int: if len(nums) == 0: return 0 maxsum = currsum = nums[0] for i in range(1, len(nums)): currsum = max(currsum + nums[i], nums[i]) maxsum = max(currsum, max_sum) return max_sum debug your code below print(maxsubarraysum([-1, 2, -3, 4])) `"See full answer

Konstantin P. - "Count how many 1 and 2. calculate how many remaining items with '0'. Override existing data with knowledge of how many '0','1','2' in that order; TC=O(n), SC=O(1)"See full answer

Nitin P. - "public static void sortBinaryArray(int[] array) { int len = array.length; int[] res = new int[len]; int r=len-1; for (int value : array) { if(value==1){ res[r]= 1; r--; } } System.out.println(Arrays.toString(res)); } `"See full answer

Nathan B. - " This is mostly correct and fairly fast. My code has a bug somewhere where it fails on cases like the last case, where there are negative number on both ends of the array and the sums . from collections import deque debug = True # False def prdbg(*x): global debug debug = True # False if debug: print(x) else: return def max_sum(arr, start, end): if type(arr) == type(''' "See full answer

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