Day 68/75 DSA Challenge Complete! -
Solved LeetCode #12: Integer to Roman ✅
Used Greedy Approach: subtract largest Roman symbol repeatedly
Also learned Positional Approach: split number into thousands, hundreds, tens, ones
Complexity: O(1) time & space
1994 → MCMXCIV 💎