Recently, I found some of the most interesting problems I've solved in a long time. I wrote a post sharing my solutions. Please take a look here.

The problem is this one. In case you want to give it a try before reading my solution.

I strongly suggest you try this problem. Let me know how it goes.

Have a great day,

Alberto.

I write weekly posts on computer science topics on my blog. Currently, I'm looking for collaborators who want to share their own take on any issue related to algorithms, data structures, software development, artificial intelligence, etc.

If you want to take a look at an example post to get a more grounded feeling of what this blog is about, please do so here:

• Home page
• Latest issue
• Collab on Binary Search
• Collab on Developing a Competitive Mindset in CS students

If anything of the above sounds enticing, please reach out.

Update: Thanks for reaching out. To collect all your proposals in one source, please contact me at [email protected].

Have a great day,

Alberto

Would you like to know what Uber, Google Maps, and your favorite airline have in common?

They all know how to solve the Connectivity Problem.

This post is the third (and last) of the introductory series in my upcoming book, The Competitive Programmer Graphs Handbook.

Take a look at the post to understand the foundations of graph traversals and connected components before we dive into more complex topics in future editions.

Enjoy.

https://albexl.substack.com/p/the-connectivity-problem

My upcoming book covers three major topics in graph theory: bipartite graphs, functional graphs, and Euler paths.

For you to fully understand those topics, we need to cover some basics first. Here is an article reflecting some of the content I shared in the Fundamental Definitions chapter of the book.

If you find this post beneficial, please consider sharing it with your network. Together, we can expand our knowledge and strengthen our community.

Have a great day,

Alberto

Hello there!

The Competitive Programmer Graphs Handbook has been updated since its announcement post.

Getting early access to the book is a unique opportunity that provides you with a set of exclusive benefits:

• Lifetime access to all the updates.
• Fully functional implementations of all the proposed problems.
• A private Discord channel available exclusively for early-access purchasers. Here, you can ask questions about the book, get help with your assignments, and share your feedback. It's an excellent opportunity to interact with other readers and the author (me), enhancing your learning experience.

Read all the details in the announcement post.

I've just penned a post on Mathematical Induction, focusing on its practical application in graph theory to prove theorems and propositions, making it more than just a theoretical concept.

In this post, I'll introduce a fundamental proposition of graph theory and guide you through its proof. Rest assured, the content is designed to be easily understood by all, regardless of your experience in proving theorems in mathematics.

Whether you are a math connoisseur or a total newb to the field, I think you will benefit tremendously from today’s discussion. This example shows why people like me invest a considerable part of their lives diving deeper and deeper into science, specifically looking at the intersection of math and computer science and how these principles can be applied in real-world scenarios.

If you're interested in delving deeper, you can find the full post here. I'm eager to hear your thoughts on this topic. Thank you for your time and interest.

Over a year ago, I created a blog about algorithms, covering data structures, graphs, and dynamic programming, to get people interested in Computer Science and Software Engineering. With 1200+ subscribers and 26 articles later, I decided to share it with the Codeforces community, where I honed my problem-solving skills. This platform certainly played a fundamental part in my Competitive Programming journey, leading to my participation in two ICPC World Finals (Porto 2019, Moscow 2020), where I achieved decent results.

This post is a call for readers and collaborators. If you share a passion for algorithms, problem-solving, crafting software, or even more theoretical and philosophical topics in Computer Science, I invite you to join me on this journey. My blog covers a wide range of topics, from data structures and graphs to dynamic programming, and I'm open to exploring new areas based on your interests. I want to share this journey with you, who were my rivals, friends, and family during my Competitive Programming years.

If any of the above resonates with you, please look at the blog and let me know. Please share your feedback in the comments below, and let me know if there is any particular topic you would like me to cover in detail or that you would like us to collaborate on.

Thank you for your support and for being part of this journey! I am truly excited about the potential collaborations and your valuable feedback. I look forward to our future work together. Have a great day!

Alberto

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

By publishing this book publicly and updating it based on your early feedback, I'm offering you a unique opportunity to be part of the entire process. Your support will give you early access to the ebook at a discounted price, lifetime access to all versions and future editions, and a chance to shape the evolution of this book. Let's embark on this exciting journey into graph theory together! For more details, check out the post.

Update. Here is the list of the topics published so far.

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