JavaScript Taskbook Level 8.1
Given an array:
[
[1, 2, 3],
[1, 2],
[1, 2, 3, 4, 5],
[1],
[1, 2, 3, 4],
]
Sort the array elements in ascending order of the number of elements in the subarray.
Given an array:
[
[2, 4, 5],
[1, 2, 3],
[0, 1, 1],
[5, 7, 1],
]
Sort the array elements in ascending order of the sum of the subarray elements.
Display the following pyramid on the screen:
x
xx
xxx
xxxx
xxxxx
xx
xxx
xxxx
xxxxx
