/Recent content on Himanshu's BlogHugoen-us2026 HimanshuMon, 22 Apr 2024 00:00:00 +0000/posts/understanding-union-find/Mon, 22 Apr 2024 00:00:00 +0000/posts/understanding-union-find/<p>Union-Find (or Disjoint Set) is a data structure used to manage disjoint sets of elements through two primary operations: <strong>find(x)</strong> and <strong>union(A, B)</strong>. The find(x) operation determines which set the element <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>x</mi></mrow><annotation encoding="application/x-tex">x</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em;"></span><span class="mord mathnormal">x</span></span></span></span> belongs to, while the union(A, B, C) operation merges the sets <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>A</mi></mrow><annotation encoding="application/x-tex">A</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em;"></span><span class="mord mathnormal">A</span></span></span></span> and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>B</mi></mrow><annotation encoding="application/x-tex">B</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em;"></span><span class="mord mathnormal" style="margin-right:0.05017em;">B</span></span></span></span> into a single set <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi></mrow><annotation encoding="application/x-tex">C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em;"></span><span class="mord mathnormal" style="margin-right:0.07153em;">C</span></span></span></span>. In this article, we will explore Robert Endre Tarjan’s work on determining the upper bound of the time complexity for these Union-Find operations.</p>/posts/monads-for-software-engineers/Sat, 16 Mar 2024 00:00:00 +0000/posts/monads-for-software-engineers/<p><strong>The Problem:</strong></p> <ol> <li>To find square of a number and add one.</li> <li>Add logs to the see how the result is formed.</li> <li>Should be able to add more functions easily like multiplyThree.</li> <li>Functions defined should be composable in any order (we can multiplyThree before addOne or vice versa).</li> </ol> <p>We will solve this problem using a monad design pattern in a step by step thought process.</p>/about/Mon, 01 Jan 0001 00:00:00 +0000/about/About this blog