Goldman sachs coderpad round

goldman sachs logo
goldman sachs
January 17, 20262 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.

Full Experience

Got 2 questions:

  1. https://leetcode.com/problems/squares-of-a-sorted-array/description/

Was asked multiple follow ups, O(N) time & O(1) space solution was expected at the last.

  1. LFU Cache implementation.

was asked to implement get put & remove methods.

Interview Questions (2)

Q1
Squares of a Sorted Array
Data Structures & Algorithms

Was asked multiple follow ups, O(N) time & O(1) space solution was expected at the last.

Q2
LFU Cache Implementation
Data Structures & Algorithms

Implement LFU Cache. I was asked to implement get, put & remove methods.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!