Check if a string is palindrome

Just built-in operations are needed in this case.


Project Euler #1

Sum all multiples of 3 or 5 below 1000. Original problem

0 1..999[;;3//0=%5//0=|[+][,]??].>

Factorial recursive

This snippet computes factorial of 6 by using recursion.

6[;0=[,1][;1- 1[]!*]??]!^

Fibonacci iterative

Print Fibonacci numbers. Stops after the founding the first that is greater than 10000.

1 1[;10000<][;<#+^]<>