Fui entrevistado pela ARi (Bengaluru) em mai. de 2025
Entrevista
1 . Initial screening call for interview scheduling
2 . Interview by ARi Panel around 45-50 mins
3 . Interview by Client arund 1.1.15 hr
4 . Another HR Round for alary negotiations
5 . Got th offer letter
Candidatei-me por meio de recrutador(a). O processo levou 4 semanas. Fui entrevistado pela ARi (Chennai) em mai. de 2023
Entrevista
The interview process consisted of four stages. First was an L1 coding round focused on Java. The L2 round covered frameworks and projects, specifically BDD Cucumber, TestNG, and API testing. This was followed by an L3 Managerial round. Finally, the L4 round involved HR and salary discussions. It was comprehensive.
Perguntas de entrevista [1]
Pergunta 1
Coding round
1.swapping array and string related
2. Explain framework BDD cucumber and project related
Application and Resume Screening: Submission of your application and resume. LTI's HR team reviews applications to shortlist candidates based on educational background, skills, and experience.
Online Assessment: Shortlisted candidates usually undergo an online test that includes sections on quantitative aptitude, logical reasoning, and technical knowledge relevant to the role.
Technical Interview(s): Candidates who clear the online assessment are invited for technical interviews. These interviews focus on assessing programming skills, technical concepts, problem-solving abilities, and domain knowledge. Candidates might be asked to write code, solve algorithms, or discuss past projects.
HR Interview: This stage evaluates behavioral aspects, cultural fit, communication skills, and motivation for joining LTI. Questions may cover your background, strengths, weaknesses, and career aspirations.
Final Offer: Successful candidates receive a job offer, subject to background verification and document submission.
Perguntas de entrevista [1]
Pergunta 1
Explain the difference between an array and a linked list.
How does a binary search tree work? Implement insertion and deletion.
Write a function to reverse a linked list.
What is the time complexity of quicksort?
Solve a problem: Find the largest sum contiguous subarray.