I was playing around with solving the Dyalog challenge, and I found them pretty easy with the exception of one.
The goal was to write a lambda function that given a single integer, returns a list of the Fibonacci series up to that number.
The only way I can think of solving it is by using a full function and a loop. That can't possibly be the easiest way.
Any suggestions?
Regards,
Elias