ππππ βπ¦ππ₯ππ£ retweeted
I built ChogChoir for #Chogathon: every Chog has its own voice and song, made from its real traits.
Hum a tune and it sings it back, pair two for a duet, and sing your Chog into a shared on-chain choir on Monad. Encores burn $CHOG.
Try it: chog-choir.vercel.app
Hum a tune and it sings it back, pair two for a duet, and sing your Chog into a shared on-chain choir on Monad. Encores burn $CHOG.
Try it: chog-choir.vercel.app
130 APPS SUBMITTED!
Judging starts next Monday.
Drop your app in the comments below! The community will be able to vote for their favorites!
2
10
20
519
ππππ βπ¦ππ₯ππ£ retweeted
Day 1: you start work.
Day 30: you finally get paid.
What if pay landed every second instead?
meet Payday π
Tell Claude who to pay. Approve once in @PayBox. Pay streams on Base, by the second.
You ask. We handle payday
Our new age - consumer finance
Day 30: you finally get paid.
What if pay landed every second instead?
meet Payday π
Tell Claude who to pay. Approve once in @PayBox. Pay streams on Base, by the second.
You ask. We handle payday
Our new age - consumer finance
Payday made it to the finalist!
checkout payday on app.paybox.sh/plugins
Thanks to @PayBox and @moonpay
e.g of use cases:
- Salaries and contractor pay
- Freelancers on an hourly rate: pause when work stops, resume when it starts
- Trial periods
- Rent or retainers, etc
3
9
26
1,255
@moraes_c_ @github
My github account has been suspended for a month plus now for no reason, this has paused my development.
My github account has been suspended for a month plus now for no reason, this has paused my development.
2
0
2
150
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
β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
0
0
2
104
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
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
0
1
3
104
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
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
0
0
3
53
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
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
0
0
3
40
ππππ βπ¦ππ₯ππ£ 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/gitpadβ¦
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/gitpadβ¦
2
1
3
65
ππππ βπ¦ππ₯ππ£ retweeted
Set a reminder for my upcoming Space! x.com/i/spaces/1wGWjβ¦
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
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
0
0
1
32
Stellar Pulse #episode 2 with manojimenzG x.com/i/spaces/1wxWjβ¦
3
2
3
64
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
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
- 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
0
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
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
0
0
3
36