Filter interviews by
Clear (1)
Very DSA heavy, 3 technical rounds.
Top trending discussions
It was a machine coding round which revolves around designing a simple application primarily on OOPS
The best time to sell stocks is when the market is high and the stock has reached its peak value.
Sell when the stock has reached its peak value to maximize profits
Consider selling if the company's fundamentals have changed negatively
Sell if you need to rebalance your portfolio or have reached your financial goals
The best time to sell stocks is when the market is at a peak and the stock price is high.
Monitor market trends and stock performance regularly.
Consider selling when the stock reaches a new high or when you have achieved your profit goals.
Sell if there are negative news or events that could impact the stock price negatively.
I applied via Instahyre and was interviewed in Nov 2024. There was 1 interview round.
Machine Coding round on codesignal
I applied via Company Website and was interviewed in Jan 2024. There was 1 interview round.
Given two soted arrays merge them from a single sorted array with all items in non-decreassing order
Moderate to difficult
I applied via LinkedIn and was interviewed in Apr 2021. There were 4 interview rounds.
Minimum cost to reach last cell of 2D matrix with only downward or right moves.
Use dynamic programming approach to solve the problem.
Calculate minimum cost for each cell by considering minimum cost of its adjacent cells.
Final answer will be the minimum cost to reach the last cell.
Design a stack that supports getMin functionality to return the minimum element in the stack.
Create two stacks, one for storing the actual elements and another for storing the minimum elements.
Push elements onto both stacks simultaneously.
When popping an element, pop from both stacks.
To get the minimum element, peek at the top of the minimum stack.
TreeSet is a data structure that stores unique elements in sorted order.
TreeSet is implemented using a Red-Black tree
It provides O(log n) time complexity for basic operations like add, remove, and contains
It also provides methods like first(), last(), headSet(), tailSet(), and subSet()
TreeSet can be used to implement priority queues and sorting algorithms
Design an ArrayList with getMax functionality.
Create a custom ArrayList class that extends the existing ArrayList class.
Add a getMax() method that returns the maximum value in the list.
Override the add() method to keep track of the maximum value in the list.
Update the maximum value whenever an element is added or removed from the list.
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
-----.geeksforgeeks.org/replace-every-element-with-the-greatest-on-right-side/amp/
-----/
I applied via LinkedIn and was interviewed before May 2023. There were 3 interview rounds.
It was leetcode questions for 60 min for 2 questions.
based on 1 interview
Interview experience
Operations Analyst
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Operations Analyst
7
salaries
| ₹0 L/yr - ₹0 L/yr |
ZestMoney
Paytm
PhonePe
PolicyBazaar