DSA
Covers: Brute Force, Optimal. Optimal — Time O(N).
Covers: Using dummy node, Approach2: Recursive Merge. Optimal — Time O(m+n), Space O(m+n).
Covers: Extra Space (Naive), Two Pointers from End (Optim…, Gap Method (Shell Sort idea). Optimal — Space O(m + n).
Optimal approach. Optimal — Time O(n), Space O(1).
Arrays. Time O(n), Space O(1).
Covers: Naive, Two Pointer. Optimal — Time O(n+m), Space O(1).
Covers: Brute Force, Two Pointer. Optimal — Time O(n), Space O(1).
Covers: Brute Force: Linear Search, Binary Search. Optimal — Time O(log n), Space O(1).
Covers: Brute Force: Sorting, Store freq of 0s, 1s and 2s, Dutch National Flag Algo. Optimal — Time O(n), Space O(1).
Covers: Brute Force, Optimal. Optimal — Time O(n), Space O(n).
Covers: Brute Force: hashset, Optimal. Optimal — Time O(n + m), Space O(n + m).
Divide and Conquer (Pick Mid… approach. Optimal — Time O(n), Space O(log n).
Covers: Naive, Use Min Heap. Optimal — Time O(nlogk), Space O(1).
Binary Search. Time O(logn), Space O(1).
Covers: Naive, Using Min heap. Optimal — Time O(nlogk), Space O(k).
Hashing & Sorting problem — solution with code and analysis.
Covers: Sorting + Hashing, character counts Based key. Optimal — Time O(n * k), Space O(n * k).
Graphs. Time O(N), Space O(V+E).