Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso IMC Trading (Champaign, IL) nel mese di feb 2012
Colloquio
So i met IMC representatives at the career fair. I spoke to them and handed them my resume. They contacted me 2 days later sending me two problems attached to an email. They told me to send the solutions within 2 days (which is pretty tight). They however, apologized for the tight deadline and told me that this was their way of screening people. I don't think it was required though. Only recommended. So I solved them and handed in the solutions in due time and the asked me for a first round interview in a week.
In the first round interview they asked me to solve a problem which was fairly easy.I will describe those below. They told me they'll announce if I will be accepted for a second round interview soon. I'll update you once I know more.
Domande di colloquio [1]
Domanda 1
Write a function that takes in an integer array and returns a boolean, whether or not the array has duplicates in it.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso IMC Trading (Sydney) nel mese di mag 2026
Colloquio
2 leetcode questions and one video interview for OA, 30 minute HR call, 2 hour coding (1 hour discussion 1 hour coding), onsite is 3 rounds, one round discussion, one round whiteboard, one round behavioural.
Ho sostenuto un colloquio presso IMC Trading (Sydney)
Colloquio
The recruiter screen was well run, You go through your resume and transcript and talk about yourself. It was only about 20 minutes but a very standard interview all things considered
Ho presentato la mia candidatura online. La procedura ha richiesto 3 giorni. Ho sostenuto un colloquio presso IMC Trading (Amsterdam) nel mese di ott 2024
Colloquio
This is about HackerRank. It was a nice assessment, interesting assignments. There were two, each of them had 13 tests which the code had to pass. The difficulty was medium to hard I would say
Domande di colloquio [1]
Domanda 1
There was an assignment about a stack, and one with minimum cost