Goldman Sachs | SWE | NYC | Sep 2019 [No Offer]
Anonymous User
2520

Phone Interview:

  • Could be find first non repeating character in list. I don't remember but I used a dictionary and it was fairly easy.
  • https://leetcode.com/problems/minimum-size-subarray-sum/
  • Implement methods for library object to return documents contained in search query. Something like that, don't remember exactly.

Onsite:

Round 1:

Round 2:

Didn't do too well.

Comments (2)