## Passing Cars – Codility 100% Correct Javascript Solution

The Passing Cars challenge takes a step back in difficulty but it’s still a fun problem to solve. It can be done with O(N) complexity and it’s fairly easy. …

The Passing Cars challenge takes a step back in difficulty but it’s still a fun problem to solve. It can be done with O(N) complexity and it’s fairly easy. …

The Nesting – Codility Challenge is a variant of the Brackets algorithm I solved a few days ago. The difference here is that we have fewer types of brackets …

The Frog River One problem states that a frog can only jump from one side to the other of the river when leaves are placed at each “lane” on …

The Perm Check Challenge defines a permutation as a sequence containing each element from 1 to N once, and only once. So the order does not matter. I devised …

The Tape Equilibrium problem asks us to find the minimum difference between all the possible splits of an array (the left side minus the right side). It’s a fairly …

This is another simple practice run with a O(n) / O(N * log(N)) solution. Just iterate through the array once and fill an empty array of length N+1 with …