Google | SWE L4 | NYC | September 2020 [Reject]
Anonymous User
1217

Status: 8YOE
Position: SWE at no-name company
Location: NYC
Date: September 2020

Phone Screen (45mins)
https://leetcode.com/problems/contains-duplicate-ii/

(Virtual) Onsite (5x45mins)

  1. (Coding) - Version of blackjack: Given a d10 and a starting value what is the probility of busting (getting over 21) where 16 or lower must roll and 17-21 must stay
  2. (Coding) - https://leetcode.com/problems/minimum-window-subsequence/
  3. (Coding) - Q1: Determine if two numbers are anagrams of each other. Q2: Given a list of numbers find the smallest that doesn't have an anagram pair in the list
  4. (Behavioral aka "Googliness")
  5. (Coding) - Given a 2D grid with a starting position, ending position, and obstacles find the maximum minimum distance you can maintain from the obstacles where there is a path from source to destination
Comments (5)