Filter interviews by
I applied via Campus Placement and was interviewed in Feb 2022. There were 3 interview rounds.
There were total 10 sections including Aptitude, C++, Java, Python, DSA, OS, Embedded C, ML, Web development, C sharp. Total of 90 MCQ's in 120 mins, no negative marking.
Top trending discussions
I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.
C++ Java Python sql excel
To reverse a linked list, iterate through the list and change the direction of pointers.
Iterate through the linked list and keep track of the previous, current, and next nodes.
Update the pointers of each node to reverse the direction.
Set the head of the linked list to the last node encountered during iteration.
I applied via Approached by Company and was interviewed before Oct 2022. There were 2 interview rounds.
Traverse the binary tree using a queue to find leaves from left to right.
Start by adding the root node to a queue
While the queue is not empty, dequeue a node and check if it is a leaf node (both children are null)
If it is a leaf node, add its value to the result array
If it is not a leaf node, enqueue its children in left to right order
Breadth-first search (BFS) is a traversal algorithm used to visit all nodes of a binary tree level by level.
Start at the root node and visit all nodes at the current level before moving to the next level.
Use a queue data structure to keep track of nodes to visit next.
Example: BFS traversal of a binary tree - 1 -> 2 -> 3 -> 4 -> 5
I applied via Approached by Company and was interviewed before Jul 2022. There were 4 interview rounds.
Coding questions on Python , html , C++ and data structure. Also about database and SQL query.
I applied via LinkedIn and was interviewed before Sep 2020. There was 1 interview round.
I was interviewed in May 2019.
Algorithm to find GCD
Use Euclid's algorithm to find GCD
Divide the larger number by the smaller number
If remainder is 0, smaller number is GCD
If remainder is not 0, repeat with smaller number and remainder
In-order traversal is a way of visiting all nodes of a binary tree in a specific order.
Start at the root node
Traverse the left subtree recursively
Visit the root node
Traverse the right subtree recursively
Matrix traversal algorithm is used to visit each element of a matrix in a specific order.
Matrix traversal can be done using nested loops.
There are different traversal orders like row-wise, column-wise, spiral, diagonal, etc.
Traversal can be optimized using techniques like caching and parallel processing.
Data structure is a way of organizing and storing data in a computer so that it can be accessed and used efficiently.
Data structures are used to manage large amounts of data efficiently.
Common data structures include arrays, linked lists, stacks, queues, trees, and graphs.
Choosing the right data structure for a particular problem can greatly improve the efficiency of an algorithm.
Understanding data structures is essent...
based on 1 review
Rating in categories
Staff Engineer
140
salaries
| ₹15 L/yr - ₹38 L/yr |
Senior Staff Engineer
79
salaries
| ₹26.9 L/yr - ₹63.8 L/yr |
Software Engineer
67
salaries
| ₹6.8 L/yr - ₹25 L/yr |
Senior Software Engineer
53
salaries
| ₹13 L/yr - ₹30 L/yr |
Senior Specialist
51
salaries
| ₹8 L/yr - ₹21 L/yr |
Texas Instruments
Analog Devices
STMicroelectronics
NXP Semiconductors