I applied online. The process took 4 weeks. I interviewed at Fidessa (New York, NY) in Apr 2016
Interview
Lengthy process, including 2 online tests on hackerrank, one video interview on spark hive and finally a tech interview on code pair followed by a Skype interview. The coding problem is very simple, nothing special to say. But the last round of the interview over the Skype was very unpleasant. You could clearly feel that they didn't like you and just wanna finish this as quick as possible. Two interviewer were there for the Skype round. One was arrogant and cold. The other one was watching his cell phone from the very beginning.
Interview questions [1]
Question 1
Given N and K, where N is the number of the integers and K is the difference. You are supposed to find out how many pairs of numbers are of the difference K.
I applied online. The process took 2 weeks. I interviewed at Fidessa in Jan 2018
Interview
First round - prescreening test consisting of 2 easy questions on simple math and string
Second round- first coding round with 2 questions. Easy questions from string, array, and stack
Third round- sparkhire hr round by video recording with 3 simple questions
Forth round- codepair round yet to give
I applied through a recruiter. The process took 2 weeks. I interviewed at Fidessa (Woking, England) in Nov 2017
Interview
Got contacted on LinkedIn. Applied online. Had to do an online coding test on hackerrank. Fairly simple, use of vectors/arrays. Invited to the Assessment day in their Woking headquarters. 2 group tasks (mostly logic, team cooperation and work), as well as 2 individual (a face-to-face interview with technical questions and personality questions, and then an individual coding challenge). Chance to participate to a networking lunch while there. They prefer C++ over any other language.
Interview questions [2]
Question 1
Create a randomization algorithm to randomize numbers fairly evenly, without the use of any pre-made standard functions for random numbers (at the assessment centre)
Initial coding test, function to place new bikes on a bike rack (an array/vector) to be as far as possible from one another, given initial positions of the pre-existing bikes