Articles

Ho-ho-ho! Today we are going to take a look at THE MOST IMPORTANT SORTING ALGORITHMS IN THE WORLD!!!!1 You know, it is really hard to underestimate sorting algorithms. They are that much important as the sorting hat in Hogwarts! So, we will start from the famous BogoSort! 1. Bogosort The algorithm consists of two steps: Shuffle the array Check if this permutation is sorted So, I always imagine that this algorithm like a clown who put all the permutations in the box....

Hello folks 👋 Glad to see you reading this article again! Today we’re gonna talk about problems in graphs. Let’s take a look at the problem below. Imagine we have an edge-weighted undirected graph consisting of a few nodes. Our target is to find a minimum spanning tree in this graph. Minimum spanning tree is an undirected subgraph that contains all the vertices without cycles and with a minimum edges weight....

Hello folks 👋 Another week has come and passed. It means that it is time for another article, yay! Do you remember the article about Fenwick tree? If don’t then, please, revisit it before starting with this one. During that article I mentioned an interesting data structure called Segment Tree. Unfortunately, I did not share any details about it. Note: also, there is another interesting data structure that can help us to achieve t_he same result....

Hey folks 👋 I know it has been a long time since we’ve published the last article. We are really sorry for this delay! Let us do not beat around the bush and jump straight to the discussion topic: pattern matching. Have you ever caught yourself wondering, “I have some text and I want to find a string in it. How can I do it?” Luckily, I have an answer for this question....

Pew-pew, subs! How are you doing? Have you missed me? Today we continue to observe tortoises and hairs from [the previous Solving Leetcode session.](https://algoclub.xyz/2022/01/30/solving-leetcode-141-linked-list-cycle/(opens in a new tab)) We’re gonna solve the problem #142 Linked List Cycle 2. Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer....