Category: Medium Difficulty

The Max Double Slice Sum was a challenging problem to solve in O(N) complexity. I iterated through the array from both sides finding out at each position the maximum …

Ok the Max Counters problem is the first algo challenge marked as medium in the codility lessons. I devised a O(m+n) solution. We first check if there’s no element …

The Number of Disc Intersections is the hardest challenge so far, at least for me. I had to go seriously out of the box for this one, but in …

The Min Average Slice problem gives more of a mathematical challenge than a coding one. The trick here is to figure out that you only need to find the …

The Count Div problems is classified as a medium difficulty but I found the solution to be quite trivial and easily solvable in O(1). The only thing we need …

The Missing Integer problem in the 4th Codility lesson is marked as medium but I think the solution is pretty straight forward. The complexity of my solution is O(N) …