The hiring process at FDM Group takes an average of 14 days when considering 2 user submitted interviews across all job titles. Candidates applying for Trainee Program had the quickest hiring process (on average 14 days), whereas Trainee Program roles had the slowest hiring process (on average 14 days).
Here are the most commonly searched roles for interview reports -
The interview process was quite lengthy and disjointed. There were significant gaps between stages, with the recruiter sometimes disappearing for weeks before getting back to me about the next steps. The phone screening was particularly time-consuming, lasting about an hour and a half, which is quite unusual for an initial phone interview. The recruiter asked very detailed questions, more suited to a later stage of the process. Despite setting clear boundaries around my availability, these were not respected, as they continued to call at inconvenient times even after I had communicated my schedule.
Interview questions [1]
Question 1
What would be your career projection within the company in the long term?
1. Phone Interview (non-technical interview): call with a recruiter
2. One non-technical interview with an account manager: behavioural questions
3. One technical interview with technical trainer: data structure and algorithm questions
The tech interview process was structured yet challenging. It began with an online assessment focusing on algorithms and data structures, which tested both problem-solving skills and coding efficiency. This was followed by a technical screening where I was asked to solve coding problems live while explaining my thought process. The next round involved a system design interview, where I had to architect a scalable solution for a real-world problem. Finally, there was a behavioral interview, focusing on my experiences and how I handle teamwork and conflict. Overall, it was a thorough process that tested both technical and soft skills.
Interview questions [1]
Question 1
Problem: Reverse a String
Imagine you're working with a large codebase, and you've come across a scenario where you need to reverse a string. Implement a function that takes a string as input and returns the string reversed.
For example:
- Input: "hello"
- Output: "olleh"
- Input: "LeetCode"
- Output: "edoCteeL"
Constraints:
- The input string will consist of printable ASCII characters.
- The length of the string will be between 1 and 1000 characters.
Please write a function that efficiently reverses the string and handles edge cases, such as an empty string or a string with only one character.