Shubham kASHYAP @shubhamCoder24

just made solid progress on my Slack Clone (MERN Stack) Here’s what I’ve completed so far: ✅ Mongoose Schemas: User, Workspace, Channel ✅ Workspace Repository with CRUD operations ✅ Custom error classes with HTTP status codes #SlackClone #MERN #NodeJS #MongoDB #100DaysOfCode

Day 20 of #100DaysOfCode Topic: Hashing 🔍 Today I focused on strengthening my hashing fundamentals. Solved 3 classic problems: 1️⃣ Find element with unique occurrence 2️⃣ Find first non-repeated character 3️⃣ Count subarrays with sum equal to K #DSA #LeetCode #Coding #HashMap

Day 19/ #100DaysOfCode : Topic => Two-Pointer Solved: 1. Count unique pairs A[i] + A[j] = K (distinct ele) 2.Count unique pairs A[i] + A[j] = K (duplicate ele) 3.Count pairs A[i] - A[j] = K (distinct ele) 4.Count pairs A[i] - A[j] = K (duplicate ele)

Day 18/100 of #100DaysOfCode Solved two algorithmic challenges today! 1️⃣ Search in Rotated Sorted Array 2️⃣ Aggressive Cows / Task Scheduling 🔹 Binary search + greedy feasibility check 🔹 Minimized max worker time efficiently #LeetCode #DSA #Coding

🚀 Day 17 of #100DaysOfCode 📚 Topic: Binary Search Today I practiced: 🔍 Find First Occurrence of an element 🔁 Find K-times Rotated Sorted Array ⛰️ Find Local Minima in an array 🎯 Find Target Element (K) using Binary Search #BinarySearch #DSA #CodeNewbie #DevCommunity

🚀 Day 16 of #100DaysOfCode ✅ Practiced Merge Sort – understood how it uses Divide & Conquer to break and solve subproblems efficiently. 🧠 Solved 1 LeetCode Medium: "Largest Number" – sorting trick + custom comparator logic. #LeetCode #JavaScript #Coding #DSA

day -15 🚀 #Day13: Sorting Algorithm 🧠 Implemented & Analyzed: 🔹 Bubble Sort - O(n²) | Stable 🔹 Insertion Sort - O(n²) | Stable 🔹 Selection Sort - O(n²) | Unstable 👇 Discussion: Which O(n²) sort do you find most intuitive? #Algorithms #DSA #100DaysOfCode #Coding

I'll be posting Web Development progress in the morning and focusing on DSA at night, as I’m currently working a night shift.

# day -14 of #100DaysOfCode Since I’ve already worked on the backend earlier, I’m comfortable with it. I’m currently building the frontend from scratch and have successfully fetched the API from the backend to the frontend.#WebDevelopment

Day13: Revision Day Journey🧠 Revision Mode ON📌 Revisited: ➕ Math fundamentals (mod, power, primes) 🧠 Bit Manipulation (XOR, set/clear bits, subsets) 🔁 Recursion (base + recursive cases, tree recursion)🔍 Building stronger problem-solving muscle!#100DaysOfCode #DSA #Coding

Now, I will restart and complete all the web projects I left unfinished. This month, I aim to solve at least 100 DSA problems with proper understanding.#DSA #CodingChallenge

For the past few days, I haven’t posted anything due to a lack of consistency. But I think if I do small things daily, it will be good for my career and life. So, I’m starting to post again. #motivations #CodingJourney

🔥 #Day12: Recursion Unlocked! ✅ Sum 1 to N → n + sum(n-1) ✅ Fibonacci → fib(n-1) + fib(n-2) ✅ Power aⁿ → a * pow(a, n-1) ✅ Prime Check → Trial division + recursion #DSA #Recursion #100DaysOfCode

#Day11 of #100DaysOfCode => Topic : Hashing 🔥 Solved LeetCode: ✅ #3005 - Count Max Frequency Elements ✅ #387 - First Unique Character #LeetCode #DSA

#Day11 Of #100DaysOfCode #pythonlearning #CodingJourney 🔥 Solved: #2461 - Maximum Sum of Distinct Subarrays (Length K)

🚀 #Day11: Bit Manipulation Breakthrough! 🔢 Solved: ✅ #136 - Single Number ✅ #260 - Single Number III ✅ #137 - Single Number II #LeetCode #BitMagic #DSA #100DaysOfCode

🚀 Day 10 Progress ✅ Practiced Sliding Window technique — tackled the Max Subarray Sum of Length K problem. 🛠️ Kicked off my web development IDX Clone project — finished frontend + backend setup! #100DaysOfCode #JavaScript #MERN

#Day10: Crushing Arrays ✅ LeetCode #121 – Best Time to Buy/Sell Stock (💰 Optimal strategy nailed!) 🔥 Array Deep Dive: 1️⃣ Amazing Subarrays – Pattern mastered 2️⃣ Close Min/Max – Edge cases handled 3️⃣ Buy/Sell Logic – O(n) efficiency #LeetCode #Algorithms #100DaysOfCode

🧠 Day - 9: #100DaysOfCode Today’s focus: Array mastery 🔁 Solved 2 solid interview-style problems: ✅ Special Index – Remove index to balance even & odd indexed sums ✅ Range Query (Even Indexed Sum) – Prefix sum-based optimization for multiple queries #DSA #LeetCode

Day 8 Progress ✅ Today I focused on the Prefix Sum topic. Here's what I accomplished: 🧠 Practiced 4 questions: 1.Range sum queries 2.Equilibrium index 3.In-place prefix sum 💻 Solved 1 LeetCode problem: Find Pivot Index #100DaysOfCode #Leetcode