Ho presentato la mia candidatura online. La procedura ha richiesto più di una settimana. Ho sostenuto un colloquio presso Jane Street (New York, NY) nel mese di dic 2017
Colloquio
Applied online through the website. Received a request for a phone interview the same day. Phone interview was about 40 minutes and consisted of one programming question conducted over coderpad.io. Interviewer was pleasant and helpful. Received a rejection back a week later.
Domande di colloquio [1]
Domanda 1
Implement data structures and evaluation function for a stack machine given certain instructions that operate on a stack of data (ints and strings).
Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Jane Street (Chennai) nel mese di ago 2017
Colloquio
Had a phone interview with one of their devs. 45 mins long. Had three questions. They gave me an API and I had to use it to solve some basic questions. Would be a good question to revise Hashing, Data Structures. Wasn't too specific on complexity.
Domande di colloquio [2]
Domanda 1
Given an spreadsheet API with functions -> GetValue(), SetValue(), SetFormula(), how will you calculate the sum of an array?
Ho presentato la mia candidatura online. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Jane Street (Hong Kong) nel mese di mag 2017
Colloquio
I applied online and received an email a few weeks later from a recruiter for a technical phone interview, which lasted for an hour.
I got a response within days, they invited me to an onsite interview where they did two interviews ~45 each, coding on a provided laptop. I stumbled for a bit trying to find an efficient solution. The interviewers were friendly, guiding me with possible improvements and pointing out edge cases. I got the email a week later saying they would be looking for other candidates.
Domande di colloquio [1]
Domanda 1
Given two strings representing big numbers, and an operator (+/-), calculate and the return the result of that operation as a string.