i
KLA
Filter interviews by
I applied via Walk-in and was interviewed in Sep 2024. There was 1 interview round.
Test was on hackerrank leetcode hard question
Top trending discussions
I applied via Approached by Company and was interviewed before Dec 2022. There were 4 interview rounds.
Asked about cement plant operations & troubleshooting problems in your career.
I applied via Recruitment Consulltant and was interviewed in Apr 2024. There was 1 interview round.
It was hard and got tons of ds qs
I applied via Campus Placement and was interviewed in Oct 2022. There were 3 interview rounds.
Aptitude test with 1 Coding Question
Hirepro , 2 easy to medium coding questions with technical questions
To insert a node at the middle of a linked list, find the middle node and adjust pointers accordingly.
Find the middle node using slow and fast pointers
Adjust pointers to insert the new node at the middle
Quantitative Questions
Computer Science core MCQ questions
2 Coding Questions
Developed a web application for tracking inventory and sales data
Used React.js for front-end development
Implemented RESTful APIs for backend using Node.js
Utilized MongoDB for database management
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 21 Dec 2021
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).
posted on 18 Feb 2022
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
I applied via Naukri.com and was interviewed before Aug 2022. There were 4 interview rounds.
Problem would be given to solve
based on 1 interview
Interview experience
Technology Specialist
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Technical Leader
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Development Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Applied Materials
Lam Research
ASML
Entegris