Rate your
company
🤫 100% anonymous
How was your last interview experience?
Top trending discussions
I applied via Campus Placement
The king can move only towards the corner and not diagonally. How many ways can a king go from one end of the chessboard to the diagonally opposite square?
The king can only move towards the corner, so there are limited options for each move
The total number of moves required to reach the opposite corner is 14
Using combinatorics, the total number of ways the king can reach the opposite corner is 3432
I was interviewed in Sep 2016.
I want to join GS because of their reputation for excellence and the opportunity to work on challenging projects.
GS is known for its prestigious reputation in the financial industry
I am attracted to the opportunity to work on complex and challenging projects
I admire GS's commitment to innovation and cutting-edge technology
I believe GS will provide me with valuable learning and growth opportunities
I have knowledge of various DS, but I personally like Decision Trees.
I have worked with Linear Regression, Logistic Regression, Random Forest, and Decision Trees.
Decision Trees are easy to interpret and visualize.
They can handle both categorical and numerical data.
They can be used for both classification and regression problems.
An example of using Decision Trees is in predicting customer churn for a telecom company.
Hashing is a technique to convert data of arbitrary size to a fixed size. Hash table is a data structure that uses hashing to store data.
Hashing is used to index and retrieve items in a database because it is faster than other methods.
Hash table is a data structure that uses a hash function to map keys to array indices.
Hashing key is the input to the hash function that produces a hash value.
Hashing is used in password ...
Stacks and queues are data structures used to store and manipulate collections of elements.
Stacks follow the Last-In-First-Out (LIFO) principle, where the last element added is the first one to be removed.
Queues follow the First-In-First-Out (FIFO) principle, where the first element added is the first one to be removed.
Examples of stacks include the call stack in programming and the undo/redo feature in text editors.
Ex...
Yes, queues can be implemented using stacks.
To implement a queue using stacks, we can use two stacks.
One stack is used for enqueue operation and the other for dequeue operation.
When an element is enqueued, it is pushed onto the enqueue stack.
When an element is dequeued, if the dequeue stack is empty, all elements from the enqueue stack are popped and pushed onto the dequeue stack in reverse order.
This ensures that the ...
Yes, circular queues can be implemented using two stacks.
Use two stacks, one for enqueue and one for dequeue operations.
When enqueueing, push the element onto the enqueue stack.
When dequeuing, if the dequeue stack is empty, pop all elements from the enqueue stack and push onto the dequeue stack.
The front of the queue is the top element of the dequeue stack.
When dequeueing, pop the top element from the dequeue stack.
If ...
Yes, I know several sorting algorithms.
One of the most popular is QuickSort, which uses a pivot element to divide the array into smaller sub-arrays and recursively sorts them.
Another common algorithm is MergeSort, which divides the array into smaller sub-arrays and then merges them back together in sorted order.
InsertionSort is a simple algorithm that iterates through the array and inserts each element into its correct...
I am a highly motivated individual with a passion for problem-solving and a strong work ethic.
I have a degree in computer science and have worked as a software engineer for 3 years.
I enjoy learning new technologies and am always looking for ways to improve my skills.
In my free time, I like to read books on personal development and practice yoga.
I am a team player and enjoy collaborating with others to achieve common go
I am proficient in Python and Java.
I have experience in developing web applications using Django framework in Python.
I have also worked on Java projects using Spring framework.
I am familiar with object-oriented programming concepts and data structures.
I have worked on projects involving database management using SQL.
I am constantly learning and improving my skills in these languages.
I have knowledge of various DS, but I personally like Decision Trees.
I have worked with Linear Regression, Logistic Regression, Random Forest, and Decision Trees.
Decision Trees are easy to interpret and visualize.
They can handle both categorical and numerical data.
They can be used for both classification and regression problems.
An example of using Decision Trees is in predicting customer churn for a telecom company.
Hashing is a technique to convert data of arbitrary size to a fixed size. Hash table is a data structure that uses hashing to store data.
Hashing is used to index and retrieve items in a database because it is faster than other methods.
Hash table is a data structure that uses a hash function to map keys to array indices.
Hashing key is the input to the hash function that produces a hash value.
Hashing is used in password ...
My day was good. Previous interviews were challenging but I learned a lot.
Had a productive day at work
Interviewed with two companies last week
One interview was technical and the other was behavioral
Received positive feedback from both companies
Stacks and queues are data structures used to store and manipulate collections of elements.
Stacks follow the Last-In-First-Out (LIFO) principle, where the last element added is the first one to be removed.
Queues follow the First-In-First-Out (FIFO) principle, where the first element added is the first one to be removed.
Examples of stacks include the call stack in programming and the undo/redo feature in text editors.
Ex...
Yes, we can implement queues using two stacks.
We can use two stacks, one for enqueue operation and another for dequeue operation.
To enqueue an element, push it onto the first stack.
To dequeue an element, pop all elements from the first stack and push them onto the second stack, then pop the top element from the second stack.
This ensures that the first element that was enqueued is the first one to be dequeued.
Time compl...
Yes, we can implement circular queues using two stacks.
We can use two stacks to implement a circular queue.
One stack will be used for enqueue operation and the other for dequeue operation.
When the enqueue stack is full, we can transfer all elements to the dequeue stack and vice versa.
This way, we can maintain the circular nature of the queue.
Example: https://www.geeksforgeeks.org/queue-using-stacks/
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
It divides the input into a sorted and an unsorted region.
It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.
It has a worst-case time complexity of O(n log n).
Yes, I know other sorting algorithms.
Examples: Merge Sort, Quick Sort, Heap Sort, Bubble Sort, Insertion Sort, Selection Sort
Each algorithm has its own advantages and disadvantages.
The choice of algorithm depends on the size of the data set and the desired time complexity.
Find max path from bottom left to top right in a matrix using only up and right steps.
Start from bottom left corner and move towards top right corner.
At each step, choose the maximum value between the cell above and the cell to the right.
Keep track of the sum of values in the chosen path.
The final sum is the maximum possible sum of values in a path from bottom left to top right.
The most likely number to occur as the final sum is 100.
The sum of the outcomes of the dice rolls will keep increasing until it reaches or exceeds 100.
Since the dice have equal probabilities for each outcome, the sum will have a higher chance of reaching 100.
The probability of rolling a sum greater than 100 decreases as the sum gets larger.
Finding probability of point (1,0) lying in longest cut of three random points on circle of radius 1 centered at (0,0)
The longest cut will be the one that spans the smallest angle between two of the three points
The probability can be found by calculating the area of the region where the longest cut includes point (1,0)
This can be done by finding the angle between (1,0) and the two other points and using trigonometry to...
I was interviewed in Aug 2016.
Find the magic number in a sorted array where value and index are same.
Iterate through the array and check if the value and index are same
If found, return the value
If not found, return -1
Searching an element in a sorted 2D matrix
Start from the top-right corner or bottom-left corner
Compare the target element with the current element
Move left or down if the target is smaller or move right or up if the target is larger
Design a newspaper subscription system
Create a user registration system
Allow users to select subscription plan and payment method
Provide options for delivery frequency and start/end dates
Send reminders for subscription renewal
Allow users to modify or cancel subscription
Track subscription history and payment records
Number of ways to jump n stairs if a person can climb 1 or 2 stairs.
Use dynamic programming to solve the problem.
The number of ways to jump n stairs is equal to the sum of ways to jump n-1 stairs and ways to jump n-2 stairs.
Base cases: if n=0, return 1 and if n=1, return 1.
An LRU cache can be made using a doubly linked list and a hash map.
Create a doubly linked list to store the cache items.
Create a hash map to store the key-value pairs.
When a new item is added, check if the cache is full. If it is, remove the least recently used item from the linked list and hash map.
When an item is accessed, move it to the front of the linked list.
When an item is removed, remove it from both the linked
Probability of winning a dice game where the one with lesser number wins.
The probability of winning depends on the number of sides on the dice.
If the dice has an odd number of sides, the probability of winning is higher for the second player.
If the dice has an even number of sides, the probability of winning is equal for both players.
Compute working days using given functions f, g, and h.
To compute the 3rd working day, apply function g three times to function f.
To compute the 2nd working day of the previous month, apply function h to function f, then apply function g twice.
To compute the 4th working day of the next month, apply function g four times to function f.
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
based on 9 reviews
Rating in categories
Assistant Vice President
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Vice President
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Vice President
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
5
salaries
| ₹0 L/yr - ₹0 L/yr |
JPMorgan Chase & Co.
Goldman Sachs
Morgan Stanley
UBS