Applied for the graduate program. Had to undergo the pymetrics assessment.
Got a call from HR, then had an initial HR interview to discuss my skills and interests.
After that was the first manager interview where I spoke to a lead of a practice. Behavioural questions, my interests in university subjects.
Two weeks later was the hiring manager interview. Got asked questions about what I did in university subjects, some technical questions, behavioural questions like "If I gave you a project, what questions would you ask me?"
Domande di colloquio [1]
Domanda 1
What is a breadth tree search?
What would prevent a client from adopting cloud computing?
What concepts did you learn in this particular subject and how can you apply it to the work place?
What are your weaknesses?
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso IBM (New York, NY) nel mese di mar 2026
Colloquio
OA has 1 sql question and 1 python question, both easy, administed via hackerrank, may be through another one though as well. you are given 60 mins to complete the OA portion of the interview process
Domande di colloquio [1]
Domanda 1
You are given a table called Employee that contains each employee’s monthly salary and the number of months they have worked.
Find the highest total earnings among all employees
Determine how many employees have that exact highest earnings
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso IBM (Newark, DE) nel mese di gen 2026
Colloquio
It was a good experience overall. The assessment was conducted online through HackerRank and was well structured, focusing on problem-solving, logical thinking, and fundamental technical concepts in a clear and manageable way.
Domande di colloquio [1]
Domanda 1
They asked questions focused on SQL and LeetCode-style problem solving, mainly testing logical thinking, data handling, and basic algorithmic concepts.
Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso IBM nel mese di set 2025
Colloquio
Applied and next day received a hacker rank.
SQL easy,
BUT LEETCODE MEDIUM
Required depth first search of an acyclic directed graph, and minimize the required changes so that a condition could be met.
SQL took me like 8 min but the LEETCODE one I couldn't get right. Code complied and all but didn't pass the test cases and timed out for some.
Hadn't seen or practiced a tree traversal question in years much less one that combined trees with minimization problems
Domande di colloquio [1]
Domanda 1
Similar to LEETCODE 1135 but harder.
Had two dozen test cases this question
