moserrya/knod
A Tiny HTTP server for your current directory
A robot is located at the top-left corner of a 5x5 grid. The robot can move either up, down, left, or right, but can not visit the same spot twice. The robot is trying to reach the bottom-right corner of the grid. How many unique possible paths can the robot take to reach the bottom right corner?
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
A Tiny HTTP server for your current directory
Public repository.
Tic-tac-toe, pitting you against the computer
This is a constant time solution to a shortest path problem that originally appeared in the ACM Programming Contest World Finals