Passing Cars

A non-empty zero-indexed array A consisting of N integers is given. The consecutive elements of array A represent consecutive cars on a road. Array A contains only 0s and/or 1s: 0 represents a car traveling east, 1 represents a car traveling west. The goal is to count passing cars. We say that a pair of cars (P, Q), where 0 ≤ P < Q < N, is passing when P is traveling to the east and Q is traveling to the west.

Posted by itungnt Friday, March 4, 2016

Frog River One

A small frog wants to get to the other side of a river. The frog is currently located at position 0, and wants to get to position X. Leaves fall from a tree onto the surface of the river. You are given a non-empty zero-indexed array A consisting of N integers representing the falling leaves. A[K] represents the position where one leaf falls at time K, measured in seconds. The goal is to find the earliest time when the frog can jump to the other side of the river.

Posted by itungnt Thursday, March 3, 2016

Perm Missing Elem

A zero-indexed array A consisting of N different integers is given. The array contains integers in the range [1..(N + 1)], which means that exactly one element is missing. Your goal is to find that missing element. Write a function: function solution(A); that, given a zero-indexed array A, returns the value of the missing element. For example, given array A such that: A[0] = 2 A1 = 3 A[2] = 1

Posted by itungnt Wednesday, March 2, 2016

Tape Equilibrium

A non-empty zero-indexed array A consisting of N integers is given. Array A represents numbers on a tape. Any integer P, such that 0 < P < N, splits this tape into two non-empty parts: A[0], A[1], …, A[P − 1] and A[P], A[P + 1], …, A[N − 1]. The difference between the two parts is the value of: |(A[0] + A[1] + … + A[P − 1]) − (A[P] + A[P + 1] + … + A[N − 1])|

Posted by itungnt Tuesday, March 1, 2016

Frog Jmp

A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always jumps a fixed distance, D. Count the minimal number of jumps that the small frog must perform to reach its target. Write a function: function solution(X, Y, D); that, given three integers X, Y and D, returns the minimal number of jumps from position X to a position equal to or greater than Y.

Posted by itungnt Saturday, February 20, 2016

ABOUT ME

Enthusiastic Developer from Front end to Back end, Web & Mobile development. Always want to contribute to community by different free projects.

FEATURED TAGS
algorithms angular codility git jasmine karma