Problems
Contest
Discuss
Interview
Online Interview
Assessment
Store
Redeem
Premium
For you
For you
Create
Most Votes
All Time
Newest
No search result
Create
Goldman Sachs | SWE | NYC | Sep 2019 [No Offer]
Anonymous User
2520
Goldman Sachs
New York City
Interview
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:
https://leetcode.com/problems/design-hashmap/
You have a 100 story building and 2 eggs, find the lowest amount of tries to find out at what floor does dropping the egg, break it.
You have 3 ants in a triangle, find the probability that the ants don't collide when they move.
https://leetcode.com/problems/verifying-an-alien-dictionary/
Round 2:
https://leetcode.com/problems/lru-cache/
https://leetcode.com/problems/decode-ways/
Didn't do too well.
4
2
Comments (2)
Sort by:
Best
Comment
1
Explore
Download App
Support
Terms
Privacy Policy
More
Copyright © 2026 LeetCode
United States