Skip to main content

Interview Questions

Review this list of 4,477 interview questions and answers verified by hiring managers and candidates.
  • Meta logoAsked at Meta 
    Add answer
    Engineering Manager
    Data Structures & Algorithms
    +1 more
  • Meta logoAsked at Meta 
    Add answer
    Engineering Manager
    System Design
    +1 more
  • Meta logoAsked at Meta 
    Add answer
    Engineering Manager
    System Design
    +1 more
  • Meta logoAsked at Meta 
    Add answer
    Engineering Manager
    Data Structures & Algorithms
    +1 more
  • Meta logoAsked at Meta 
    2 answers

    "ads vsd dsa. How would you improve Facebook Groups given the goal of increasing the feeling of community?"

    Raj S. - "ads vsd dsa. How would you improve Facebook Groups given the goal of increasing the feeling of community?"See full answer

    Product Design
  • 🧠 Want an expert answer to a question? Saving questions lets us know what content to make next.

  • Apple logoAsked at Apple 
    7 answers
    +4

    "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)); } `"

    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

    Software Engineer
    Data Structures & Algorithms
    +1 more
  • Anthropic logoAsked at Anthropic 
    Add answer
    Machine Learning Engineer
    Behavioral
  • Google logoAsked at Google 
    1 answer

    "def encode(root): if not root: return [] def dfs(node): if not node: return res.append(node.val) res.append(len(node,children)) for child_node in node.children: dfs(child_node) res = [] dfs(root) return res def decode(arr): if not arr: return None n = len(arr) i = 0 def dfs(val, children_count): if children_count == 0: return Node(val) cur_node = Node(val) cur_node.children = [] for j in range(children_count): nonlocal i i += 2 cur_node.children.append(dfs(arr[i], arr[i"

    Ying T. - "def encode(root): if not root: return [] def dfs(node): if not node: return res.append(node.val) res.append(len(node,children)) for child_node in node.children: dfs(child_node) res = [] dfs(root) return res def decode(arr): if not arr: return None n = len(arr) i = 0 def dfs(val, children_count): if children_count == 0: return Node(val) cur_node = Node(val) cur_node.children = [] for j in range(children_count): nonlocal i i += 2 cur_node.children.append(dfs(arr[i], arr[i"See full answer

    Software Engineer
    Coding
  • Airbnb logoAsked at Airbnb 
    3 answers

    "I'm interpreting this question as "what's the process you'd go through to launch a new product". I'd approach it this way, assuming we haven't yet made any determinations around the what/how: Step 1: Pick an industry of interest with Industry criteria based on Industry growth rate VC investments (pitchbook is a good resource) Step 2: Evaluate the various industry verticals and select the vertical with the most opportunity evaluated by Age of companies New entrants Existing -"

    Diamonde H. - "I'm interpreting this question as "what's the process you'd go through to launch a new product". I'd approach it this way, assuming we haven't yet made any determinations around the what/how: Step 1: Pick an industry of interest with Industry criteria based on Industry growth rate VC investments (pitchbook is a good resource) Step 2: Evaluate the various industry verticals and select the vertical with the most opportunity evaluated by Age of companies New entrants Existing -"See full answer

    Product Strategy
  • Anduril logoAsked at Anduril 
    Add answer
    Technical Program Manager
    Behavioral
  • Anduril logoAsked at Anduril 
    Add answer
    Technical Program Manager
    Program Sense
  • Perplexity AI logoAsked at Perplexity AI 
    Add answer
    Product Manager
    Behavioral
    +1 more
  • Apple logoAsked at Apple 
    4 answers

    "I was a student worker at Gordon's Food Service, Schaumburg, My tasks were vacuuming onion peels, checking expiration dates, cleaning the break room, cleaning the shelves from the Ailes, Stocking stuff on shelves, sweeping the backroom, mopping, Refilling bottles with cleaning supplies and cleaning the fridge glass."

    Amparo L. - "I was a student worker at Gordon's Food Service, Schaumburg, My tasks were vacuuming onion peels, checking expiration dates, cleaning the break room, cleaning the shelves from the Ailes, Stocking stuff on shelves, sweeping the backroom, mopping, Refilling bottles with cleaning supplies and cleaning the fridge glass."See full answer

    Software Engineer
    Behavioral
  • Apple logoAsked at Apple 
    1 answer

    "This is an interesting Favorite Product question. Normally when we're asked this question we pick technology products, but this time the interviewer wanted to throw us a curveball by asking about a non-technical product. Don't worry - it still follows the same approach: Choose a product and briefly explain what it is Who are the users? What are their pain points? How did competitors solve it in the past? **How does this product address these pain points differe"

    Exponent - "This is an interesting Favorite Product question. Normally when we're asked this question we pick technology products, but this time the interviewer wanted to throw us a curveball by asking about a non-technical product. Don't worry - it still follows the same approach: Choose a product and briefly explain what it is Who are the users? What are their pain points? How did competitors solve it in the past? **How does this product address these pain points differe"See full answer

    Product Manager
    Product Design
  • Meta logoAsked at Meta 
    4 answers
    +1

    "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"

    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

    Software Engineer
    Data Structures & Algorithms
    +2 more
  • Google logoAsked at Google 
    3 answers

    "As a YouTube PM, there are several factors that I would consider when evaluating the idea of developing a tool for content creators to generate ideas with scripts automatically added. First, I would assess the potential demand for such a tool among YouTube content creators. This would involve researching the needs and challenges of content creators, as well as gathering feedback from content creators on the value and usefulness of the tool. This would help me understand whether there is a strong"

    Anonymous Flamingo - "As a YouTube PM, there are several factors that I would consider when evaluating the idea of developing a tool for content creators to generate ideas with scripts automatically added. First, I would assess the potential demand for such a tool among YouTube content creators. This would involve researching the needs and challenges of content creators, as well as gathering feedback from content creators on the value and usefulness of the tool. This would help me understand whether there is a strong"See full answer

    Product Manager
    Behavioral
    +1 more
  • +1

    "Clarification: What does "share" imply? is it the action of sharing the app or website ? My assumption here we are not talking about stock market share :P, other factors come into play there. Diving-in: I would like to classify the questions into 2 buckets Internal Do we have data on which platform the shares increases and split up by Mobile and if mobile via app or via browser, split by apple/android, split via desktop, tablet . Essentially source of the shares. What this will t"

    Pm P. - "Clarification: What does "share" imply? is it the action of sharing the app or website ? My assumption here we are not talking about stock market share :P, other factors come into play there. Diving-in: I would like to classify the questions into 2 buckets Internal Do we have data on which platform the shares increases and split up by Mobile and if mobile via app or via browser, split by apple/android, split via desktop, tablet . Essentially source of the shares. What this will t"See full answer

    Analytical
    Product Strategy
  • OpenAI logoAsked at OpenAI 
    Add answer
    Growth Marketing Manager
    Data Analysis
    +1 more
  • LinkedIn logoAsked at LinkedIn 
    Add answer
    Product Manager
    Artificial Intelligence
  • Amazon logoAsked at Amazon 
    1 answer

    "input_logs = [ f"{senderid} {receiverid} {transaction_count}" "1 2 2", "3 2 42", "2 2 22", "1 1 12", "2 1 1", "2 5 4", "4 2 15" ] input_threshold = 20 exptected_output = [ list of user_ids that made more than 20 transactions sorted by number of transactions in descending order "3", # 42 transactions "2", # 27 transactions (22 + 1 + 4) #"4", # 15 transactions #"1" # 14 transactions (2 + 12 + 1) ] def gettopapi_users(logs, thres"

    Anonymous Unicorn - "input_logs = [ f"{senderid} {receiverid} {transaction_count}" "1 2 2", "3 2 42", "2 2 22", "1 1 12", "2 1 1", "2 5 4", "4 2 15" ] input_threshold = 20 exptected_output = [ list of user_ids that made more than 20 transactions sorted by number of transactions in descending order "3", # 42 transactions "2", # 27 transactions (22 + 1 + 4) #"4", # 15 transactions #"1" # 14 transactions (2 + 12 + 1) ] def gettopapi_users(logs, thres"See full answer

    Software Engineer
    Data Structures & Algorithms
    +1 more
Showing 1481-1500 of 4477