Welcome, brave coder!
We have a challenge for you! In this subpage, we will test your wits with a series of increasingly difficult coding puzzles.
// Write a function that takes a 2D array as input and returns the longest path from the top-left corner to the bottom-right corner.
// The function should work for any size of 2D array, not just 3x3.
// The array should contain only 0s and 1s.
// The function should return the longest path found, which will be an array of coordinates.
Good luck! You'll need it.