Goldman sachs coderpad round
- Posted
- 17 Jan 2026
359 reads
Summary
I participated in a coderpad round at Goldman Sachs where I was presented with two coding challenges: 'Squares of a Sorted Array' with follow-ups on optimal space complexity, and an implementation task for an LFU Cache including its get, put, and remove methods.
How it went
Got 2 questions:
Was asked multiple follow ups, O(N) time & O(1) space solution was expected at the last.
- LFU Cache implementation.
was asked to implement get put & remove methods.
Questions asked (2)
- 01
Squares of a Sorted Array
Data Structures & Algorithms
Open the problemWas asked multiple follow ups, O(N) time & O(1) space solution was expected at the last.
- 02
LFU Cache Implementation
Data Structures & Algorithms
Implement LFU Cache. I was asked to implement get, put & remove methods.