Interview Questions

Teddy Y. - "class Node: def init(self, value): self.value = value self.children = [] def inorder_traversal(root): if not root: return [] result = [] n = len(root.children) for i in range(n): result.extend(inorder_traversal(root.children[i])) if i == n // 2: result.append(root.value) if n == 0: result.append(root.value) return result Example usage: root = Node(1) child1 = Node(2) chil"See full answer

Ishita S. - "We know that Meta’s mission is to build the future of human connection and the technology that enables it. In line with this, we aim to build a product that enables knowledge and skill sharing within communities. User Segments A skill-sharing platform typically serves two broad segments. Creators are people who create content, share resources, and moderate communities. They include: Peer educators such as college seniors and teaching assistants Hobby experts Semi-professional c"See full answer

Soodong P. - "Product and Mission To allow users to create events and host on FB pages. It can be one time or recurring. It can include FB users through feeds or referrals or can be shared out with a link. Product objective is to build strong online and offline bonding through connecting people with common interests and ensure continued engagements. Aligns with the core Meta mission. User Journey and Value + Metrics Organizers: Finds the value when the many participants share interest or"See full answer

Jatin S. - "A project charter is a formal document that authorizes a project and outlines its objectives, scope, stakeholders, and key details. It serves as an agreement among stakeholders and provides a clear foundation for the project by defining what needs to be done and why. Typically, the project sponsor issues the project charter to the project manager or team, formally initiating the project. A project charter typically includes the following key elements to ensure a comprehensive and clear unde"See full answer

Md kamrul H. - "public class HashMap { public class Element { T key; V value; Element(T k, V v) { this.key = k; this.value = v; } } private static final int DEFAULT_CAPACITY = 16; private static final float LOAD_FACTOR = 0.75f; private LinkedList[] table = new LinkedList[DEFAULT_CAPACITY]; private int size = 0; private int threshold = (int) (DEFAULTCAPACITY * LOADFACTOR); public void put(T k"See full answer

Shar N. - "standard answer for this."See full answer

Areeba M. - "create a queue push all cells with 0 into queue Mark all 1s as unvisited (-1 or large value) Run BFS for each cell, explore 4 directions If neighbor is unvisited:distance = current + 1 push into queue "See full answer

Anubhav S. - " At low level: I would use two stacks: one for forward history and other for backward history. i go to tryexponent.com => this url will be stored in backward history stack. i go to google => again this url will be stored in backward history stack. i press back => data from backward history will be popped and put in to forward history stack. I press forward => data from forward history stack will be popped and put in to backward history tab. Also, whenever i go to any url,"See full answer

Gaston B. - "Use a representative of each, e.g. sort the string and add it to the value of a hashmap> where we put all the words that belong to the same anagram together."See full answer

GalacticInterviewer - "I first clarified what he needed for the leaderboard meaning did he need a gaming leaderboard system, a stock market leaderboard system where the trades placed would be ranked in terms of values or a coding platform leaderboard where the users are ranked as per the points earned by solving the problem? He answered that he wanted a multipurpose leaderboard system He was specifically interested in the design of the api part Explained him that assuming we had a flask api there would be a get re"See full answer

GalacticInterviewer - "Approach 1: Use sorting and return the kth largest element from the sorted list. Time complexity: O(nlogn) Approach 2: Use max heap and then select the kth largest element. time complexity: O(n+logn) Approach 3: Quickselect. Time complexity O(n) I explained my interviewer the 3 approaches. He told me to solve in a naive manner. Used Approach 1 had some time left so coded approach 3 also The average time complexity of Quickselect is O(n), making it very efficient for its purpose. However, in"See full answer