Ho presentato la mia candidatura online. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Sparx Learning (Exeter, Inghilterra) nel mese di gen 2016
Colloquio
There was an online coding assessment and then a Sparx-made maths assessment, then a phone interview, then a group interview day which had a few 1:1 interviews throughout the day. The coding assessment had some typical questions, and the phone interview was mostly bookwork. The group day was a lot more challenging and was of the format 'we don't expect you to finish' so there were lots of good problems
Domande di colloquio [1]
Domanda 1
What is a class? What is inheritance? etc.
How do you store numbers in memory?
Ho presentato la mia candidatura online. La procedura ha richiesto 3 giorni. Ho sostenuto un colloquio presso Sparx Learning (Exeter, Inghilterra) nel mese di mar 2016
Colloquio
I applied online for a software development position and was asked to complete two tests. The first was a set of Codility coding tests focused around array manipulation, and the second was a set of probability and logic based maths questions on their own site. Three hours were given for the Codility test, but I managed to finish it in just over an hour. An hour was given for the second test, and all the time was required. They even accept at the start of the test that you may not have time to finish all the questions. I was able to take the tests in any order and at any time (before a deadline) which was a great bonus.
Domande di colloquio [1]
Domanda 1
Array manipulation questions on Codility, and probability based questions (with some conditional probability questions) on their own web site.
Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Sparx Learning nel mese di gen 2016
Colloquio
Firstly I was given three coding questions to do and 6 probability questions. I didn't do well enough in the coding questions, but they offered to move me over to the Content Scientist path, where the next stage would be to do a video interview, however I declined.
Domande di colloquio [1]
Domanda 1
Find the longest increasing subsequence in an array
