Discussion on: Daily Coding Puzzles - Oct 29th - Nov 2nd

[Ali Spittel]

Tuesday

Ones and Zeros (7 KYU):

Given an array of one's and zero's convert the equivalent binary value to an integer.

link

[Sung M. Kim]

Here is a C# version

Note: Aggregate is equivalent to reduce in JavaScript or other languages
and seed value is the first argument unlike in JavaScript, in which it's the last argument.

using System;
using System.Linq;
namespace Solution
{
    class Kata
    {
        public static int binaryArrayToNumber(int[] a)
        {
            return Convert.ToInt32(a.Aggregate("", (acc, n) => acc + n.ToString()), 2);
        }
    }
}

[Kasey Speakman]

F#

Edit: shortened

let update value (sum, mult) =
    sum + (value * mult), mult * 2

// usage, processes array right to left
let (sum, _) = Array.foldBack update inputArr (0,1)

[E. Choroba]

#! /usr/bin/perl
use warnings;
use strict;

sub bin2int {
    my ($i, $r);
    $r += 2 ** $i++ * pop while @_;
    return $r
}

use Test::More tests => 9;
is bin2int(0, 0, 0, 1), 1;
is bin2int(0, 0, 1, 0), 2;
is bin2int(0, 1, 0, 1), 5;
is bin2int(1, 0, 0, 1), 9;
is bin2int(0, 0, 1, 0), 2;
is bin2int(0, 1, 1, 0), 6;
is bin2int(1, 1, 1, 1), 15;
is bin2int(1, 0, 1, 1), 11;
is bin2int((1) x 20), 2 ** 20 - 1;

[Ali Spittel]

My Python solution:

def binary_array_to_number(arr):
    return int(''.join(str(i) for i in arr), 2)

[Ferenc Bodon]

Q/kdb+ solution (let l be the input list):

with list multiplication:

sum l * 2 xexp reverse til count l

with adverb over:

{y + 2*x} over l

[Guillaume Martigny]

Plain JS:

function arrayToInt (arr) {
  return Number.parseInt(arr.join(""), 2);
}

[Courtney]

const binaryArrayToNumber = arr => {
  return parseInt(arr.join(''), 2);
};