JSFiddle

Mariusz's public fiddles

  • 1647xgfc

    No-Library (pure JS), HTML, CSS, JavaScript

  • Problem 2

    A labyrinth is represented as a rectangular grid with some cells containing zeros - free cells, and other cells containing ones - blocked cells. Is it possible to get from the upper left corner to the lower right corner by walking on the free cells? Moving from one cell to another is possible if they share a side and both of them are free. The first and the final (3) cells are guaranteed to be free.

  • Problem 1

    You are given a decimal number n as a string. Transform it into an array of numbers (given as strings again), such that each number has only one nonzero digit and their sum equals n. Each number in the output array should be written without any leading and trailing zeros. And the elements in the array should be sorted in descending order.

  • Fibonacci sequence

    Generating Fibonacci sequence