🚀 Quick update:.Our team just won the Hackathon at the Rabbitt AI Hiring Show! 🏆.Grateful for the experience, the learning, and the win. Onwards and upwards! 💥.#Hackathon #AI #RabbittAI #TechWins #HiringShowttt.

📅 Day 46 (July 8, 2025):.Skipped yesterday — was caught up in a project (@msdhoni b'day too 👀, jk HBD). Solved Count Subarrays with Sum = k ➕.Brute O(n²) ➝ optimized to O(n) using prefix sum + hashing. Clean & efficient ✅.#DSA #100DaysOfCode.@striver_79 @takeUforward_

📅 Day 45 (July 6, 2025):.Solved Longest Consecutive Sequence 🔢.Used hashing for O(n) TC — skipped sorting. Key trick: only start counting when the current element begins a new sequence. Simple yet powerful logic ✅.#DSA #100DaysOfCode.@striver_79 @takeUforward_

📅 Day 44 (July 5, 2025):.Solved Merge Two Sorted Arrays (No Extra Space) 🔁.Tried merge sort first, but it uses extra space. Then learned the optimal pointer approach using up to min(m, n) iterations — clean and efficient 💡.#DSA #100DaysOfCode.@striver_79 @takeUforward_

📅 Day 43 (July 4, 2025):.Solved Maximum Product Subarray ✖️.Used a clean O(n) approach with prefix & suffix scans to track the max product. One of those tricky subarray problems where handling negatives is the real challenge!.#DSA #100DaysOfCode.@striver_79 @takeUforward_

📅 Day 42 (July 3, 2025):.Solved Reverse Pairs 🔄.Knew from inversion that merge sort could help — tried adapting it. Dry run showed flaws, so learned the trick and used a two-pointer helper. Merge sort keeps proving its worth 💡.#DSA #100DaysOfCode.@striver_79 @takeUforward_

🎯 Just crossed 100 problems solved!.This has been a solid grind through fundamentals. Now it’s time to level up — the core DSA part begins from here. Let’s keep the streak alive and the learning sharp 🚀.#DSA #100DaysOfCode #MilestoneUnlocked.

📅 Day 41 (July 2, 2025):.Solved Count Inversions 🔁.Tried a two-pointer idea first, then learned it’s best solved using Merge Sort — surprising how a sorting algo helps count such patterns!.Another divide-and-conquer win 💡.#DSA #100DaysOfCode.@striver_79 @takeUforward_

📅 Day 40 (July 1, 2025):.Solved Find Missing & Repeating Number 🔍.Tried 2 ways:.• Sorting and then Sum vs expected sum.• Then used linear equations with sum & sum of squares to solve it. A good mix of math and logic ✅.#DSA #100DaysOfCode.@striver_79 @takeUforward_

RT @takeUforward_: 🫂

📅 Day 39 (June 30, 2025):.Solved Majority Element – II 🧠.Skipped brute-force. Used hashmap first, then applied logic from Moore’s Voting Algo — at most 2 elements can appear > n/3. Implemented & verified by counting occurrences ✅.#DSA #100DaysOfCode.@striver_79 @takeUforward_

💭 Was really amazed by the thought process behind Moore’s Voting Algorithm — it can find the majority element in just linear time, if it exists!.The core idea: a true majority can never have its count reduced to zero. Brilliant and elegant ✨.#DSA #100DaysOfCode.

Solved Majority Element – I ✅.Skipped brute-force (O(n²)), used hashmap for O(n) TC & SC. Then tried sorting + two pointers (O(n log n)). Finally learned the elegant Moore’s Voting Algorithm — no extra space & linear time 💡.#DSA #100DaysOfCode.@striver_79 @takeUforward_

📅 Day 37 (June 28, 2025):.Solved Next Permutation 🔁.Yet to try brute-force (will do during recursion). Had a rough idea of optimal, learned the algo and coded it (O(3n)). Tweaked it a bit after checking solutions — worked ✅.#DSA #100DaysOfCode.@striver_79 @takeUforward_

@striver_79 @takeUforward_ 💭 Just a thought — while solving Kadane’s, I noticed something deeper. To find the maximum sum, the algorithm drops everything once the sum turns negative. Maybe life works the same way — to get the best of it, we focus on the positives. ✨.#DSA #LifeLessons.

📅 Day 36 (June 27, 2025):.Solved Kadane’s Algorithm — max subarray sum 💥.It’s wild how something so simple can look so complex at first. Was absolutely puzzled, then amazed by the elegance of the solution. A classic for a reason!🔥.#DSA #100DaysOfCode.@striver_79 @takeUforward_

📅 Day 35 (June 26, 2025):.Solved the classic Sort 0s, 1s & 2s 🟥🟨🟦.Initially tried i-j pointers but hit O(n²) due to faulty while loop. Then learned the proper low-mid-high 3-pointer approach — clean, efficient, and in-place ✅.#DSA #100DaysOfCode.@striver_79 @takeUforward_

📅 Day 34 (June 25, 2025):.Solved 4 Sum 🔢.Skipped brute-force (O(n⁴)). Used two-pointer with two fixed elements — same O(n³) as hashing but no extra space. The pattern’s clicking better now — building on 3 Sum logic 💡.#DSA #100DaysOfCode.@striver_79 @takeUforward_

📅 Day 33 (June 24, 2025):.Solved 3 Sum 💡.Brute-force (O(n³)) was out. Tried hashing +ve/-ve pairs — got stuck. Learned how a properly set two-pointer on a sorted array simplifies it a lot. Clean & efficient once the setup clicks ✅.#DSA #100DaysOfCode.@striver_79 @takeUforward_

📝 Noticed I’ve mostly been solving just one problem a day lately. While consistency matters, I’ll try to devote more focused time from tomorrow and increase the pace. Need to be more disciplined on this path 💪.#100DaysOfCode #DSA.