Java
🌙 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 a string s, rearrange the characters…
🌙 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…
🌙 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…
🌙 Breadth First Search (BFS) Example: 1 BFS: [0, 1, 2, 3, 4] Example: 2…
🌙 Graphs A graph is a data structure that helps us represent relationships or connection…
Explore
