Filter interviews by
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Reverse a linked list
Iterate through the linked list and reverse the pointers
Use three pointers to keep track of current, previous, and next nodes
Update the next pointer of each node to point to the previous node
One round online life coding, with the question being a simple find the smallest element from a list
I applied via Approached by Company and was interviewed in Jan 2022. There were 2 interview rounds.
Longest common string prefix
street robber
I applied via Recruitment Consulltant and was interviewed in Jan 2022. There were 2 interview rounds.
Longest common string prefix
street robber
Intel interview questions for designations
The maximum sum from root to leaf in a binary tree, where only parent or child can be included in the sum.
Use a recursive approach to traverse the binary tree.
At each node, calculate the maximum sum from its left and right child.
Compare the sums and return the maximum sum plus the value of the current node.
Repeat this process until reaching a leaf node.
Track the maximum sum encountered during the traversal.
Top trending discussions
I am asked to give the coding test and tech questions on resume and job description
I applied via Campus Placement and was interviewed in May 2024. There was 1 interview round.
posted on 26 May 2023
I applied via Campus Placement
I applied via campus placement at Indian Institute of Technology (IIT), Hyderabad and was interviewed before Jul 2023. There were 2 interview rounds.
It was related to electrical
Standard leetcode easy problem.
based on 3 reviews
Rating in categories
Software Engineer
342
salaries
| ₹13.3 L/yr - ₹52.4 L/yr |
SOC Design Engineer
223
salaries
| ₹12 L/yr - ₹35 L/yr |
System Validation Engineer
191
salaries
| ₹14 L/yr - ₹44 L/yr |
Design Engineer
158
salaries
| ₹12.1 L/yr - ₹44.6 L/yr |
Software Development Engineer
157
salaries
| ₹12 L/yr - ₹43 L/yr |
Qualcomm
Nvidia
Microsoft Corporation
Advanced Micro Devices