Filter interviews by
Clear (1)
Top trending discussions
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 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
I applied via LinkedIn and was interviewed in Mar 2024. There were 2 interview rounds.
Aptitude Test based on general
Coding Test Based on backend technologies
I applied via Naukri.com and was interviewed before Nov 2020. There were 5 interview rounds.
I applied via Company Website and was interviewed in May 2021. There was 1 interview round.
I was interviewed in Dec 2020.
Round duration - 25 Minutes
Round difficulty - Medium
Very friendly interviewer. Although waiting time was very high
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the question.
Return the sorted list of pairs.
Tip 1 : be confident about your CV points
Tip 2 : practice consulting cases and how to answer situational questions
Tip 1 : be crisp about achievement
Tip 2 : add data points to support your achievements
based on 1 interview
Interview experience
Executive
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager Talent Acquisition
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Airbnb
Uber
Ola Cabs
Swiggy