
IMC Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 30 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at IMC.
Software Engineer
I did 2 online assessments, one was on graph problems and the other on task scheduling. Then I had a one-way online interview with 3 technical questions, mainly about programming languages and data structures.
- Can you explain the differences between two programming languages you are familiar with?
Software Engineer
The IMC interview was hard but good, it really tested problem-solving and modern C++ skills. They were super professional and upfront about salaries, even when I asked for less. The whole thing was really quick too, which was great for dealing with other job offers.
- Can you explain what C++ templates are and their benefits?
Software Engineer
The interview process started with an online assessment (OA) that had typical leetcode style questions. Next, there was a one-way video interview where I had to explain a HashTable in simple terms. After that, an HR phone screen followed, asking standard questions like 'why IMC?'. The final stage was a challenging 2-hour problem-solving session with two engineers. The first hour involved whiteboarding to discuss the trade-offs of different data structures, and the second hour was a coding exercise in Java. Although I didn't pass this stage, candidates who do well on the technical parts move on to a behavioral interview before a final decision is made.
- Leetcode style questions and a practical problem solving assignment related to trading.
IMC Software Engineer Interview Questions
Quoted word for word from IMC interview reports.
“Given a list of integers A representing jump indices (where the next jump from location k is A[k]) within bounds [0, n), find the length of the loop starting from index 0.”
Read reports →“Given a map containing the locations of ships, and a single hit point, return the count of hits and sunk ships.”
Read reports →“Find the largest island in a given nxm matrix where 1s represent islands and 0s represent water.”
Read reports →“Given a mxn grid containing battleships (no diagonal placement), with grid dimensions, ship placements, and shot locations provided as strings, calculate and return the count of fully sunk ships and the count of ships that have been hit but not yet sunk.”
Read reports →“Write a function to find the minimum time cost to merge all arrays into one, given an array of array lengths and a merging algorithm that takes two arrays at a time with a cost equal to the sum of their lengths.”
Read report →“What is the shortest time to merge two arrays?”
Read report →“Is it possible for an algorithm to have a time complexity less than O(1)?”
Read report →“What's the minimum number of trips an elevator needs to take people of varying weights to different floors?”
Read report →“Can you find cycles in an array?”
Read report →Formats, difficulty and experience
Across all 30 IMC interview reports.