You have decided to apply for one of our coveted technology jobs. That’s great! At Discovergy, we do things a little differently than other companies. We don’t require you to write a fancy “motivation” or “introduction” letter, nor are we interested in your certificates or references. Instead, we want you to show us what you can do.

Please answer the following questions from a practical, real-world perspective. None of these questions have rigid “solutions”, they merely serve as starting points for you to dazzle us with your knowledge and sharpness. Write whatever you feel is the best fit for the question.

If we like your answers, you will be invited for a face-to-face interview at our headquarters in Heidelberg. Apply now – competition is fierce.
  • Coding task

    Refactor the following Java 8 code into a version that you would consider using in a mission- and performance-critical production environment. Fix any bugs that prevent it from working as (presumably) intended. Describe a possible use case for the class.
  • Algorithmic task

    Given a string of length 1048576, find the position of the longest substring made from identical characters. It is guaranteed that there is only one such substring and its length is 8192. You are not allowed to peek inside the string, however you can call an external function "getMaxLength(int startPosition, int endPosition)" which will return the longest number of identical consecutive characters found within the interval. Describe your solution in code or prose.
  • General questions

  • / /
  • / /