Filter interviews by
Top trending discussions
Machine coding round
Developed a web application for managing inventory and sales for a retail store
Used React.js for front-end development
Implemented Node.js for back-end functionality
Utilized MongoDB for database management
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
I applied via Company Website and was interviewed in Sep 2023. There were 2 interview rounds.
Implement an iterator to flatten 2D vector
Use Dijkstra's algorithm to find the shortest path to get all keys
Implement Dijkstra's algorithm to find the shortest path in a graph
Consider the keys as nodes in the graph and the paths between keys as edges
Keep track of the keys collected and update the shortest path accordingly
posted on 9 May 2024
45 MCQ Which includes below topics
Basic core Java
Database
Spring
Hibernate
Angular
One program based on core Java logic
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
Custom problem was given and asked to solve and discuss solution with the interviewer
Current project discussion with panel
posted on 12 Mar 2024
I applied via Company Website and was interviewed before Mar 2023. There were 4 interview rounds.
Solve sudoku, row and columns should have 1-9 numbers and the numbers shouldnt repeat
Design a parking lot system with features like parking, retrieving, and tracking available spots.
Create a ParkingLot class with attributes like total number of spots, available spots, and a list of parked vehicles.
Implement methods for parking a vehicle, retrieving a vehicle, and tracking available spots.
Use data structures like arrays or lists to manage parked vehicles and available spots.
Consider implementing feature...
posted on 19 Dec 2023
I applied via LinkedIn and was interviewed in Nov 2023. There were 2 interview rounds.
Create subarrays with sum = 0 from given array of integers.
Iterate through the array and keep track of the running sum.
Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.
If yes, then the subarray between those two indices has a sum of 0.
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
Traverse the tree in a level order manner and keep track of the first node at each level.
Use a queue to store nodes at each level and update the left view nodes accordingly.
Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
I was interviewed in Dec 2020.
Round duration - 75 minutes
Round difficulty - Easy
This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.
1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes
This Round was Conducted on Hackerrank (Webcam Enabled).
To find and correct bugs in code, analyze problem statement, review code, use debugging tools, run test cases, and make necessary changes.
Understand the problem statement and expected output
Review the code for syntax errors, logical errors, and potential bugs
Use debugging tools like breakpoints, print statements, and IDE features
Run test cases to identify the bugs and verify the corrections
Make necessary changes to the
Given a connected, undirected, and acyclic graph where some nodes are marked and a positive integer 'K'. Your task is to return the count of nodes such that...
Count the number of nodes within K-distance from marked nodes in a connected, undirected, acyclic graph.
Create a graph using the given vertices and edges.
Perform a BFS traversal starting from each marked node to find nodes within K-distance.
Count the nodes within K-distance from all marked nodes and return the total count.
Round duration - 90 minutes
Round difficulty - Medium
I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM
Given an array containing only 0s and 1s, determine the length of the longest contiguous subarray that has an equal number of 0s and 1s.
...Find the length of the longest subarray with equal number of 0s and 1s in a given array of 0s and 1s.
Iterate through the array and maintain a running count of the difference between the number of 0s and 1s encountered so far.
Store the count values in a hashmap with the index as the key.
If the same count is encountered again, calculate the length of the subarray between the two occurrences.
Return the maximum length foun
File system is stored on disk using data blocks and metadata, organized in a hierarchical structure.
File system is stored on disk using data blocks and metadata
Data blocks contain actual file data, while metadata stores information about files and directories
File system is organized in a hierarchical structure with directories containing files and subdirectories
File system uses a file allocation table (FAT) or an index
RISC focuses on simplicity and efficiency, while CISC emphasizes complex instructions and flexibility.
RISC uses a small set of simple instructions, while CISC uses a large set of complex instructions.
RISC architectures have a uniform instruction format, while CISC architectures have variable-length instructions.
RISC architectures rely on optimizing compilers for performance, while CISC architectures have hardware optim...
Round duration - 45 minutes
Round difficulty - Easy
The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.
Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : For a company like Adobe, practicing medium difficulty level coding questions would be the way to go.
Tip 5 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
based on 1 interview
Interview experience
Senior Travel Consultant
226
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
219
salaries
| ₹0 L/yr - ₹0 L/yr |
Travel Consultant
115
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
111
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
91
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Cleartrip
Goibibo
Oyo Rooms