Hey everyone, I'm thrilled to share with you my upcoming book on graph theory! As a former Competitive Programmer, graph theory has been one of my favorite topics, and I've curated a collection of problems to help you dive into this fascinating subject.

I'll publish this book publicly and update it based on early feedback from readers so you can be a part of the entire process. I'd love your support if you're interested in getting early access to the ebook at a discounted price and lifetime access to all versions and future editions. Let's embark on this exciting journey into graph theory together! For more details, you can check out the post.

I recently ended up my career as an eligible ICPC contestant. I realized that I have participated in a lot of codeforces's Gym contests in order to train for ICPC contests.

At the beginning of training in the Gym, neither me or my teammates were able to see the submissions for problems we hadn't solve yet. I remember it was difficult to find editorials for some of the contests present in the Gym also. So, here is a repository (https://github.com/albexl/codeforces-gym-submissions) with all the contests that I (together with my teammates) participated in.

For those who want to consult some solution and still have no gym privileges feel free to use it.

I suppose there should be other ways to see submissions from the Gym. But I'm happy that I can, at least, give one extra alternative.

Where can I find problems related to finding the minimum enclosing circle of a set of points? Thanks in advance

Can someone help me solve this problem? Given N <= 16 strings I need to find the shortest(in length) string that contains all N strings as a substring, in case of a tie I need to find the smallest one in lexicographic order. Thanks in advance