I applied online. The process took 2 weeks. I interviewed at Simplias (Leipzig) in Nov 2022
Interview
Mehrere Runden an online Interviews / Telefonate, letzte Runde mit dem CEO. Fragen über die Motivation, die eigene Erfahrung, Umgang mit Abweisung / kein Erfolg. Die ersten Interviews liefen per Telefon, danach Videocall und als letztes zusammen mit dem CEO
I applied online. The process took 3 days. I interviewed at Simplias (New York, NY) in Jan 2023
Interview
group interview. was long and I did not like having to share the interview time with other people. the interview person was incredibly Nice though and got back to me fairly quickly.
I interviewed at Simplias (New York, NY) in Dec 2019
Interview
The recruiter doesn't respect condidates.
a) he asked to develop a program (no explanation of what does that mean) to define geographical proximity between people like Tinder.
if there is no implementation he cancel the interview even if the condidate has a scratch and developed architecture on paper.
b) very complex requirement that requires a lot of work and time for an internship position.
c) the recruiter intimidates the student by telling him that there is many condidates for the position and there is no need to continue the interview when he didn't implement the "program".
Interview questions [2]
Question 1
Develop (on paper) and explain the architecture for the following example. "Mobile Field Report" consists of an Online Portal to manage service technicians, many mobile devices and an ERP-System. The ERP-System must be periodically synchronized with the Online Portal. Some clients do haven ERP-Systems some don't. Those that don't have an ERP-System will use the internal ERP-System provided by the Online Portal. Which architecture and
tools would you use in order to have a nice and clean interface, that has a versioning and allows to integrated many different ERP-Systems. Only regard the technical aspects of the "Mobile Field Report" and assume that the ERP-System is not specified.
Develop a program to find out nearby people. You are allowed to use any resource from the internet, that makes your life easier. Suppose you have GPS coordinates of a large number N of people. How can you find all those who are geographically close, e.g., within a radius of 1km ? Remember, it may be millions of instances, so a direct search is too slow. Also, the coordinates of each person may change every second, so basically you need an NxN distance grid, since you need to update the distance information of all N people constantly. Can you think of an algorithm to solve this in computable time? Take a modern normal computer as computational backbone.
