Filter interviews by
I applied via Approached by Company and was interviewed in Nov 2023. There was 1 interview round.
Building ETL pipelines using Airflow for data engineering projects.
Define data sources and destinations
Design data transformation processes
Implement ETL workflows in Airflow
Schedule and monitor pipeline executions
Handle error handling and data quality checks
Top trending discussions
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
I applied via Company Website and was interviewed in Feb 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Jul 2021. There was 1 interview round.
Hashmap is a data structure that stores key-value pairs and provides constant time complexity for insertion, deletion, and retrieval.
Hashmap uses hashing function to map keys to indices in an array
Collisions can occur when two keys map to the same index, which can be resolved using separate chaining or open addressing
Java implementation: HashMap
Spring is a framework while Spring Boot is a tool that simplifies Spring application development.
Spring Boot provides auto-configuration and embedded servers.
Spring requires more configuration and setup.
Spring Boot is opinionated and follows 'convention over configuration'.
Spring Boot reduces boilerplate code.
Spring Boot is ideal for microservices and standalone applications.
The type of controller in Spring is @Controller and the type of annotations are @RequestMapping and @ResponseBody.
@Controller is used to mark a class as a Spring MVC controller.
@RequestMapping is used to map a URL to a method in a controller.
@ResponseBody is used to indicate that the return value of a method should be serialized and returned as the response body.
Junkins is not a known term in software engineering.
Junkins is not a term used in software engineering.
It is possible that the interviewer misspoke or meant to ask a different question.
It is important to clarify any confusion or misunderstandings during an interview.
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 before Jul 2020. There were 4 interview rounds.
I applied via Referral and was interviewed in Apr 2021. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2019. There were 4 interview rounds.
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
It was Technical + Aptitude MCQ round.The technical section consisted if MCQ related to DSA,OS,DBMS.The aptitude section consisted of questions related to basic mathematics.
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
Create an array to store the minimum candies required for each student.
Iterate through the students' ratings array to determine the minimum candies needed based on the given criteria.
Consider the ratings of adjacent students to decide the number of candies to distribute.
Calculate the total candies req...
Round duration - 30 minutes
Round difficulty - Medium
It was a technical interview testing the basic skills of OS and DBMS of candidates along with few project discussions from your CV.
List of 15 Linux commands with their functions
ls - list directory contents
pwd - print working directory
cd - change directory
mkdir - make a new directory
rm - remove files or directories
cp - copy files and directories
mv - move or rename files and directories
grep - search for patterns in files
chmod - change file permissions
ps - display information about running processes
top - display and update sorted information about pr...
DDL is used to define the structure of database objects, while DML is used to manipulate data within those objects.
DDL includes commands like CREATE, ALTER, DROP to define database objects like tables, indexes, etc.
DML includes commands like INSERT, UPDATE, DELETE to manipulate data within tables.
Example of DDL: CREATE TABLE employees (id INT, name VARCHAR(50));
Example of DML: INSERT INTO employees VALUES (1, 'John Doe
Tip 1 : Be clear about the concepts of Linux and shell scripting.
Tip 2 : Learn about the basics of Data structures and Algorithm.
Tip 3 : Be prepared to explain your projects mentioned in your CV.
Tip 1 : Use professional Keywords in your resume.
Tip 2 : Don't mention anything you are not confident in.
based on 1 interview
Interview experience
Inside Sales Manager
94
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer- Customer Support
23
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Generalist
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Thomson Reuters
Oracle Cerner
Chetu
EbixCash Limited