This content outlines the process of converting modern numbers into ancient Roman numerals in C#. It describes the rules for conversion, provides a start-to-finish coding solution with testing, and explores the iterative process of refining the code for efficiency and readability. The final solution leverages recursion and LINQ, illustrating the elegance and power of C#... Continue reading →

This article discusses a coding challenge to create a phone number from an array of integers in C#. The solution uses string formatting, robust testing with NUnit, and extends to include internationalization and encoding/decoding features for phone numbers. The article details the implementation, testing, and challenges faced, providing valuable insights for software developers. Continue reading →

The post delves into exploring binary tree algorithms and data structures. The author develops a Climber class to find the maximum sum path from the root to a leaf in a binary tree, accompanied by thorough testing. The code is iteratively refined, highlighting the author’s testing-centric approach and commitment to effective refactoring. Continue reading →

Now for some F# hacking. The first thing I did was actually go through a Code Kata, which I’ll present here. The first step I took was to get a project started. For that I used the ProjectScaffold to build a clean project via bash. First cloned… git clone git@github.com:fsprojects/ProjectScaffold.git sharpKataStringCalc …then I … Continue reading →