Usefull video about BWT decode algorithm https://www.youtube.com/watch?v=0qMGAsrYS0g

Same problem with decode - SEGV. Didn't check for an empty string.

max_value for range is called only once

check it:

def calc_max():
    print('calc_max called')
    return 3

for i in range(0, calc_max()):
    print(i)

#calc_max called
#0
#1
#2

Nice! I have same think

@meditatingCybermind what do you think about .fill(1)and [...Array(n).keys()] ?

What is more performancy - list() or [for in]?

If Tree Hell?

yourPoints is not used in the average calculation. It's ok?

it's genius!

Thanks a lot for the explanation! This kata is a good test of knowledge of the arrow function syntax.
My problem was that I added extra brackets to the body of the arrow function. Because of this, my arrow function always returned undefined. Now I have a better understanding of the arrow function syntax.

Probably I not correct understand phrase "the curly braces inside the reduce and the return statement".

For solve kata: if you use brackets for function body, then you must add return.
Unfortunately, without return, you will not pass test cases. Although a return is not required for an arrow function.

Is two loops on in one string - best practice?

Description:

maxTriSum ({3,2,6,8,2,3}) ==> return (17)
As the triplet that maximize the sum {6,8,3} in order , their sum is (17)

Question:
Why result triplet skiped duplication number 2, but contained duplications of number 3?

Why are you use toFixed(10) ?