Target DSA T4 | Problem - 1 Max Discount I
20:53
Target DSA Contest | Problem 2 Quest for Optimal Gains
22:27
Target DSA T4 | Problem 4 | The Fusion League Challenge: Save the Day with Mystic Arrays!
16:59
Leetcode Hard | 2246. Longest Path With Different Adjacent Characters | diameter of a tree variant
26:17
Leetcode Hard | 3008. Find Beautiful Indices in the Given Array II | KMP , Binary Search.
24:01
Target DSA Contest T4 | Problem 3 Prime-Safe Node Assignment in Trees
3:57
Why I like C programming more than Web Dev (rant)
15:31
I Helped 2,000 People Walk Again
1:56:48