code. break. learn. repeat. backend/dev/security building projects while grinding dsa. js • python • react • flask • node.js
Joined May 2021
- Tweets145
- Following63
- Followers43
- Likes365
Week1 update :
>4 days gym 3 days rest
>Solved some leetcode
>Almost book is complete
>Working on a project
See you next week folks...
Wonderfull video @hellotinah ,
It seperates the doubts of people about models.
See the video people.....
If you want to learn about local AI models context, parameters and hardware.
Hey @elonmusk atleast make a free tier best model for students......
I wanna use the new groq bots.
Miss my old days of watching @HackMyVm @proxyprgrammer @_JohnHammond in Covid year. And try to learn about pentesting and reverse engineering.
Time to cook again...
2026 made one thing clear:
I'm still undercooked.
The next few months are going to be spent in the fire.
Built ClearStack 📱- turns notification chaos into clear, grouped summaries. Runs 100% on-device with local AI (Gemma) - nothing leaves your phone.
Open source. Try it → app.hwkds.dev
Feedback or ideas? Reach out directly 🙏.
Finally 😮💨😮💨😮💨.
My final prototype is ready.
What should we name the app? #AI
My application is on testing phase now .
Here is the glimpse
1st - summary of the notification on priority basis
2nd - automatic sensitive information like otp etc are hidden for the api.
Keshav Dev Sharma retweeted
DSA Preparation Roadmap (From Zero to OA Ready)
1. Sliding Window: 3, 76, 209, 424, 567, 904
2. Two Pointers: 11, 15, 16, 18, 42, 167
3. Fast/Slow Pointers (Linked List): 141, 142, 19, 876, 160, 234
4. Binary Search on Sorted Data: 33, 34, 35, 153, 162, 704
5. Binary Search on Answer: 875, 1011, 410, 774, 1283, 1482
6. Hashing / Frequency Maps: 1, 49, 128, 217, 242, 347
7. Prefix Sum / Running Sum: 303, 560, 724, 930, 974, 523
8. Difference Array / Range Updates: 370, 1094, 1109, 1893, 1943, 2381
9. Monotonic Stack: 739, 496, 503, 84, 85, 901
10. Monotonic Queue / Deque: 239, 862, 1425, 1438, 1499, 1696
11. Heap / Top K: 215, 347, 692, 703, 973, 1046
12. Intervals: 56, 57, 252, 253, 435, 452
13. Greedy Scheduling / Sorting: 45, 55, 406, 621, 763, 134
14. Linked List Manipulation: 21, 23, 24, 25, 92, 138
15. Tree DFS: 104, 112, 113, 543, 124, 226
16. Tree BFS / Level Order: 102, 103, 199, 515, 637, 116
17. BST Problems: 98, 99, 230, 235, 450, 700
18. Backtracking Basics: 46, 47, 77, 78, 90, 39
19. Backtracking with Constraints: 40, 17, 79, 131, 51, 52
20. Graph BFS / DFS: 200, 695, 733, 994, 1091, 1254
21. Topological Sort / DAG: 207, 210, 802, 1462, 1203, 2115
22. Union Find / DSU: 547, 684, 1319, 1579, 990, 1202
23. Shortest Path: 743, 787, 1514, 1631, 1334, 1976
24. MST / Graph Greedy: 1584, 1135, 1168, 1489, 778, 1102
25. Trie: 208, 211, 212, 648, 677, 1268
26. Bit Manipulation: 136, 137, 191, 338, 268, 190
27. 1D DP Basics: 70, 198, 213, 322, 279, 300
28. Knapsack / Subset DP: 416, 494, 518, 474, 1049, 879
29. Grid DP: 62, 63, 64, 221, 931, 120
30. String DP / Sequence DP: 1143, 72, 115, 583, 97, 1312
How to use this list?
- These numbers are Leetcode problem numbers
- Do 3 patterns at a time, not all 30 together.
- For each pattern, solve the first 2 to understand the idea, the next 2 to get repetition, and the last 2 to stretch yourself.
- After every pattern, write one reusable template from memory.
- Do not just “solve and move on.” Ask: what signal in the question pointed to this pattern?
- If you get stuck, revisit the same pattern after 3 to 4 days. Pattern recognition is built by spacing, not cramming.
