Filter interviews by
Top trending discussions
I applied via Approached by Company and was interviewed in Nov 2024. There was 1 interview round.
Design a stack that supports push, pop, top, and retrieving minimum element in constant time.
Use two stacks - one to store the actual elements and another to store the minimum values encountered so far
When pushing an element, check if it is smaller than the current minimum and if so, push it to the minimum stack
When popping an element, check if it is the current minimum and if so, pop from the minimum stack as well
Top ...
Find the maximum circular subarray sum in an integer array.
Calculate the non-circular maximum subarray sum using Kadane's algorithm.
Calculate the circular maximum subarray sum by subtracting the minimum subarray sum from the total sum.
Compare the non-circular and circular maximum subarray sums to get the overall maximum sum.
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
Find out no of occurrence of character and spaces in given string
I applied via LinkedIn and was interviewed before Jun 2023. There were 2 interview rounds.
Spring applications can be made using Spring Boot, which simplifies the setup and configuration process.
Use Spring Initializr to create a new Spring Boot project
Add dependencies in the pom.xml file for required Spring modules
Create Java classes with annotations like @Controller, @Service, @Repository, etc.
Define application properties in application.properties or application.yml file
Run the application using the main m
posted on 31 Oct 2024
1)graph question 2)dp question
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
posted on 9 Feb 2024
I applied via Recruitment Consulltant and was interviewed in Jan 2024. There was 1 interview round.
The rotten orange problem involves determining the minimum number of minutes it takes for all oranges to become rotten.
Use a breadth-first search (BFS) algorithm to solve the problem
Create a queue to store the coordinates of rotten oranges
Iterate through the grid and enqueue all rotten oranges
While the queue is not empty, dequeue an orange and check its neighboring oranges
If a neighboring orange is fresh, make it rotte...
Interview experience
Senior Travel Consultant
233
salaries
| ₹2.7 L/yr - ₹8.9 L/yr |
Senior Executive
215
salaries
| ₹2.4 L/yr - ₹7 L/yr |
Travel Consultant
117
salaries
| ₹2 L/yr - ₹6 L/yr |
Assistant Manager
112
salaries
| ₹4 L/yr - ₹11.1 L/yr |
Team Lead
91
salaries
| ₹3.8 L/yr - ₹10 L/yr |
MakeMyTrip
Cleartrip
Goibibo
Oyo Rooms