By the end of 2026, this is my pledge:
✔ MERN Stack + solid projects
✔ Gen AI
✔ 300+ DSA problems
✔ Blockchain
I will document the entire journey on Twitter, sharing progress, learnings, and lessons along the way.
No shortcuts. No excuses.
Only daily effort.🔥💪
#Day14 of DSA
Solved Max Consecutive Ones and Single Number.
XOR finally makes sense — simple, powerful, clean ⚡
Also studied Binary Search beyond the formula, focusing on logic and edge cases.
Slow progress, but real progress 📈
Grateful @rohit_negi9
On to Day 15.
#DSA
By the end of 2026, this is my pledge:
✔ MERN Stack + solid projects
✔ Gen AI
✔ 300+ DSA problems
✔ Blockchain
I will document the entire journey on Twitter, sharing progress, learnings, and lessons along the way.
No shortcuts. No excuses.
Only daily effort.🔥💪
#Day16 of DSA
Practiced binary search by solving:
1. Peak Index in a Mountain Array
2. Search in a Rotated Sorted Array
Focused on understanding problem patterns and applying optimized logic instead of brute force.
Grateful @rohit_negi9
#Day15 of DSA 📘
Solved:
• First & Last Position in Sorted Array
• Search Insert Position
• Sqrt(x)
Binary Search = boundaries > guessing.
Thanks @rohit_negi9 🙌
#DSA#BinarySearch#LeetCode 🚀
#Day13 of DSA
Solved: • Check if array is sorted & rotated
• Move zeroes
• Union of two sorted arrays
All solved using basic observations + two pointers.
Learning to use input properties instead of brute force — thanks @rohit_negi9 🙏
#DSA#Arrays#Cplusplus#RohitNegi
#Day11 of DSA
Time & Space Complexity finally made sense today.
It’s not about counting loops.
It’s about understanding how an algorithm *grows* with input.
Ask better questions:
– How often is each element touched?
– Does the input shrink or expand?
– What’s the worst case?
What really happens when data leaves your browser?
Not magic.
Not “the internet”.
Just layers doing one job each:
Meaning → Discipline → Direction → Reality
HTTP → TCP → IP → Ethernet
Wrapped. Sent. Unwrapped. Perfectly engineered.
Encapsulation is why the web works.
#Day10 of DSA journey 🚀
Worked on array problems today: arranging arrays, segregating 0s & 1s, majority element, removing duplicates, and finding the largest element.
Thinking better. Coding cleaner. 🧠💻
Inspired by @rohit_negi9#Day10#DSA#Arrays#CodingJourney