I applied online. I interviewed at IBM (New York, NY) in Mar 2025
Interview
I interviewed at IBM NYC in March 2025. The interview process itself was pretty easy, recruiter screen, live coding, behavioral panel interview. I got offered three weeks later.
I joined as an Associate Data Scientist for the NYC office. Travel was mentioned, but I figured as a technical role I’d have some stability. In reality, our team was regularly sent all over the U.S. I spent weeks driving to client offices in NJ & CT, flying to Austin, Durham, and whatever IBM offices they needed the team. Felt like I was living out of a suitcase most of the year. It was tough to build any kind of routine, especially having to keep my utilization and hours logged to clients.
Leaving the company now after a year. Good resume builder, but not a career for me. Wouldn’t recommend to someone who is looking for stability.
Interview questions [1]
Question 1
Difference between gradient boosted trees and random forest
I applied online. I interviewed at IBM (New York, NY) in Mar 2026
Interview
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
Interview questions [1]
Question 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
I applied online. I interviewed at IBM (Newark, DE) in Jan 2026
Interview
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.
Interview questions [1]
Question 1
They asked questions focused on SQL and LeetCode-style problem solving, mainly testing logical thinking, data handling, and basic algorithmic concepts.
I applied online. The process took 2 weeks. I interviewed at IBM in Sep 2025
Interview
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
Interview questions [1]
Question 1
Similar to LEETCODE 1135 but harder.
Had two dozen test cases this question
