Skip to content

Instantly share code, notes, and snippets.

View adicuco's full-sized avatar

Adi Cucolaș adicuco

View GitHub Profile
04418448768b2d7b786a2955d72a9cd07480553831d04ddfb5e2a14983b495cee40d4cd3a39422e20e03708db2b45dd101fa0403e0d9004760285ae03c655dd38e
@adicuco
adicuco / array_pairs.js
Last active March 21, 2018 11:33
Write an algorithm that counts the number of pairs (not necessary adjacent) in an array, where the first value is 0 and the second is 1. The result for the array [1, -2, 0, 1, -2, 1, 0, 1, 1, -5] should be 6.
var count = 0;
var b = [1, -2, 0, 1, -2, 1, 0, 1, 1, -5];
var s = [];
b.forEach(element => {
if (element === 0) {
s.push(0);
} else if (element === 1) {
s.forEach(e => count++);
}
{
"facebook": {
"text": "Do you want to order?",
"quick_replies": [{
"content_type": "text",
"title": "Yes",
"payload": "I want to order",
"image_url": ""
},
{
@adicuco
adicuco / MissingInteger.js
Last active October 5, 2022 17:05
100% solution for Missing Integer Task on Codility
function solution(A) {
var max = 0;
var array = [];
for (var i = 0; i < A.length; i++) {
if (A[i] > 0) {
if (A[i] > max) {
max = A[i];
}
array[A[i]] = 0;
@adicuco
adicuco / BinaryGap.js
Created June 15, 2018 11:58
100% solution for BinaryGap Task on Codility
function solution(N) {
var n = N.toString(2);
var max = 0;
var array = [];
for (var i = 0; i < n.length; i++) {
if (n[i] === "1") array.push(i);
}
@adicuco
adicuco / CyclicRotation.js
Created June 15, 2018 13:34
solution for Cyclic Rotation Task on Codility
function solution(A, K) {
if (A.length == 0) return A;
var B = [];
B[0] = A[A.length - 1];
for (var i = 0; i < A.length - 1; i++) {
B[i + 1] = A[i];
}
@adicuco
adicuco / OddOccurrencesInArray.js
Created June 15, 2018 14:35
solution for Odd Occurrences in Array Task on Codility
function solution(A) {
var B = [];
var max = 0;
for (var i = 0; i < A.length; i++) {
if (typeof B[A[i]] === "undefined") {
B[A[i]] = 0;
if (A[i] > max) max = A[i];
}
B[A[i]]++;
@adicuco
adicuco / FrogJmp.js
Created June 15, 2018 16:12
100% solution for Frog Jumps Task on Codility
function solution(X, Y, D) {
var jumps = Math.round((Y - X) / D);
if (jumps * D + X >= Y) return jumps;
else return jumps + 1;
}
@adicuco
adicuco / PermMissingElem.js
Created June 15, 2018 16:51
100% solution for Permutation Missing Element on Codility
function solution(A) {
if (A.length == 0) return 1;
var min = 100000;
var max = 0;
var B = [];
for (var i = 0; i < A.length; i++) {
B[A[i]] = 0;
if (A[i] > max) max = A[i];
if (A[i] < min) min = A[i];
@adicuco
adicuco / TapeEquilibrium.js
Created June 15, 2018 17:34
100% solution for Tape Equilibrium Task on Codility
function solution(A) {
var min = 99999999999;
var total = 0;
for (var i = 0; i < A.length; i++) {
total += A[i];
}
var sum = 0;
for (var j = 0; j < A.length - 1; j++) {