Mathematical Foundations
🌙 Rabin Karp The Rabin–Karp algorithm is a string-searching algorithm used to find a pattern inside a larger text. It’s especially useful when you…
🌙 Problem Statement: Given two strings a and b, return…
🌙 Problem Statement: Given two strings a and b, return…
🌙 Topological Sort It is a linear ordering of nodes of a DAG(Directed Acyclic Graph)…
🌙 Detect Cycle in Undirected Connected Graph Example: 1 True Example: 2 False Example: 3…
🌙 Problem Statement You are given a list of airline tickets where tickets[i] = [fromi,…
🌙 Problem Statement Given a directed acyclic graph (DAG) of n nodes labeled from 0…
🌙 Problem Statement There is a bi-directional graph with n vertices, where each vertex is…
🌙 Depth First Search (DFS) Example: 1 DFS: [0, 1, 3, 2, 4] Example: 2…
Explore
