DEV Community: G33kNoob

codewar day3

G33kNoob — Mon, 03 Aug 2020 16:07:39 +0000

today the problem like this :
Your task is to make a function that can take any non-negative integer as a argument and return it with its digits in descending order. Essentially, rearrange the digits to create the highest possible number.

Examples:
Input: 42145 Output: 54421

Input: 145263 Output: 654321

Input: 123456789 Output: 987654321

then my solve :

const sortnumber = n => {
  let data = parseInt(
    n
      .toString()
      .split("")
      .sort()
      .reverse()
      .join()
      .replace(/,/g, "")
  );
  return data;
};

i use some string, number and array prototype i learn a lot from developer.mozilla.org
i learning how the faster solve the problem, solve it with 'logic', then find how to cooding it :)
thanks codewar and mozilla developer

anyway other sorter solving like this

function descendingOrder(n){
  return +(n+'').split('').sort().reverse().join('')
}

Codewar Day2

G33kNoob — Sun, 02 Aug 2020 14:27:40 +0000

i rest some day because i got busy with ied adha, now i try solve a litle problem
the question :
Trolls are attacking your comment section!

A common way to deal with this situation is to remove all of the vowels from the trolls' comments, neutralizing the threat.

Your task is to write a function that takes a string and return a new string with all vowels removed.

For example, the string "This website is for losers LOL!" would become "Ths wbst s fr lsrs LL!".

Note: for this kata y isn't considered a vowel._

my solving :

const disemvowel = data => {
  let regex = /[aiueoAIUEO]/g;
  return data.replace(regex, "");
};

the popular solving

disemvowel = str => str.replace(/[aeiou]/gi,'');

Codewar day 1

G33kNoob — Wed, 29 Jul 2020 16:48:47 +0000

today i challenge my self to solve minimum 1 codewar challenge everyday. ok lets start the first day!!

the problem :
Your goal in this kata is to implement a difference function, which subtracts one list from another and returns the result.

It should remove all values from list a, which are present in list b.

arrayDiff([1,2],[1]) == [2]

If a value is present in b, all of its occurrences must be removed from the other:

arrayDiff([1,2,2,2,3],[2]) == [1,3]

my solving :

const arrayDiff = (a, b) => {
  let arr = a;
  let filterarray = b.forEach((item, i) => {
    let n = item;
    let resultfilter = arr.filter(value => {
      return value !== n;
    });
    arr = resultfilter;
    return resultfilter;
  });
  return arr;
};

i know the solving is not good as other. but its worked haha :D
after solving this, i read the most popular answer , and this is the result :

function array_diff(a, b) {
  return a.filter(e => !b.includes(e));
}

im never hear "includes array function", now i must learn again to get more refference.

i think array.prototype.includes is very fun to usefull, hope i can use it next time

this week target

G33kNoob — Mon, 20 Jul 2020 06:00:30 +0000

learning tailwind + nuxt + purgecss
https://tailwindcss.id/roadmap/
https://medium.com/@mhdnauvalazhar/mempelajari-tailwindcss-dalam-30-menit-673742056e0c

learning codewar
1 katas perday

javascript functional

array.reduce, map & filter

My first codewar solved

G33kNoob — Mon, 29 Jun 2020 17:30:52 +0000

the Question :
You are going to be given a word. Your job is to return the middle character of the word. If the word's length is odd, return the middle character. If the word's length is even, return the middle 2 characters.

Examples:

Kata.getMiddle("test") should return "es"

Kata.getMiddle("testing") should return "t"

Kata.getMiddle("middle") should return "dd"

Kata.getMiddle("A") should return "A"

Input

A word (string) of length 0 < str < 1000 (In javascript you may get slightly more than 1000 in some test cases due to an error in the test cases). You do not need to test for this. This is only here to tell you that you do not need to worry about your solution timing out.

Output

The middle character(s) of the word represented as a string.

my solving :
function getMiddle(s) {
var length = s.length;
var middle = length / 2;
let floor = Math.floor(middle);
const middleNumber = Number(middle);
const floorNumber = Number(floor);
const mathNumber = middleNumber - floorNumber;
if (mathNumber > 0) {
let finalMiddle = s[floorNumber];
return finalMiddle;
} else {
let finalMiddle1 = s[floorNumber - 1];
let finalMiddle2 = s[floorNumber];
return finalMiddle1 + finalMiddle2;
}
}

ofcourse i know my solving is not to the point but im really happy to solve this

anyone can recomended me where the very basic code challenge?

G33kNoob — Mon, 29 Jun 2020 16:44:51 +0000

anyone can recomended me where the very basic code challenge? i have tried codewar, in basic mode, for me still can't solve it