• 31

What will I learn?

Binary searchIntervals

In this puzzle, you have to handle computation on a grid that is too large to be stored. You learn to implement an efficient binary search algorithm.

External resources

Binary searchTrilateration


In order to find an interest point on a grid, you need to implement a binary search or trilateration. The grid can be quite large and requires some optimization of your code.

Solve it

A higher resolution is required to access the IDE


The Joker is still on the run! A new series of bombs has been placed in the buildings of the city. With the help of Alfred's brand new detector, ALF2.0, get your hands ready to climb these buildings once more and defuse the bombs.


This difficult puzzle is the second of the two exercises proposed for the challenge « Shadows of the Knight ». Before you solve it, get warmed up with the first level, « Shadows of the Knight - Episode 1 ».

Online Participants