Codepad question:
1. Implement a Deque with some follow up on optimization part (solved with Doubly Linked List)
2. Given name and grades of students, print the name along with the maximum avg score
Hint: Similar to leetcode high five problem, but you need to print the highest avg score.
Can be solved using hashmap and taking running sum along with the counts
3. (Don't exactly remember) Given a named tuple, with intervals and price, print the lowest price between the intervals, based on the start and end time
I used heapq for this implementation

Final rounds:
(Leetcode)
Coin Change with some modifications
Subarrays with KDifferent integers Variation)
Decode ways variation

Question

Codepad question:
1. Implement a Deque with some follow up on optimization part (solved with Doubly Linked List)
2. Given name and grades of students, print the name along with the maximum avg  score
Hint: Similar to leetcode high five problem, but you need to print the highest avg score.
Can be solved using hashmap and taking running sum along with the counts
3.  (Don't exactly remember) Given a named tuple, with intervals and price, print the lowest price between the intervals, based on the start and end time
I used heapq for this implementation

Final rounds:
(Leetcode)
Coin Change with some modifications
Subarrays with KDifferent integers Variation)
Decode ways variation

Goldman Sachs

Goldman Sachs interview question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches