The exercises include calculating factorials, generating Fibonacci sequences, displaying multiplication tables, finding squares using sums, and calculating powers without using Math.pow. To get ...

multiplication of size 2 by 2. And on the other hand complexity of bruteforce solution is O(n).