Algorithms
🌙 Problem Statement: Given a string s, rearrange the characters of s so that any two adjacent characters are not the same. Return any…
🌙 Problem Statement: The count-and-say sequence is a sequence of…
🌙 Problem Statement: Given an encoded string, return its decoded…
🌙 Radix Sort Radix sort is a non-comparison sorting algorithm. Instead of comparing elements directly,…
🌙 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…
Explore
