Path Finder #2: shortest path, CodeWars Kata 자바 솔루션
Path Finder #2: shortest path, CodeWars Kata Path Finder #2: shortest path Task You are at position [0, 0] in maze NxN and you can only move in one of the four cardinal directions (i.e. North, East, South, West). Return the minimal number of steps to exit position [N-1, N-1] if it is possible to reach the exit from the starting position. Otherwise, return -1. Empty positions are marked .. Walls ..
Befunge Interpreter, CodeWars Kata 자바 솔루션
Befunge Interpreter, CodeWars Kata Befunge Interpreter Esoteric languages are pretty hard to program, but it's fairly interesting to write interpreters for them! Your task is to write a method which will interpret Befunge-93 code! Befunge-93 is a language in which the code is presented not as a series of instructions, but as instructions scattered on a 2D plane; your pointer starts at the top-le..