Filter interviews by
I applied via Naukri.com and was interviewed in Aug 2021. There were 5 interview rounds.
Top trending discussions
I applied via Referral and was interviewed in Mar 2022. There were 6 interview rounds.
Time and Speed, Percentages, Averages, Ratio and Proportion, Time and Work etc.
Platform was Mettle Assessment, Topics were Tree and Binary Search
Work from office vs Work from Home
TCP (Transmission Control Protocol) and UDP (User Datagram Protocol) are protocols used for data transmission over networks.
TCP is a connection-oriented protocol that guarantees reliable delivery of data.
UDP is a connectionless protocol that does not guarantee reliable delivery of data.
The main difference between TCP and UDP is that TCP provides reliable, ordered, and error-checked delivery of data, while UDP does not.
...
Print the bottom view of a Binary Search Tree.
Use a map to store the horizontal distance and the bottom-most node at that distance.
Traverse the tree in level order and update the map with each node's horizontal distance and level.
Print the nodes in the map in ascending order of their horizontal distance.
I believe working from the office allows for better collaboration and communication with colleagues.
Better collaboration and communication with colleagues
Opportunity for face-to-face interactions
Easier access to resources and equipment
Faster problem-solving through immediate discussions
Building stronger relationships with team members
I have the technical skills, experience, and passion for software engineering that make me a valuable asset to your team.
I have a strong background in computer science and software development
I have experience working on various software projects and have a proven track record of delivering high-quality code
I am a quick learner and can adapt to new technologies and programming languages
I am a team player and can effect...
Yes
When I received a promotion at work but also had to deal with the loss of a loved one
When I achieved a personal goal but also faced criticism from others
When I received positive feedback on a project but also experienced imposter syndrome
posted on 30 Apr 2023
I applied via Company Website and was interviewed before Apr 2022. There were 4 interview rounds.
1 hr test, simple aptitude questions
Simple coding questions
Reverse a given string
Iterate through the string from end to start and append each character to a new string
Use built-in functions like reverse() in Python or StringBuilder.reverse() in Java
Convert the string to an array, reverse the array, and convert it back to a string
posted on 20 Jun 2022
I applied via Naukri.com and was interviewed in May 2022. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed in Aug 2023. There were 3 interview rounds.
MCQ questions on Linux Networking and SQL
I applied via Job Fair and was interviewed before Aug 2023. There were 2 interview rounds.
Find two numbers in an array that add up to a specific target value.
Use a hashmap to store the difference between the target value and each element in the array.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the indices of the two numbers that add up to the target value.
No, a circular loop is not present in a linked list.
A linked list does not have a circular loop by default.
If a linked list has a circular loop, it is considered a circular linked list.
Circular linked lists can be detected using Floyd's Cycle Detection Algorithm.
To identify duplicates in a circular linked list, use a hash set to keep track of visited nodes.
Traverse the circular linked list while adding each node to a hash set.
If a node is already in the hash set, it is a duplicate.
Consider edge cases such as an empty list or a list with only one node.
posted on 11 Jan 2023
I applied via Recruitment Consulltant and was interviewed in Dec 2022. There were 4 interview rounds.
2 questions Based on arrays level of medium
Machine learning advantages and disadvantage
hello world hello OWRLD2
My name is John Doe.
Full name is John Doe
Common first and last name combination
No middle name provided
I am looking for a competitive salary based on my skills, experience, and the industry standard.
Research the average salary for Associate Software Engineers in the industry
Consider your level of experience and skills when determining your salary expectation
Be prepared to negotiate based on the company's offer and benefits package
Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
Use binary search to find the partition point in both arrays
Calculate the median based on the partition point and array sizes
Adjust the partition points based on the median value
Repeat until the partition points are at the median
Handle edge cases such as empty arrays and uneven array sizes
Anagram of strings in O(1) space complexity
Use a fixed size array of integers to store the frequency of characters in the first string
Iterate through the second string and decrement the frequency of each character in the array
If all the frequencies are zero, then the strings are anagrams
Return true or false accordingly
Level order traversal of a tree using Queue
Create a queue and add the root node to it
While the queue is not empty, remove the front node and print its value
Add the left and right child nodes of the removed node to the queue
Repeat until the queue is empty
Reverse level order traversal of a tree using Queue
Create a queue and push the root node into it
While the queue is not empty, pop the front node and push its children into the queue
Add the popped node to a stack
Once the queue is empty, pop elements from the stack and print them
BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.
BFS uses a queue while DFS uses a stack or recursion.
BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.
BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.
BFS can be used to find connected components while DFS
Find product of each element of an array except that element in O(N) time complexity without using / operation
Use prefix and suffix products
Multiply prefix and suffix products for each element to get the final product
Handle edge cases where array has 0 or 1 element separately
Recursively delete a linked list
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null, return
Recursively call the function with the next node as input
Delete the current node
Recursively delete a linked list from the end.
Start from the head and recursively traverse to the end of the list.
Delete the last node and set the second last node's next pointer to null.
Repeat until the entire list is deleted.
Use a recursive function to implement the deletion process.
Recursively delete a tree by deleting all its child nodes and then the parent node.
Start from the leaf nodes and delete them first.
Then move up to the parent nodes and delete them.
Repeat until the root node is deleted.
Use post-order traversal to ensure child nodes are deleted before parent nodes.
Recursively delete elements from the end of an array.
Create a recursive function that removes the last element of the array.
Call the function recursively until the desired number of elements are removed.
Handle edge cases such as empty arrays and removing more elements than the array contains.
Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.
Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.
Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).
Floyd Warshall can handle negative edge weights while Djikstra cannot.
Floyd Warshall can detect negative cycles while Dj
There is no known algorithm to find shortest path in 2-D space in O(log N) time.
The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).
Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).
If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).
Design a system for putting newspapers using classes and functions
Create a Newspaper class with attributes like title, date, and content
Create a Publisher class with methods to publish and distribute newspapers
Create a Subscriber class with methods to subscribe and receive newspapers
Use inheritance to create different types of newspapers like daily, weekly, etc.
Implement a database to store newspaper information and ha
I believe practical experience is more valuable than higher studies.
I have gained valuable experience through internships and projects.
I prefer hands-on learning and problem-solving over theoretical knowledge.
I am constantly learning and improving my skills through online courses and workshops.
I am a software engineer with experience in developing web applications and mobile apps.
Proficient in programming languages such as Java, Python, and JavaScript
Experience in developing RESTful APIs and integrating third-party APIs
Familiarity with front-end frameworks such as React and Angular
Strong understanding of database management systems such as MySQL and MongoDB
Passionate about learning new technologies and keepi
Software industry offers endless opportunities for innovation and growth.
Software industry is constantly evolving and offers opportunities to work on cutting-edge technologies.
It provides a platform to solve complex problems and create innovative solutions.
The demand for software engineers is high and the industry offers competitive salaries.
Core industries may have limited scope for growth and innovation compared to s...
Program to print a given string in reverse
Create a character array of the given string
Loop through the array from end to start and print each character
Mux is a device that selects one of several input signals and forwards the selected input into a single output line.
Mux stands for Multiplexer.
It is used in digital circuits to select one of several input signals and forward the selected input into a single output line.
It is used in communication systems to combine multiple signals into a single channel for transmission.
It is used in video and audio systems to switch b...
DeMux is short for Demultiplexer. It is a digital circuit that takes one input and directs it to multiple outputs.
DeMux is used in digital communication systems to separate signals that have been combined for transmission.
It is also used in computer memory systems to select a specific memory location.
DeMux is used in video and audio systems to separate different channels of information.
It is used in automation systems ...
Decoder converts encoded data into a readable format while Demux separates a single input into multiple outputs.
Decoder is used to decode encoded data such as binary data into a readable format.
Demux is used to separate a single input into multiple outputs based on the control signals.
Decoder is a combinational circuit while Demux is a sequential circuit.
Decoder is used in applications such as remote controls, computer...
Amadeus Labs is a leading technology company in the travel industry.
Amadeus Labs provides opportunities to work on cutting-edge technologies.
The company has a strong focus on innovation and research.
Amadeus Labs has a global presence and offers a diverse and inclusive work environment.
Working at Amadeus Labs provides the opportunity to make a real impact on the travel industry.
The company values work-life balance and o
Yes, I am comfortable working for Testing.
I have experience in testing and understand its importance in software development.
I am willing to learn new testing techniques and tools.
I am comfortable working with testing teams and collaborating with them to ensure quality software.
I understand the importance of testing in ensuring customer satisfaction and reducing costs.
Examples: I have experience in manual and automated...
I have the necessary skills and experience to excel in the developer role.
I have a degree in computer science and have completed multiple coding projects.
I am proficient in programming languages such as Java, Python, and C++.
I have experience working with databases and web development frameworks.
I am a quick learner and enjoy solving complex problems.
I am a team player and have collaborated with other developers on var
based on 17 reviews
Rating in categories
Software Engineer
150
salaries
| ₹7.6 L/yr - ₹23.6 L/yr |
Senior Software Engineer
99
salaries
| ₹16.4 L/yr - ₹33 L/yr |
Associate Software Engineer
50
salaries
| ₹4.8 L/yr - ₹14 L/yr |
Scrum Master
29
salaries
| ₹16.8 L/yr - ₹39 L/yr |
Senior Quality Assurance Engineer
28
salaries
| ₹10.5 L/yr - ₹24.5 L/yr |
Thomson Reuters
Oracle Cerner
Chetu
R Systems International