"This type of question is a Technical problem. Although you will not need to actually code the feature, it's important to understand basic technical concepts. Being able to cover these concisely with clarity shows you're an effective communicator.
Here, we'll go over the broad technical steps needed to implement a basic reactions feature on Facebook.
Briefly, the steps required are the following:
Migrate the database to support reactions
Write API code to be able to react to a post, and"
Exponent - "This type of question is a Technical problem. Although you will not need to actually code the feature, it's important to understand basic technical concepts. Being able to cover these concisely with clarity shows you're an effective communicator.
Here, we'll go over the broad technical steps needed to implement a basic reactions feature on Facebook.
Briefly, the steps required are the following:
Migrate the database to support reactions
Write API code to be able to react to a post, and"See full answer
"Null hypothesis (H0): the coin is fair (unbiased), meaning the probability of flipping a head is 0.5
Alternative (H1): the coin is unfair (biased), meaning the probability of flipping a head is not 0.5
To test this hypothesis, I would calculate a p-value which is the probability of observing a result as extreme as, or more extreme than, what I say in my sample, assuming the null hypothesis is true.
I could use the probability mass function of a binomial random variable to model the coin toss b"
Lucas G. - "Null hypothesis (H0): the coin is fair (unbiased), meaning the probability of flipping a head is 0.5
Alternative (H1): the coin is unfair (biased), meaning the probability of flipping a head is not 0.5
To test this hypothesis, I would calculate a p-value which is the probability of observing a result as extreme as, or more extreme than, what I say in my sample, assuming the null hypothesis is true.
I could use the probability mass function of a binomial random variable to model the coin toss b"See full answer
"Clarifying question:
By podcast, we mean a series of digital audio generally available on the internet in the form of monologue or interview.
Do we need to integrate it with Facebook or design a separate product? --> Separate Product not related to Facebook
Mobile/web application --> Any
Constraints? --> No
Goal? --> To design a dedicated app to recommend podcasts in order to increase user satisfaction
Users:
Power Users: Who regularly listens to podcasts and keep detailed information on various"
Gunjali D. - "Clarifying question:
By podcast, we mean a series of digital audio generally available on the internet in the form of monologue or interview.
Do we need to integrate it with Facebook or design a separate product? --> Separate Product not related to Facebook
Mobile/web application --> Any
Constraints? --> No
Goal? --> To design a dedicated app to recommend podcasts in order to increase user satisfaction
Users:
Power Users: Who regularly listens to podcasts and keep detailed information on various"See full answer
Product Manager
Product Design
🧠Want an expert answer to a question? Saving questions lets us know what content to make next.
"UX is the foundation of any successful product. It ensures a smooth and intuitive user experience, which is essential for user adoption and engagement. While UI adds the visual polish, it's built upon that strong UX foundation. In my design process, I prioritize crafting a user-centered experience with clear information architecture and interaction flows. Then, I layer on a visually appealing UI that complements and enhances the UX."
Oluwasesan O. - "UX is the foundation of any successful product. It ensures a smooth and intuitive user experience, which is essential for user adoption and engagement. While UI adds the visual polish, it's built upon that strong UX foundation. In my design process, I prioritize crafting a user-centered experience with clear information architecture and interaction flows. Then, I layer on a visually appealing UI that complements and enhances the UX."See full answer
"Is Google partnering with Uber?
Driverless cars - Waymo?
Why not Waymo One app?
Which regions?
Only for children? How about parents with younger children?
Is this a replacement of a school bus?
Only school or everywhere else? Any other place we need Parents with them?
Vision: Organize world’s information so everyone and anyone globally should be able to use that information to get insights, make decisions and even create solutions.
Goals:
Make transportation easier and risk-"
Anonymous Reindeer - "Is Google partnering with Uber?
Driverless cars - Waymo?
Why not Waymo One app?
Which regions?
Only for children? How about parents with younger children?
Is this a replacement of a school bus?
Only school or everywhere else? Any other place we need Parents with them?
Vision: Organize world’s information so everyone and anyone globally should be able to use that information to get insights, make decisions and even create solutions.
Goals:
Make transportation easier and risk-"See full answer
"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
"Clarifying question:
We are just interested in facebook's ad rev and not other meta products
We are looking at the rev coming per year globally
formula = (avg. ads shown per min on fb products) x (avg. time spent per user per day in mins) x (avg. rev that fb makes per view) x (DAU) x 365
assumption
all kind of ads give the same rev per view to fb
all kind of geographies give the same rev per view to fb
avg. ads shown per min -> user can scroll upto 20 posts easily in a min, lets"
Anubhav A. - "Clarifying question:
We are just interested in facebook's ad rev and not other meta products
We are looking at the rev coming per year globally
formula = (avg. ads shown per min on fb products) x (avg. time spent per user per day in mins) x (avg. rev that fb makes per view) x (DAU) x 365
assumption
all kind of ads give the same rev per view to fb
all kind of geographies give the same rev per view to fb
avg. ads shown per min -> user can scroll upto 20 posts easily in a min, lets"See full answer
"Whenever I find resistance to my idea, my general approach is to :
Validate my idea
Identify if it is a political reason or is it a valid engineering tech reason
Assuming it is not political but it is resource/difference of opinions that are causing resistance.
Then I would try to do a quick POC and show a value proposition for the idea to get the buy-in.
One similar situation happened
The situation was that stakeholders were promised a feature that would decrease their number of ticket"
Jaim - "Whenever I find resistance to my idea, my general approach is to :
Validate my idea
Identify if it is a political reason or is it a valid engineering tech reason
Assuming it is not political but it is resource/difference of opinions that are causing resistance.
Then I would try to do a quick POC and show a value proposition for the idea to get the buy-in.
One similar situation happened
The situation was that stakeholders were promised a feature that would decrease their number of ticket"See full answer
"A red-black tree is a self-balancing binary search tree. The motivation for this is that the benefits of O(logN) search, insertion, and deletion that a binary tree provides us will disappear if we let the tree get too "imbalanced" (e.g. there are too many nodes on one side of the tree or some branches have a depth that is way out of proportion to the average branch depth). This imbalance will occur if we don't adjust the tree after inserting or deleting nodes, hence our need for self-balancing c"
Alex M. - "A red-black tree is a self-balancing binary search tree. The motivation for this is that the benefits of O(logN) search, insertion, and deletion that a binary tree provides us will disappear if we let the tree get too "imbalanced" (e.g. there are too many nodes on one side of the tree or some branches have a depth that is way out of proportion to the average branch depth). This imbalance will occur if we don't adjust the tree after inserting or deleting nodes, hence our need for self-balancing c"See full answer
"Acquisition:
#DAU, #MAUs
Engagement:
listening duration
#songs liked/ shared/ added to playlists from the recommendation list
#times recommended songs are listened to
Benchmark the above with original metrics (before implementing the change)
"
Rev - "Acquisition:
#DAU, #MAUs
Engagement:
listening duration
#songs liked/ shared/ added to playlists from the recommendation list
#times recommended songs are listened to
Benchmark the above with original metrics (before implementing the change)
"See full answer
"My solution is simple; it does an in-order DFS traversal to create an array of in-order elements then it searches through the array to find the node we want the successor of. finally we return the node that is 1 after the input node, in the case our input node is the last element of our DFS we know there is no successor, therefore it returns None/null.
CODE INSTRUCTIONS:
1) The method fi"
Rohan M. - "My solution is simple; it does an in-order DFS traversal to create an array of in-order elements then it searches through the array to find the node we want the successor of. finally we return the node that is 1 after the input node, in the case our input node is the last element of our DFS we know there is no successor, therefore it returns None/null.
CODE INSTRUCTIONS:
1) The method fi"See full answer
"It could make Gmail less accessible to people who cannot afford to pay for it.
It could lead to users switching to other email providers.
It could damage Google's reputation as a company that provides free services."
Praful B. - "It could make Gmail less accessible to people who cannot afford to pay for it.
It could lead to users switching to other email providers.
It could damage Google's reputation as a company that provides free services."See full answer