Today’s exercise was giving change in the minimum number of coins. My recursive approach was working well until it gets to change of 999. This causes the search space to explode and time out. I got it running in less[…]↓ Read the rest of this entry…
100 Days of Code 2025
Todays exercise was to build a tree out of some records. I am not sure my code is better than the code I was supposed to replace but it looks better to me. A whole lot of unspecified conditions on[…]↓ Read the rest of this entry…
Today’s exercise was food chain but it was really just programmatically recreating the “I know an old lady who swallowed a fly” song. I’m not going to bother with an image today. The output looks exactly the same. I did[…]↓ Read the rest of this entry…
Today’s exercise is flower-field. This is the one they replaced minesweeper with because they were triggered by reality and can’t understand that play lets you learn to face bad things in a normal healthy manner. It is pandering not sensitivity.[…]↓ Read the rest of this entry…
Today’s exercise was Crypto Square. Given some text make it lower case, remove everything that is punctuation or white space then chop it up into blocks making it roughly square shaped. Then take those blocks and glue the nth character[…]↓ Read the rest of this entry…
Today’s exercise was Matrix. You load a table of integers from file and return a given row or column. Last night I put in a bunch of work and I think I got DIM/arrays working (no REDIM). I think I[…]↓ Read the rest of this entry…
Today’s exercise was super easy, barely an inconvenience. Just list some actions based on bit flags. Only tricky part was the reverse which I just did manually. One again I unsuccessfully tried to take it easy on myself by just[…]↓ Read the rest of this entry…
Have you ever done a problem then checked other people solutions to see they did in a much better and easier to understand way. Well that happened to me today. For the exercise Anagram (check if two words are different[…]↓ Read the rest of this entry…
Today’s exercise was the Sieve of Eratosthenes. You find prime numbers by filtering out numbers that are a multiple other primes (>= 2). I worked on refactoring the IF statement today. I broke it up into if, elseif, else, and[…]↓ Read the rest of this entry…
Today’s exercise was Parallel Letter Frequency. Get the frequency of letters in a bunch of strings, but in Parallel. I thought I was good with a Parallel.ForEach but everyone else used a .AsParallel() LINQ query. I decided I was far[…]↓ Read the rest of this entry…








