DEV Community: Qroia FAK(C)E

Codewars Challenge Day 5: JS, Python + SQL and PHP

Qroia FAK(C)E — Sat, 16 Jul 2022 10:25:17 +0000

JavaScript & Python

Details

Name Kata: Sum of Digits / Digital Root
6kuy
Description: Given n, take the sum of the digits of n. If that value has more than one digit, continue reducing in this way until a single-digit number is produced. The input will be a non-negative integer.
Example:

    16  -->  1 + 6 = 7
   942  -->  9 + 4 + 2 = 15  -->  1 + 5 = 6
132189  -->  1 + 3 + 2 + 1 + 8 + 9 = 24  -->  2 + 4 = 6
493193  -->  4 + 9 + 3 + 1 + 9 + 3 = 29  -->  2 + 9 = 11  -->  1 + 1 = 2

My Solutions

Python

def digital_root(n: int) -> int:
    n_str = str(n)
    while len(n_str) > 1:
        r = 0
        for i in range(len(n_str)):
            r = r + int(n_str[i])
        n_str = str(r)
    return n if (n >= 0 and len(str(n)) == 1) else r

JavaScript(TypeScript4)

export const digitalRoot = (n:number):number => {
    return String(n).length == 1 
      ? n : digitalRoot(
        String(n).split("").map((n) => Number(n)).reduce(
          (previousValue, currentValue) => previousValue + currentValue, 0)
      )
};

PHP

Details

Name Kata: You're a square!
7kuy
Description: You like building blocks. You especially like building blocks that are squares. And what you even like more, is to arrange them into a square of square building blocks!

However, sometimes, you can't arrange them into a square. Instead, you end up with an ordinary rectangle! Those blasted things! If you just had a way to know, whether you're currently working in vain… Wait! That's it! You just have to check if your number of building blocks is a perfect square.
Task

Given an integral number, determine if it's a square number:

In mathematics, a square number or perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself.

The tests will always use some integral number, so don't worry about that in dynamic typed languages.
Example:

-1  =>  false
 0  =>  true
 3  =>  false
 4  =>  true
25  =>  true
26  =>  false

My Solutions

function isSquare(int $n): bool {
  return sqrt($n) == (int)sqrt($n) ? true : false;
}

SQL

Details

Name Kata: SQL Basics: Truncating
7kuy
Description: Given the following table 'decimals':
decimals table schema

id
number1
number2

Return a table with a single column towardzero where the values are the result of number1 + number2 truncated towards zero.

My Solutions

SELECT TRUNC(number1 + number2) AS towardzero FROM decimals

Codewars Challenge Day 4: ROT13

Qroia FAK(C)E — Fri, 15 Jul 2022 16:56:13 +0000

Details

Name Kata: ROT13
5kuy
Description: How can you tell an extrovert from an introvert at NSA? Va gur ryringbef, gur rkgebireg ybbxf ng gur BGURE thl'f fubrf.

I found this joke on USENET, but the punchline is scrambled. Maybe you can decipher it? According to Wikipedia, ROT13 is frequently used to obfuscate jokes on USENET.

Hint: For this task you're only supposed to substitue characters. Not spaces, punctuation, numbers etc.
Example:

"EBG13 rknzcyr." -->
"ROT13 example."

"This is my first ROT13 excercise!" -->
"Guvf vf zl svefg EBG13 rkprepvfr!"

My Solutions

JavaScript

const rot13 = (str) => {
  return str.replace(/[a-z]/giu, (x) => {
    return String.fromCharCode(
      x.charCodeAt() + (
        x.toLowerCase() <= 'm' ? 13: -13
      ));
  });
}

Python

def rot13(message: str) -> str:
    rot13 = bytes.maketrans(
        b"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ",
        b"nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM"
    )
    return message.translate(rot13)

Codewars Challenge Day 3: Moving Zeros To The End

Qroia FAK(C)E — Thu, 14 Jul 2022 15:00:38 +0000

Details

Name Kata: Moving Zeros To The End
5kuy
Description:
Write an algorithm that takes an array and moves all of the zeros to the end, preserving the order of the other elements.
Example

moveZeros([false,1,0,1,2,0,1,3,"a"]) // returns[false,1,1,2,1,3,"a",0,0]

My Solutions

JavaScript

const moveZeros = (arr) => {
  if (arr[0]===0){arr.push(arr.splice(i, 1).pop())}
  for(var i=arr.length;i>0;i--){if(arr[i]===0){arr.push(arr.splice(i,1).pop())}}
  return arr
}

Python

from typing import List

def move_zeros(lst: List) -> List:
    return [x for x in lst if x != 0] + [x for x in lst if x == 0]

PHP

function moveZeros(array $items): array
{
    return array_pad(
      array_filter(
        $items, function($x) {return $x !== 0 and $x !== 0.0;}
      ), count($items), 
     0);
}

Codewars Challenge Day2: Break camelCase

Qroia FAK(C)E — Wed, 13 Jul 2022 18:03:01 +0000

Name Kata: Break camelCase / 6kuy

Details

Complete the solution so that the function will break up camel casing, using a space between words.

Example

'camelCase' -> 'camel Case'

My Solutions

JavaScript

const solution = (str) => { return str.split(/\s+|\_+|(?=[A-Z])/gm).join(' ') }

Python

def solution(string: str) -> str: res = '' for symbol in string: if symbol.upper() == symbol: res = res + ' ' + symbol else: res = res + symbol return res

Codewars Day #1, 5kuy

Name Kata

Pete, the baker

Details

Pete likes to bake some cakes. He has some recipes and ingredients. Unfortunately he is not good in maths. Can you help him to find out, how many cakes he could bake considering his recipes?

Write a function cakes(), which takes the recipe (object) and the available ingredients (also an object) and returns the maximum number of cakes Pete can bake (integer). For simplicity there are no units for the amounts (e.g. 1 lb of flour or 200 g of sugar are simply 1 or 200). Ingredients that are not present in the objects, can be considered as 0.

# must return 2
cakes({flour: 500, sugar: 200, eggs: 1}, {flour: 1200, sugar: 1200, eggs: 5, milk: 200})
# must return 0
cakes({apples: 3, flour: 300, sugar: 150, milk: 100, oil: 100}, {sugar: 500, flour: 2000, milk: 2000})

My Solutions

Python

from typing import List

def cakes(recipe: List[str], available: List[str]) -> int:
    try:
        return int(min([available[x] / recipe[x] for x in recipe]))
    except:
        return 0

JavaScript

const cakes = (recipe, available) => {
  var availableIngredients = []
  for(var key in recipe) {
    if (available[key] != undefined && available[key] / recipe[key] >= 1 ) {
      availableIngredients.push(available[key] / recipe[key])
    } else {
      return 0
    }
  }

  return ~~Math.min.apply(null, availableIngredients)
}

DEV Community: Qroia FAK(C)E

Codewars Challenge Day 5: JS, Python + SQL and PHP

JavaScript & Python

Details

My Solutions

Python

JavaScript(TypeScript4)

PHP

Details

My Solutions

SQL

Details

My Solutions

Codewars Challenge Day 4: ROT13

Details

My Solutions

JavaScript

Python

Codewars Challenge Day 3: Moving Zeros To The End

Details

My Solutions

JavaScript

Python

PHP

Codewars Challenge Day2: Break camelCase

Details

Example

My Solutions

JavaScript

Python

Codewars Day #1, 5kuy

Name Kata

Details

My Solutions

Python

JavaScript

V8 the best