Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
Some basic level of dsa questions like sorting and reverse a linked list and some javascript question
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
posted on 26 Jul 2024
I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.
Generale questions about my previous experience
I applied via Naukri.com and was interviewed before Jul 2023. There was 1 interview round.
Second number from array
I applied via LinkedIn and was interviewed before Mar 2023. There were 2 interview rounds.
LRU Cache and Basic String question.
Custom problem was given and asked to solve and discuss solution with the interviewer
Current project discussion with panel
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.
I was interviewed in Jul 2022.
Round duration - 180 Minutes
Round difficulty - Medium
coding questions on DSA and MCQs on java
timing : late night
no camera
Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...
Calculate the probability that a knight remains on an N x N chessboard after making K moves.
Use dynamic programming to calculate the probability of the knight staying on the board after each move.
Consider all possible moves the knight can make from its current position.
Keep track of the probabilities at each position on the board after each move.
Normalize the probabilities at the end to get the final result.
Example: Fo...
Round duration - 50 Minutes
Round difficulty - Medium
It was a DSA round.
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
The fi...
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
Perform Inorder Traversal of the Binary Tree to get the nodes in order.
Create a Doubly Linked List by connecting the nodes in the order obtained from Inorder Traversal.
Return the head of the Doubly Linked List as the output.
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store duplicates.
Round duration - 50 Minutes
Round difficulty - Medium
DSA Questions were asked.
Given a string str
and a character 'X', develop a function to eliminate all instances of 'X' from str
and return the resulting string.
The first lin...
Develop a function to remove all instances of a given character from a string.
Iterate through the string character by character and skip the character to be removed.
Build a new string by appending characters that are not equal to the given character.
Return the final modified string.
Handle edge cases like empty string or character not found in the string.
You are given a string of lowercase characters. The objective is to rearrange (reorder) the string so that no two adjacent characters are identical.
Return the rear...
The objective is to rearrange a string so that no two adjacent characters are identical. Return the rearranged string or 'NO SOLUTION'.
Iterate through the string and count the frequency of each character.
Create two lists, one for characters with odd frequency and one for characters with even frequency.
If the count of characters with odd frequency is greater than 1, return 'NO SOLUTION'.
Alternate between characters with...
Round duration - 50 Minutes
Round difficulty - Easy
It was a behavioural round.
Tip 1 : strong grasp on DSA and problem solving
Tip 2 : follow leetcode (try to do as many medium questions as possible)
Tip 3 : should focus on development also and internships
Tip 1 : good projects and coding profiles like leetcode
Tip 2 : some good internships also help
It was a medium-level DSA round
This was also a DSA round
This again a DSA round
All the apti tpics were asked,totally 98 questions30 apti
other related to software
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Executive Accountant
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Travel Consultant
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Travel Consultant
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Accounts Executive
7
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Yatra
Cleartrip
Goibibo