DIY - Paths, Connectivity, and Trees

DIY #1: Test your knowledge of the basics of graph theory.

Hello there!

Welcome to Algorithmically Speaking, where we discuss topics on the intersection of Computer Science, Software Engineering, and life.

Today’s topic is more interactive. It is the first in a series designed to test your knowledge about the issues we discuss in this newsletter.

This one mainly focuses on the basic definitions of graph theory that we discussed over the previous weeks. If you feel like you need a refresher on those topics, please go back and read this post:

Paths, Connectivity, and Trees

I wish you good luck on the challenges presented below. Let me know which was your favorite.

Also, there’s a bonus section at the end of this post for paid subscribers. Don’t miss it.

---

Problem #1

Problem #2

Problem #3

Problem #4

Problem #5

Problem #6

Problem #7

Problem #8

---

And that’s it for today! If you are finding this newsletter valuable, consider doing any of these:

1) ✉️ Subscribe to the newsletter — if you aren’t already, consider becoming a free or paid subscriber.

2) 💛 Get early access to my book— thanks to all of you who have contributed to support my writing. The book I'm writing covers this and similar topics in more depth.

3) 🍻 Read with your friends — this newsletter grows because readers share. I don’t use social media too much to advertise my writing. I’m counting on you!

Have a great day! ☀️

Alberto

---

Bonus Section For Paid Subscribers

This section is only available for you who financially support this newsletter. Thanks for making this project possible.