i
KLA
Filter interviews by
I am asked to give the coding test and tech questions on resume and job description
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
What is machine learning
I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.
2 problem was given to solve
1) Smallest Negative balance - -----%20America%20-%20Weekly%20Algorithm%20Challenges/Week%2021%20Algorithm%20Challenge/Smallest%20Negative%20Balance.md
2) Find the absolute difference between alpha & beta from the array.
Alpha -An element k in a array occurs k consecutive time
Beta - An element k in an array occurs k consecutive time starting from index k
Sample input
Arr[] = {2,2,2,4,4,4,4,1,2,2]
Output
Alpha - 3
Beta - 1
Absolute difference - 1
Note : consider array index starts with 1
Simple easy not much difficult to clear for 3 years experience
Easy leetcode easy question asked easy to clear
KLA interview questions for popular designations
I applied via Referral and was interviewed in Jul 2024. There were 2 interview rounds.
Chart diagram from Given Test Scenario
Algo on Image Comparison
I applied via Referral and was interviewed in Apr 2024. There were 2 interview rounds.
Round 1- 30 questions of aptitude
Flow diagram of Wafer Test cases
Start with wafer preparation
Perform electrical testing on each die
Check for defects and record results
Sort dies based on test results
End with final wafer disposition
Test cases should cover various scenarios to ensure software quality.
Test case for positive scenario
Test case for negative scenario
Test case for boundary value testing
Test case for error handling
Test case for performance testing
I applied via Instahyre and was interviewed in Aug 2024. There was 1 interview round.
Question based on the array and graph. its 1 hour test on hackerrank
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
I applied via Walk-in and was interviewed in Sep 2024. There was 1 interview round.
Test was on hackerrank leetcode hard question
Was asked details of scanning electron microscopy
Top trending discussions
Interview experience
Technology Specialist
14
salaries
| ₹27 L/yr - ₹63 L/yr |
Softwaretest Engineer
10
salaries
| ₹4 L/yr - ₹6 L/yr |
Technical Lead
8
salaries
| ₹16 L/yr - ₹54 L/yr |
Product Development Engineer
7
salaries
| ₹10.7 L/yr - ₹24 L/yr |
Associate Technical Leader
7
salaries
| ₹30 L/yr - ₹45 L/yr |
Applied Materials
Lam Research
ASML
Entegris