Μετάβαση στο κύριο περιεχόμενο

Frontdead

Αναζήτηση αυτού του ιστολογίου

Books

Αυγούστου 28, 2018

Λήψη συνδέσμου
Facebook
X
Pinterest
Ηλεκτρονικό ταχυδρομείο
Άλλες εφαρμογές

A small collection of books... https://github.com/Ierofantis/frontdead_articles/tree/master/Books

Λήψη συνδέσμου
Facebook
X
Pinterest
Ηλεκτρονικό ταχυδρομείο
Άλλες εφαρμογές

Σχόλια

Δημοσίευση σχολίου

Δημοφιλείς αναρτήσεις

CodeWars 2

As I did on my previous post I will continue to show you some of my solution on various kata that I solved. Let's start: Count cubes in a Menger Sponge Task In this kata you will create a function that takes non negative integers (from 0 to n) and return the amount of cubes that the Menger Sponge would have in that specific iteration Example calc_ms(0) == 1 calc_ms(1) == 20 calc_ms(2) == 400 calc_ms(3) == 8000 calc_ms(4) == 160000 calc_ms(5) == 3200000 calc_ms(6) == 64000000 My solution was an online solution: function calc_ms(n) { return Math.pow(20,n) } Remove First and Last Character Task It's pretty straightforward. Your goal is to create a function that removes the first and last characters of a string. My solution: function removeChar(str){ if(str.length<=2){ return str} else{ var sub = str.slice(1, -1); return sub; }; }; Count the smiley faces! Task Given an array (arr) as an argument complete the function countSmileys t...

Code Wars: Recreate One

In this algorithm we have to take 2 integers and in this range (ex. 1,42) we want to find the sum of squared divisors is itselfs a square like 42. The result will be an array of arrays and each subarray will have the number whose square divisors is a square and then the sum of the squared divisors. My approach was to create a basic function(the constructors) that iterates within the rage and then to create a method that finds the sum of a squared divisor like the one below. function sumDivisors(num) { var sum = 0; var arr = []; for (var i = 1; i <= num; i++) { if (!(num % i)) { sum += i * i; } } return sum; } and after on my init function i iterate through the range of the given numbers to find the sum of squared divisors that are itself a square and then print the result as an array function listSquared(m, n) { var arr = []; for (var i = m; i <= n; i++) { var ns = Math.sqrt(sumDivisors(i)); if (Number.isInteger(ns)) { var newArr = [i, ns * ns]; ar...

Από το Blogger

Frontdead