Candidatei-me por meio de uma faculdade ou universidade. Fui entrevistado pela KLA (Chennai) em dez. de 2025
Entrevista
Hackathon that involved problem statement specific to the implementations within the company.
Initial shortlist after day 1.
Second day was building more upon prev day's milestones.
Final selection was based on both day 1 and day 2 performances.
Perguntas de entrevista [1]
Pergunta 1
To umderstand n explain our solution properly and legibly
Candidatei-me por meio de uma faculdade ou universidade. Fui entrevistado pela KLA (Chennai) em nov. de 2025
Entrevista
1.online assessment - DSA, medium and hard
2.technical interview 1 - 3 coding will be given medium and hard
3.technical interview 2 - coding wil be given
4.HR round
all rounds are elimination rounds
all rounds are very difficult
need high level preparation
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 5 dias. Fui entrevistado pela KLA (Coimbatore) em dez. de 2024
Entrevista
cp test with 2 questions was conducted first. And from that shortlisted ones had one day hackathon (problem statement) in college campus. Based on performance in hackathon was selected for internship
Perguntas de entrevista [1]
Pergunta 1
cp - You are given a binary string 𝑆 consisting of '0's and '1's. You need to move all the '1's in the string to the rightmost positions, maintaining their relative order.
The movement rules are as follows:
1. To choose a '1', it costs 1 unit.
2. Each step to move a '1' one position to the right costs 1 unit.
3. A '1' cannot move if the position immediately to its right is already occupied by another '1'.
4. You cannot choose a '1' that cannot move.
Calculate the maximum time to move all the '1's to the rightmost positions.
