Thanks for your encouraging words Kaeland. I hope to write more posts for this series so stay tuned.

Thanks! Helping others is what makes me write these articles. I'm glad you had enjoyed the series so far. Stay tuned!

Nice addition Mario, as always! Actually, I wanted to remove some graph-related examples and to add other examples. I think talking about maximal matching is going too far :) But you are definitely right! And the other strategy seems good. I just don't know whether it yields a constant-factor approximation. I'd like to think about it and prove it/disprove it.

Thank you so much Apoorv Tyagi . I'm very happy you like it. I'm going to keep those coming, as long as I feel at least one person is enjoying them. From the bottom of my heart: Thank You!!!