Hi, Iโm Ashish ๐
Currently learning the MERN Stack
Solving DSA in C++ (Striver A2Z)
Building projects & sharing the journey ๐
If youโre also learning, building, or prepping for tech roles โ letโs connect ๐ค
If you're building in 2026, we should connect ๐
๐ป JavaScript / React
๐ MERN Stack
โ๏ธ Backend / Node
โ๏ธ AWS / Cloud
๐ง DSA / LeetCode
Drop your stack below ๐
Letโs follow & grow together ๐
#BuildInPublic#DevCommunity#100DaysOfCode#MERNStack
Day 13 โ
Array grind:
โ Missing number
โ Maximum consecutive 1s
โ Single number (others twice)
Easy to read.
Hard to master. ๐ช
Consistency > motivation.
Day 14 loadingโฆ ๐
#BuildInPublic#DSA#100DaysOfCode#CPlusPlus
Honest question:
When you see a new problem, do you write the "Brute Force" solution first, or try to find the "Optimal" one immediately? ๐ง
I sometimes waste time trying to optimize too early. ๐
Day 12 of #100DaysOfCode ๐
Topics covered: โ Rotate Array (by K) โ Move Zeroes โ Union of Arrays โ Linear Search
The "Reversal Algorithm" for rotation (O(1) space) is a game changer compared to brute force. ๐
#DSA#CPlusPlus#StriverA2Z