i
Advanced Micro Devices
Filter interviews by
I applied via Campus Placement and was interviewed in Feb 2024. There was 1 interview round.
Top trending discussions
I applied via Referral and was interviewed before Jan 2021. There were 5 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
posted on 26 Nov 2020
I applied via Naukri.com and was interviewed in May 2020. There were 7 interview rounds.
I applied via Recruitment Consulltant and was interviewed in Sep 2023. There were 2 interview rounds.
1 easy, 1 medium and 1 hard LC
To access files in a different server, use protocols like FTP or SSH. To identify similar key value pairs in multiple files, compare values using a script or tool.
Use FTP or SSH protocols to access files in a different server
Write a script or use a tool to compare key value pairs in multiple files
Identify values that are the same and different across files
Example: Use Python script to read files and compare key value p
posted on 4 Jun 2024
I applied via LinkedIn and was interviewed before Jun 2023. There were 3 interview rounds.
Day to day tasks involve coding, debugging, testing, and collaborating with team members.
Writing code for new features or fixing bugs
Debugging and troubleshooting issues
Testing code to ensure quality and functionality
Collaborating with team members on projects
Participating in code reviews and providing feedback
I applied via LinkedIn and was interviewed in May 2022. There were 3 interview rounds.
Easy questions were there in round 10 . . . . . . .
Major questions were around problem solving, strings
posted on 15 Jul 2024
To add two linked lists, iterate through both lists simultaneously and add corresponding nodes, considering carry from previous addition.
Create a dummy node to hold the result.
Initialize current node to dummy node.
Iterate through both lists, adding values and carry from previous addition.
Move to next nodes in both lists.
Handle cases where one list is longer than the other.
Handle final carry if present.
Use Dijkstra's algorithm to find the shortest path in a graph
Implement Dijkstra's algorithm to find the shortest path between two nodes in a graph
Maintain a priority queue to keep track of the shortest distance to each node
Update the shortest distance to each node as you traverse the graph
Track the path by storing the previous node for each node visited
Check if a binary tree is a Binary Search Tree (BST)
Perform an in-order traversal of the tree and check if the resulting array is sorted
Keep track of the previous node value during traversal to compare with the current node value
Ensure that each node's value is greater than the previous node's value in the in-order traversal
Check if a substring in an array of strings is a palindrome or not.
Iterate through each string in the array
For each string, check if any of its substrings are palindromes
Return true if a palindrome substring is found, false otherwise
posted on 14 Aug 2024
I applied via Naukri.com and was interviewed in Feb 2024. There was 1 interview round.
Reverse a linked list recursively
Create a recursive function to reverse the linked list
Pass the current node and its next node as parameters
Update the next pointer of the current node to point to the previous node
Check if two stacks are equal by comparing each element in the stacks
Pop elements from both stacks and compare them one by one
If the sizes of the stacks are different, they are not equal
If any element in the stacks is different, they are not equal
based on 1 interview
Interview experience
Senior Software Engineer
117
salaries
| ₹12 L/yr - ₹43 L/yr |
Member Technical Staff
116
salaries
| ₹24 L/yr - ₹70 L/yr |
Software Engineer
74
salaries
| ₹4.5 L/yr - ₹17.4 L/yr |
Software Development Engineer II
64
salaries
| ₹10 L/yr - ₹34 L/yr |
Senior Software Development Engineer
50
salaries
| ₹19.4 L/yr - ₹45 L/yr |
Qualcomm
Intel
TDK India Private Limited
Molex