Software Developer

Global
Joined April 2020
Day 32 of #GeekStreak60 β€œLargest BST” had me stuck for a bit πŸ˜… Tried to find BSTs manually… didn’t work. Switched approach β†’ let each subtree decide if it’s a BST. That changed everything. #npci #coding #algorithms #GeekStreak60
2
103
Day 25. Minimum K consecutive bit flips. Instead of flipping bits every time, track flip state with a sliding window. If current bit (after flips) is 0 β†’ start a flip. Greedy + difference array trick.Time: O(n) #geekstreak60 #npci #DSA
1
3
103
Day 23. Subarrays where the first element is the minimum. Key idea: Find the next smaller element using a monotonic stack. If next smaller index is j, valid subarrays starting at i = j - i. Time: O(n)Stack patterns everywhere. #geekstreak60 #npci #DSA
3
52
Day 22. Largest number in one swap. Track last position of digits 0–9. From left β†’ find a bigger digit later β†’ swap once. Greedy + indexing trick.O(n). #geekstreak60 #npci #DSA
3
39
𝕋𝕖𝕔𝕙 β„π•¦π•Ÿπ•₯𝕖𝕣 retweeted
Open Source Automation Project One student built an automation workflow used in an open-source project. The workflow supports contributor coordination in GitPadi. Real projects create stronger learning. npmjs.com/package/gitpadi?ac…
2
1
3
65
𝕋𝕖𝕔𝕙 β„π•¦π•Ÿπ•₯𝕖𝕣 retweeted
Set a reminder for my upcoming Space! xitter.cf/i/spaces/1wGWjaRllwnKQ

2
3
8
123
Day 19. Smallest window containing all characters. Sliding window again.Count chars in p. Expand right. Shrink left when all chars are matched. Track the smallest window. Time: O(n)Patterns keep repeating in DSA. #geekstreak60 #DSA #CodingJourney #npci
1
32
Built Maverick β€” an autonomous multi-agent wallet ecosystem on Solana where AI agents create their own wallets, sign transactions, trade, swap, lend, and talk back to you. Every operation is a real on-chain transaction on devnet. No mocks. Thread on what it does
1
6
15
206
Security matters even in a prototype: - Each agent has an isolated keypair - Vault keypair is separate only it can sign outbound vault txs - Append-only audit trail with tx signatures - Block height expiry handling verifies tx landed on-chain before reporting failure
1
5
56
Day 18. Longest substring with exactly K distinct characters. Sliding window + frequency map. Expand right. Shrink left when uniques > k. Track max when uniques == k. O(n) time.Patterns make problems easier. #geekstreak60 #DSA #Coding #npci
3
36
Day 17. Max XOR subarray of size K. Use sliding window + XOR cancellation trick. a ^ a = 0 β†’ remove old element, add new one. O(n) instead of O(n*k). Patterns everywhere. #geekstreak60 #npci #DSA
2
28
Day 16. Longest subarray with at most 2 distinct numbers. Sliding window + hashmap. Shrink when distinct > 2. Same core pattern showing up again. #geekstreak60 #npci #DSA
2
29