Tech Articles
Explore deep-dives, coding tutorials, and tech insights from the community.
Euclidean algorithm for computing the greatest common divisor¶ Given two non-negative integers $a$ and $b$ , we have to find their GCD (greatest common...
Binary Exponentiation¶ Binary exponentiation (also known as exponentiation by squaring) is a trick which allows to calculate $a^n$ , where $n$ is a non-...
Disjoint Set Union¶ This article discusses the data structure Disjoint Set Union or DSU. Often it is also called Union Find because of its two main operations....
Sparse Table¶ Sparse Table is a data structure, that allows answering range queries. It can answer most range queries in $O(\log n)$ , but its true power is...
Floyd-Warshall Algorithm¶ Given a directed or an undirected weighted graph $G$ with $n$ vertices. The task is to find the length of the shortest path ...
You are given a directed or undirected weighted graph with $n$ vertices and $m$ edges. The weights of all edges are non-negative. You are also given a s...
Breadth-first search¶ Breadth first search is one of the basic and essential searching algorithms on graphs. As a result of how the algorithm works, the pat...
Depth First Search¶ Depth First Search is one of the main graph algorithms. Depth First Search finds the lexicographical first path in the graph from a sour...