Filter interviews by
I applied via Campus Placement and was interviewed in Nov 2022. There were 5 interview rounds.
Consisted of aptitude questions, few DSA and basic programming question along with a coding question.
Top trending discussions
posted on 4 Oct 2024
I applied via Referral and was interviewed in Sep 2024. There were 3 interview rounds.
Three DSA questions one on likedlist one on BST and one on maps
Smart pointers in C++ provide automatic memory management and help prevent memory leaks.
Smart pointers are objects that manage the memory of a pointer automatically.
They ensure that memory is deallocated when it is no longer needed.
Examples include unique_ptr, shared_ptr, and weak_ptr.
DSA questions on graph and lots of puzzles
I appeared for an interview in Apr 2022.
posted on 29 Jun 2017
I appeared for an interview before Jun 2016.
posted on 20 Aug 2024
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Asked Basic Aptitude Questions
ASICs are custom-designed for specific applications, while FPGAs are reprogrammable and more flexible.
ASICs are Application-Specific Integrated Circuits designed for a specific purpose or application.
FPGAs are Field-Programmable Gate Arrays that can be reconfigured for different tasks.
ASICs are more efficient and faster than FPGAs for specific tasks.
FPGAs are more flexible and can be reprogrammed for different function...
posted on 7 May 2024
I applied via Campus Placement and was interviewed before May 2023. There were 3 interview rounds.
4 Questions- 90 minutes
Medium to Hard level questions.
I solved 2.5 questions in 70 minutes and submitted the test because i was sure that the remaining 20 minutes wont help me.
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Jun 2021. There was 1 interview round.
posted on 31 May 2022
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Easy
Timing - 10AM-11:30AM
Online proctored test
Given a binary tree of integers, your task is to print the right view of it. The right view represents a set of nodes visible when the tree is viewed from the righ...
The task is to print the right view of a binary tree, representing nodes visible from the right side in top-to-bottom order.
Traverse the tree level by level and keep track of the rightmost node at each level
Print the rightmost node of each level to get the right view of the tree
Use a queue for level order traversal and a map to store the rightmost nodes
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Round duration - 45 minutes
Round difficulty - Medium
Timing : 4PM-5PM
Environment - Online
There was a panel of 3 interviewers
You can find the size of an array in C or C++ by dividing the total size of the array by the size of one element.
Calculate the total size of the array by multiplying the number of elements by the size of each element.
Divide the total size by the size of one element to get the size of the array.
For example, if you have an array of strings arr[] = {'hello', 'world', 'example'}, you can find the size by dividing the total
B+ trees are used for indexing in databases to efficiently search and retrieve data.
B+ trees are balanced trees where each node can have multiple keys and child pointers.
Data is stored in leaf nodes, while non-leaf nodes are used for navigation.
B+ trees are commonly used in databases because of their ability to efficiently search and retrieve data.
Example: In a database table with an index on a specific column, B+ tree...
Round duration - 45 mintues
Round difficulty - Easy
Timing - 11AM-12:15PM
Environment - online video call
Again there was a panel of 2 senior engineers
You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.
For the giv...
Find the maximum sum of the path from the root to any leaf node in an n-ary tree.
Traverse the tree from root to leaf nodes while keeping track of the sum of each path.
At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.
Consider using depth-first search (DFS) or breadth-first search (BFS) for tree traversal.
Handle cases where nodes have negative values or where
Tip 1 : Brush Up on Computer Science Fundamentals
Tip 2 : Prepare a Brief Self-Introduction
Tip 1 : Do not put fake resume
Tip 2 : Writing internship project helps.
I applied via LinkedIn and was interviewed in Jan 2021. There were 5 interview rounds.
Executive Engineer
93
salaries
| ₹6.2 L/yr - ₹18.5 L/yr |
Senior Engineer
91
salaries
| ₹9.2 L/yr - ₹20.3 L/yr |
Module Lead
76
salaries
| ₹10.7 L/yr - ₹24.3 L/yr |
Senior Technical Specialist
42
salaries
| ₹22.5 L/yr - ₹33.3 L/yr |
Senior Software Engineer
38
salaries
| ₹10 L/yr - ₹24.8 L/yr |
Apisero
Actalent Services
Cyber Infrastructure
TestingXperts