Officially kicked off the 45-day SDESheetChallenge by takeUforward today, starting off Arrays with 3 classic matrix and permutation simulation problems!
Optimized Set Matrix Zeroes to O(1) auxiliary space by leveraging the first row and column of the matrix itself as state markers, keeping two extra boolean flags for the first row and column.
Cracking Next Permutation required finding the first decreasing element from the right (pivot), swapping it with the next greater element in the suffix, and reversing the suffix to get the lexicographically next permutation in O(N) time.
Solved Minimum Cost of Buying Candies With Discount (Easy) — a straightforward greedy sorting problem solved by stepping backwards by 3 to skip every third candy.
Revised the CAP Theorem CP/AP trade-offs and conducted a broad refresh of foundational system design concepts, aligning with the new revision-heavy schedule.
Next Day Goal
Continue the new System Design-focused preparation plan with a focus on replication and partition strategies.
Solve core matrix and array manipulation problems.