Data Structures & Algorithms · 9

— Linked List Notebook WIP … Singlely Linked List Understanding pointer Fantastic question — this is… — Greedy Algorithm: Optimal Solutions for Local Decisions What is the Greedy Approach? A greedy algorithm is a type of algorithmic… — Boyer-Moore Voting Algorithm: Finding the Majority Element What is Boyer-Moore Voting Algorithm? The Boyer-Moore Voting Algorithm is a… — Data Structure Notebook Union Find (DSU) Union-Find, also known as Disjoint Set Union (DSU), is a data… — Euclidean Algorithm: Finding the Greatest Common Divisor (GCD) What is Euclidean Algorithm? The Euclidean Algorithm is a straightforward and… — Dijkstra's Algorithm: Efficient Shortest Path Finding in Graphs What is Dijkstra’s Algorithm? Dijkstra’s Algorithm is a well-known algorithm… — Floyd-Warshall Algorithm: Comprehensive Guide to All-Pairs Shortest Paths What is Floyd-Warshall Algorithm? The Floyd-Warshall algorithm is a dynamic… — Floyd's Tortoise and Hare Algorithm: Efficient Cycle Detection What is Floyd’s Tortoise and Hare Algorithm? Floyd’s Tortoise and Hare… — Manacher's Algorithm: Fast and Efficient Palindrome Detection Note for myself add special char just to partition them for expansion e.g. # →…