Data Structures & Algorithms · 10

2026-02-21 — Boyer-Moore String Search: Finding Substrings with Adaptive Jumps What is Boyer-Moore String Search? it finds the first occurrence of a pattern in… 2024-09-22 — Linked List Notebook WIP … famous cycle detection algo — Floyd’s Tortoise and Hare here! Singlely… 2024-09-10 — Greedy Algorithm: Optimal Solutions for Local Decisions What is the Greedy Approach? A greedy algorithm is a type of algorithmic… 2024-09-07 — Boyer-Moore Voting Algorithm: Finding the Majority Element What is Boyer-Moore Voting Algorithm? The Boyer-Moore Voting Algorithm is a… 2024-08-29 — Data Structure Notebook Union Find (DSU) Union-Find, also known as Disjoint Set Union (DSU), is a data… 2024-05-22 — Euclidean Algorithm: Finding the Greatest Common Divisor (GCD) What is Euclidean Algorithm? The Euclidean Algorithm is a straightforward and… 2024-05-19 — Dijkstra's Algorithm: Efficient Shortest Path Finding in Graphs What is Dijkstra’s Algorithm? Dijkstra’s Algorithm is a well-known algorithm… 2024-05-19 — Floyd-Warshall Algorithm: Comprehensive Guide to All-Pairs Shortest Paths What is Floyd-Warshall Algorithm? The Floyd-Warshall algorithm is a dynamic… 2024-05-19 — Floyd's Tortoise and Hare Algorithm: Efficient Cycle Detection What is Floyd’s Tortoise and Hare Algorithm? Floyd’s Tortoise and Hare… 2024-05-09 — Manacher's Algorithm: Fast and Efficient Palindrome Detection i have written a blog to talk deeper about Big-O in my own words here. Note for…