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…
🌙 Heap Sort Algorithm arr = [4, 10, 3, 5, 1] No Extra Space: O(1)…
🌙 Heap Sort Algorithm Create a Max Heap from unsorted-arr: [10, 5, 3, 4, 1]…
🌙 Array Representation of Heap Min Heap: Insert 1 Add the element at the end.…
🌙 Array representation of Heap: We are using array’s to represent heap. We can also…
🌙 Complete Binary Tree: A Complete Binary Tree is one in which, during level order…
Binary Search Tree: BST is a special type of Binary Tree with atmost 2 childern.…
Explore
