Goldman Sachs
10+ IMS Groups Interview Questions and Answers
On an Island, there is an airport that has an unlimited number of identical air-planes. Each air-plane has a fuel capacity to allow it to fly exactly 1/2 way around the world, along a great circle. The pl...read more
You are given an array consisting of N non-negative integers, and an integer K denoting the length of a subarray, your task is to determine the maximum elements for each subarr...read more
Design and implement a data structure for Least Recently Used (LRU) cache to support the following operations:
1. get(key) - Return the value of the key if the key exists in the cache, otherwise return...read moreYou are given an N-ary tree where every node has at most ‘N’ child nodes. You need to first serialize it and then deserialize the serialized tree.
Serialization is the pro...read more
Design a data structure that stores a mapping of a key to a given value and supports the following operations in constant time.
1. INSERT(key, value): Inserts an integer value to the data...read moreYou are given a path to a file/directory in Unix-style of length N, In a Unix-style file system, a dot(.) refers to the current directory. A double dot(..) refers to the previous directory...read more
Q7. what is virtual memory? Will we need virtual memory even if we have infinite amount of RAM?
Virtual memory is a memory management technique that allows a computer to use more memory than it physically has.
Virtual memory uses a combination of RAM and hard disk space to store data.
It allows programs to use more memory than is physically available.
If a program tries to access memory that is not currently in RAM, it will be swapped in from the hard disk.
Even if we had infinite RAM, virtual memory would still be necessary for certain tasks such as memory isolation and pr...read more
Q8. Given an array, Find out maximum length of subarray where max of subarray <= 2*min of subarray
Find maximum length of subarray where max <= 2*min.
Iterate through array and keep track of max and min values.
Update max length when condition is met.
Time complexity: O(n)
What is Virtual Memory?
Q10. Create BST from incoming stream of nodes
Create a Binary Search Tree (BST) from an incoming stream of nodes.
Start with an empty BST
For each incoming node, compare it with the root node and insert it accordingly
Repeat the process until all nodes are inserted
Q11. Implement LRU cache.
Implement LRU cache
LRU stands for Least Recently Used
It is a cache eviction policy that removes the least recently used item
It can be implemented using a doubly linked list and a hash map
Newly accessed items are moved to the front of the list
When the cache is full, the item at the end of the list is removed
Q12. Trapping rainwater problem
Trapping rainwater problem
The problem involves calculating the amount of rainwater that can be trapped between bars in an elevation map
Use two pointers approach to calculate the water trapped at each bar
Keep track of the maximum height on the left and right of each bar to calculate the trapped water
Q13. Serach in sorted n*n matrix
Search for a target value in a sorted n*n matrix.
Start from the top-right corner or bottom-left corner of the matrix.
Compare the target value with the current element and move left or down accordingly.
Repeat until the target value is found or the boundaries of the matrix are crossed.
More about working at Goldman Sachs
Interview Process at IMS Groups
Top Software Engineer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
