LeetCode Practice in C#
Jun 19, 2025
·
1 min read
A growing collection of algorithm and data-structure solutions written the way production code should be: documented, tested, and measured.
Structure
| Project | Purpose |
|---|---|
Problems | Solutions with XML documentation, often with more than one approach per problem |
Tests | xUnit tests covering every solution (dotnet test) |
Runner | Console app for ad-hoc experiments |
Benchmarks | BenchmarkDotNet comparisons of alternative implementations |
Problems covered so far focus on arrays and strings, including Two Sum, Remove Duplicates from Sorted Array, Merge Sorted Array, Product of Array Except Self, and Increasing Triplet Subsequence.
What it demonstrates
Algorithmic problem solving in C#, test-first habits, and using benchmarks rather than intuition to compare approaches.
Authors
Quantitative Analyst & Python/.NET Engineer
Quantitative analyst and .NET/Python engineer at Onward Energy in Denver. I build forecasting models,
market-data platforms, and the MLOps and CI/CD that keep them honest, backed by an M.S. in Data Analytics
(AI & ML, 4.0 GPA) and a decade of SQL Server, analytics, and full-stack work.