Hello, algorithms people!

Thank you for your interest in my Algorithmic Thinking book. I hope you're enjoying your learning journey. Thank you to the many of you providing feedback and engaging with me on the 2nd edition!

Sending newsletters: err, yeah, I'm bad at this. One newsletter a year seems to be what I can manage :D

New Competitive Programming Book

You know how Algorithmic Thinking uses those competitive programming problems to teach programming? With the automated correct/incorrect feedback and all that good stuff?

If you like that approach, you might be interested in the new book that my colleague and I self-published.

We wrote this book to help improve people's programming and problem-solving. Why? Because that's what employers want to see at your next programming interview.

Yep... self-publishing... what an adventure!

You can learn about why we are self-publishing if you're interested!

My favourite aspect is that we can make updates whenever we want (we just made our 2024 update to the book, for example!).

If anyone has questions about the process, like maybe you've been considering self-publishing a book :), I'd be happy to try to help.

And since you read this far...

One other thing self-publishing lets us do is control pricing.

We are giving away five free copies of the book to readers of my newsletter.

If you miss that one, here's 20 percent off the book -- publishers just can't match this! for the next day or two.

We also have the book on Amazon, in ebook and paperback.

We'd appreciate your (optional, of course!) help reviewing the book on Amazon or spreading the word -- we're learning that people don't just "learn" about self-published books :D so we're really trying to get this one off the ground.

Until Next Time

Keep learning... keep coding!

Please do be in touch. Communicating with readers is easily the most meaningful part of all of this! I'm behind my new competitive programming book just as strongly as my traditionally published books -- please don't hesitate to reach out!

Thank you,
Dan