Blind 75
A shop ledger page, 1899. Every line adds up.
DSA Series: Tree, BST and Trie (Blind 75, Java)
14 Blind 75 problems with brute force to optimal approaches, tested Java code, time/space complexity, how interviewers ask and follow-ups. Recursion on trees, BFS levels, BST invariants, serialization, tries.
39 min read
DSA Series: String (Blind 75, Java)
10 Blind 75 problems with brute force to optimal approaches, tested Java code, time/space complexity, how interviewers ask and follow-ups. Sliding window, hashing by signature, stack matching, palindromes, encoding.
25 min read
DSA Series: Linked List (Blind 75, Java)
6 Blind 75 problems with brute force to optimal approaches, tested Java code, time/space complexity, how interviewers ask and follow-ups. Dummy node, fast/slow pointers, reversal, merging sorted lists.
17 min read
DSA Series: Heap (Blind 75, Java)
2 Blind 75 problems with brute force to optimal approaches, tested Java code, time/space complexity, how interviewers ask and follow-ups. PriorityQueue patterns: top-K frequency and the two-heap running median.
10 min read
DSA Series: Interval (Blind 75, Java)
5 Blind 75 problems with brute force to optimal approaches, tested Java code, time/space complexity, how interviewers ask and follow-ups. Sort-and-sweep, greedy by end time, min-heap for rooms.
15 min read
DSA Series: Graph (Blind 75, Java)
8 Blind 75 problems with brute force to optimal approaches, tested Java code, time/space complexity, how interviewers ask and follow-ups. BFS, DFS, topological sort and union-find with the Blind 75 graph problems.
28 min read
DSA Series: Matrix (Blind 75, Java)
4 Blind 75 problems with brute force to optimal approaches, tested Java code, time/space complexity, how interviewers ask and follow-ups. In-place marking, boundary peeling, transpose-reverse rotation, grid backtracking.
21 min read
DSA Series: Dynamic Programming (Blind 75, Java)
11 Blind 75 problems with brute force to optimal approaches, tested Java code, time/space complexity, how interviewers ask and follow-ups. State, transition, base case, memoization vs tabulation, space optimisation.
53 min read
DSA Series: Binary / Bit Manipulation (Blind 75, Java)
5 Blind 75 problems with brute force to optimal approaches, tested Java code, time/space complexity, how interviewers ask and follow-ups. XOR, carry arithmetic, Kernighan bit trick, DP over bits.
15 min read
DSA Series: Array (Blind 75, Java)
10 Blind 75 problems with brute force to optimal approaches, tested Java code, time/space complexity, how interviewers ask and follow-ups. Hash maps, prefix/suffix products, Kadane, binary search on rotated arrays, two pointers.
28 min read