DSA
In-place pointer weaving — odd indices first, then even. Optimal — Time O(n), Space O(1).
Covers: Naive, Optimal (circular link). Optimal — Time O(n), Space O(1).
Covers: Iterative, Recursive. Optimal — Time O(n), Space O(n).
Covers: Hash, Floyd's Cycle Detection: Har…. Optimal — Time O(n), Space O(1).
Linked List. Time O(n), Space O(1).
Covers: Brute Force, Optimal. Optimal — Time O(N).
Covers: Solution 1: Find Length, Hare and Tortoise. Optimal — Time O(n), Space O(1).
Covers: Naive, Better. Optimal — Time O(n), Space O(1).
Covers: Solution 1: Hash set, Solution 2: Two Pointers, Solution 3: Single Pointer. Optimal — Time O(n), Space O(1).
Covers: With count nodes, With two pointers. Optimal — Time O(m+n), Space O(1).
Data Overwriting approach. Optimal — Time O(n), Space O(1).
Using Dummy Node approach. Optimal — Time O(max(m,n), Space O(max(m,n).
Covers: Naive, Better.
Covers: Using dummy node, Approach2: Recursive Merge. Optimal — Time O(m+n), Space O(m+n).
Covers: Brute Force, Better, Optimal. Optimal — Time O(nlogn), Space O(t).
Covers: Brute Force, Better. Optimal — Time O(N), Space O(1).
Covers: Brute Force, Two Pointer. Optimal — Time O(n), Space O(1).
Covers: RECURSION, USING STACK, MORRIS MODIFIED.
Graphs. Time O(N), Space O(V+E).