JavaScript
🌙 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…
🌙 Counting Sort (Stable) Code Time Complexity O(n + k) where k: range. if k
🌙 Counting Sort Counting Sort is a non-comparison based sorting algorithm. It works by counting…
🌙 Quick Sort (Divide and Conquer) [8, 3, 1, 7, 0, 10, 2] [1, 0,…
🌙 Problem Statement: A trie (pronounced as “try”) or prefix tree is a tree data…
🌙 Time & Space Complexity in Tries Time Complexity Insert: O(n) where n: no. of…
🌙 Trie Node Structure Code: class TrieNode { constructor() { this.children = {}; this.isEndOfWord =…
Explore
