i
Trellix
Filter interviews by
I applied via Campus Placement and was interviewed before May 2023. There were 4 interview rounds.
Included DBMS, OS, SQL, CN
Top trending discussions
I applied via Approached by Company and was interviewed before Jun 2021. There were 2 interview rounds.
Frameworks provide structure and pre-built components for software development, but can also limit flexibility and require learning curve.
Advantage: Provides structure and pre-built components for faster development
Advantage: Can improve code quality and maintainability
Disadvantage: Can limit flexibility and customization
Disadvantage: Requires learning curve and potential dependency issues
Example: ReactJS provides a fr...
Oops stands for Object-Oriented Programming. It is a programming paradigm that uses objects to represent real-world entities.
Advantages: code reusability, modularity, encapsulation, inheritance, polymorphism
Disadvantages: complexity, steep learning curve, performance overhead
Example: creating a class 'Car' with properties like 'make', 'model', and 'year', and methods like 'start_engine' and 'stop_engine'
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...
AVL tree balance checking ensures that the tree maintains its height-balanced property after insertions and deletions.
An AVL tree is a self-balancing binary search tree.
The balance factor (BF) of a node is defined as the height of the left subtree minus the height of the right subtree.
A node is considered balanced if its BF is -1, 0, or +1.
To check balance, recursively calculate the height of left and right subtrees fo...
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
Check if parentheses in a string are balanced using a stack-based approach.
Use a stack to track opening parentheses: '(', '{', '['.
For each closing parenthesis: check if it matches the top of the stack.
If the stack is empty at the end, parentheses are balanced.
Example: '((){})' is balanced, but '((())' is not.
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 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.
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).
I applied via Naukri.com and was interviewed before Jul 2020. There were 4 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2019. There were 4 interview rounds.
My typical day as a Software Engineer involves coding, collaborating, and continuous learning to deliver high-quality software solutions.
Morning stand-up meeting to discuss progress and blockers with the team.
Coding sessions where I implement features or fix bugs, often using languages like Python or Java.
Collaborating with designers and product managers to refine requirements and ensure alignment.
Participating in code...
Recent issues faced in the organization include project delays, communication gaps, and technical debt impacting productivity.
Project Delays: We encountered delays in project timelines due to unforeseen technical challenges, such as integrating legacy systems with new technologies.
Communication Gaps: Miscommunication between teams led to misunderstandings about project requirements, resulting in rework and wasted resou...
I applied via Recruitment Consultant and was interviewed before Jun 2020. There were 4 interview rounds.
I applied via Company Website and was interviewed before Jun 2020. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Sep 2021. There were 4 interview rounds.
Math and verbal round .
General topics to speak
Implement a function to find duplicates in an array of strings using Hashmap.
Create a Hashmap to store the frequency of each string in the array
Iterate through the array and check if the frequency of any string is greater than 1
If yes, add it to the list of duplicates
Return the list of duplicates
I applied via Naukri.com and was interviewed in Dec 2020. There were 6 interview rounds.
based on 1 interview experience
Difficulty level
Duration
Software Development Engineer
84
salaries
| ₹14 L/yr - ₹25.5 L/yr |
Software Engineer
60
salaries
| ₹13.2 L/yr - ₹25 L/yr |
Senior Software Engineer
55
salaries
| ₹24.6 L/yr - ₹43.6 L/yr |
Technical Support Engineer
27
salaries
| ₹7.9 L/yr - ₹19.9 L/yr |
Customer Success Engineer
21
salaries
| ₹12.5 L/yr - ₹23.3 L/yr |
Thomson Reuters
Oracle Cerner
Chetu
R Systems International