Mostrar los tags: recursivo

deep_flatten([[[1],2],3,[4,5]])              # [1, 2, 3, 4, 5]

deep_flatten([1, [2], [[3], 4], 5])          # [1, 2, 3, 4, 5]

deep_flatten([1, 2, 3])                      # [1, 2, 3]

deep_flatten([[1], [], 2, [3,[4, 5, 6]], 7]) # [1, 2, 3, 4, 5, 6, 7]

deep_flatten([[[], []], []])                 # []

deep_flatten([1, [[], []], []])              # [1]

array_flat([1, 2, 3]); // [1, 2, 3]

array_flat([[1], [], 2, [3,[4, 5, 6]], 7]); // [1, 2, 3, 4, 5, 6, 7]

array_flat([[[], []], []]); // []

array_flat([1, [[], []], []]); // [1]

clean_string('abc#d##c') # "ac"

clean_string('#######') # ""

clean_string('abc##d######') # ""

clean_string('#') # ""

permutator([1,2,3]); // [1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]

<div id="myId">

    <p>

        <span>a</span>

        <a href="https://lawebdelprogramador.com">https://lawebdelprogramador.com</a>

    </p>

    <p>b</p>

</div>

[p, span, a, p]

tickets([25, 25, 50]); // => YES

tickets([25, 100]); // => NO

tickets([25, 25, 50, 50, 100]); // => NO

tickets([25, 25, 50, 50, 25, 100]); // => YES

tickets([50, 25, 25]); // => NO

tickets([100, 25, 25]); // => NO

digital_root(16)

// 1 + 6

// 7

digital_root(942)

// 9 + 4 + 2

// 15 ...

// 1 + 5

// 6

digital_root(493193)

// 4 + 9 + 3 + 1 + 9 + 3

// 29 ...

// 2 + 9

// 11 ...

// 1 + 1

// 2