Filter interviews by
I applied via Naukri.com and was interviewed in Dec 2023. There were 3 interview rounds.
Here they asked lots of logical reasoning questions and checked on how you approached different situations
I applied via LinkedIn and was interviewed in Nov 2021. There were 3 interview rounds.
Hashmap is a data structure that stores key-value pairs and allows constant time access to values.
Hashmap uses a hash function to map keys to indices in an array.
Collisions can occur when multiple keys map to the same index, which can be resolved using techniques like chaining or open addressing.
Hashmap operations like insertion, deletion, and lookup have an average time complexity of O(1).
I applied via Company Website and was interviewed in Jan 2022. There was 1 interview round.
A stack is a linear data structure that follows the Last In First Out (LIFO) principle.
Implement using an array or linked list
Push operation adds element to top of stack
Pop operation removes element from top of stack
Peek operation returns top element without removing it
To find intersection of two linked lists, traverse both lists and compare each node.
Traverse both linked lists and compare each node
Use two pointers, one for each linked list
If a node is common, return the node
If both pointers reach the end, return null
What people are saying about Applied Materials
I applied via Naukri.com and was interviewed in May 2020. There were 7 interview rounds.
Applied Materials interview questions for designations
Invert the bits of a given number
Use bitwise XOR operator (^) with 1 to flip each bit
Repeat the process for all bits in the number
Return the inverted number
Backward compatibility can be supported by using versioning, deprecation strategies, and maintaining clear communication with users.
Use versioning to clearly distinguish between different versions of the system
Implement deprecation strategies to phase out old features gradually
Maintain clear communication with users about upcoming changes and provide migration paths
Consider using compatibility layers or adapters to bri...
posted on 21 Feb 2025
I applied via Referral and was interviewed in Nov 2023. There were 6 interview rounds.
Duration: 1Hour 30 Minutes, 2 Coding Questions of Total 175 Marks. 1st Question has 75 marks and 2nd Question has 100 marks.
Using Bitwise OR operation to find the smallest missing number in an array.
Iterate through the array and perform Bitwise OR operation with each element to set corresponding bit in a bitmask
Iterate through the bitmask to find the first unset bit, which represents the smallest missing number
Example: Array [0, 1, 3, 4, 6] would have a bitmask of 10101, smallest missing number is 2
Pseudo code for a scenario
Define variables and data structures needed
Write the main logic using conditional statements and loops
Handle edge cases and error conditions
Test the pseudo code with sample inputs
Major questions were around problem solving, strings
posted on 24 Jun 2024
based on 1 interview
1 Interview rounds
based on 16 reviews
Rating in categories
Bangalore / Bengaluru
4-7 Yrs
Not Disclosed
Technical Lead
248
salaries
| ₹12.1 L/yr - ₹46 L/yr |
Senior Software Engineer
123
salaries
| ₹10 L/yr - ₹30 L/yr |
Manufacturing Engineer
88
salaries
| ₹5.5 L/yr - ₹17 L/yr |
Software Engineer
87
salaries
| ₹6 L/yr - ₹20.8 L/yr |
Senior Engineer Mechanical
61
salaries
| ₹9 L/yr - ₹20 L/yr |
Lam Research
KLA
ASML
Entegris