Daily-Coding-Problem | K5kC

Efficient Conversion Between Imperial Distance Units Problem

Determining the Existence of a Valid Secret Code in Mastermind Based on Given Guesses and Scores

Minimum Steps to reduce number to 1

Largest value path in a directed graph Problem

Implement rand5() using rand7()

Bishop diagonally attack on chess board problem

Shortest Uphill-Downhill Route for a Competitive Runner

Count Knight's Tour

Simulating an Unbiased Coin Toss Using a Biased Coin

Low bandwidth almost similar file syncing algorithm between two computers