3a964f61f920385b5645f3772741a895503c978a
https://www.codewars.com/kata/576b93db1129fcf2200001e6 Sum all the numbers of a given array ( cq. list ), except the highest and the lowest element ( by value, not by index! ).The highest or lowest element respectively is a single element at each edge, even if there are more than one with the same value.Mind the input validation.
learn algorithms
I will be studying algorithms and collecting different cases to improve my knowledge on this repository.
Description
Languages
HTML
76.8%
TypeScript
16%
JavaScript
4.6%
CSS
2.6%