I applied through a recruiter. The process took 4 weeks. I interviewed at WeWork (New York, NY)
Interview
4 45 minutes interview, 1 is hiring manager, 1 with director without coding. Interview was typical, coding question was not hard.
I never got paid for the interview travel expense, have asked three times in the email loop with two hr, first email got reply after quite long time with a form, after that they stop reply my email. First time ever experience a company does not pay for candidate's travel expense by keep silence in the email.
Offer rejected because salary was much lower than my current job, not match with the expectation from recuruiter.
Interview questions [1]
Question 1
Can not share because of nda, question was typical codingbquestion and it was not hard
I applied through other source. The process took 4 weeks. I interviewed at WeWork (New York, NY) in Jul 2018
Interview
I had a phone call with HR, a 2nd call with a tech lead, then a 4-hour in-person at their 18th st offices. There I met with 4 different engineers and was asked a bunch of gotcha pop quiz fake problem questions. They promised to respond within 2 days but ghosted me, even ignoring a follow-up e-mail I sent.
Everyone is super young. The "senior" engineering leads are 28, 29. Lot of hipsters, just check out that July 2018 NYT article about forced vegetarianism. If you're 25 and wear skinny jeans and like to memorize tech interview quiz questions then this is the job for you, otherwise I recommend steering clear.
Interview questions [4]
Question 1
Imagine you're GrubHub. How would you model the datbase for their application? What are your tables? What would the DB queries look like for each step of the user process?
Compare two strings of letters. Write a function that returns true/false if 1) a's only moved to the left 2) b's only moved to the right 3) a's & b's never crossed while moving 4) a's never come after b's. E.g., 'cab' vs 'abc' would return true but 'cab' vs 'bac' would return false. What is the complexity of your algorithm?
There's a party. You want to know, "At what hour of the party where the most amount of people there?" You're given two arrays of numbers, arrival hours and exit hours, e.g. [5, 5, 7, 4, 10] and [6, 9, 8, 5, 11]. That means person 0 arrived at 5 and left at 6, and so on. What's the efficiency of your algorithm? (maximal overlapping interval sets)