i
Gen
Filter interviews by
I was interviewed before Mar 2021.
To check if a number is a power of 2, we can use bitwise operations.
A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.
Sort a stack without using another data structure
Use recursion to pop the top element and insert it at the bottom of the remaining stack
Repeat until the stack is sorted in ascending order
Time complexity: O(n^2), space complexity: O(n) due to recursion
Check if array has continuous increasing and decreasing values
Loop through the array and check if each element is greater than the previous one
Once you find the maximum element, check if the remaining elements are in decreasing order
If yes, return true else false
Design a cricinfo (LLD)
Identify the entities: players, teams, matches, scorecards, tournaments, etc.
Define the relationships between entities
Create a database schema to store the data
Implement APIs to fetch and update data
Design a UI to display the information
Consider scalability and performance
Ensure data security and privacy
Top trending discussions
posted on 7 May 2017
I was interviewed in Feb 2017.
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
posted on 9 May 2024
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
Tha aptitude exam was not very easy and not that difficult. It was something which one can easily get into.
I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.
Some advanced linked list questions
I applied via Campus Placement and was interviewed before Mar 2021. There were 4 interview rounds.
Test was on HackerRank with a duration of 90 minutes. It contained around 25 aptitude and 2 coding questions.
Aptitude on SHL platform. Each question had a time constraint and you cannot navigate back to the previous question. Would recommend to give a demo SHL test before taking the actual test.
I applied via Campus Placement and was interviewed before Mar 2023. There were 2 interview rounds.
Basic behavioural and aptitude questions
I was interviewed in Sep 2020.
Round duration - 120 minutes
Round difficulty - Medium
It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium level. Time was enough and no sectional time was present. 1-2 mcqs on SQL were also present.
This round was immediately followed by an SHL aptitude test which was basically a quick limited time check of your verbal ability and maths because many questions were to be done in 1 hour.
Given a 2-dimensional matrix of size NxN containing 0s and 1s, the task is to modify the matrix such that, if an element is 1, set its entire row and column to 1. I...
Modify a matrix by setting entire row and column to 1 if an element is 1, then count the number of 1s.
Iterate through the matrix to find elements with value 1
Use two arrays to keep track of rows and columns to be modified
Update the matrix by setting entire row and column to 1 if an element is 1
Count the number of 1s in the modified matrix
Round duration - 55 minutes
Round difficulty - Medium
It was an online video interview round on HackerEarth with simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class which required inheritance was asked by the interviewer to write. I was helped by the interviewer if i got stuck somewhere, Some questions on implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.
Tip 1 : Never give up
Tip 2 : When u start a topic, don't move on to next topic before you are 100% confident in previous topic
Tip 3 : Try to give maximum time on basics of a topic especially OOPS
Tip 4 : Practice everyday
Tip 1: Write only those things in resume in which you are 100% confident
Tip 2: Write maximum projects you have and be ready to explain them thoroughly
Tip 3: Don't make any silly spelling mistakes on resume
based on 14 reviews
Rating in categories
Senior Software Engineer
92
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
75
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Operations Analyst
58
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Software Engineer
37
salaries
| ₹0 L/yr - ₹0 L/yr |
SQA Engineer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
McAfee
Kaspersky Lab
QUICK HEAL TECHNOLOGIES
Seqrite