Day 76 Of #100daysOfCode Solved LeetCode 350 – Intersection of Two Arrays II - Used Two-Pointer Technique - Similar to Leetcode 349 #LeetCode #CPP #DSA #CodingJourney #ProblemSolving

Day 75 of #100daysOfCode LeetCode 349 – Intersection of Two Arrays Tried two approaches today : - Using Binary Search (classic but a bit repetitive) - Two-Pointer Technique after sorting both arrays - and honestly, this one was so much more interesting and fun to implement

Day 74 of #100daysofCode Solved: (LeetCode 171) Excel Sheet Column Number #LeetCode #cpp

Day 74 of #100daysOfCode Solved : Leetcode 292 - Nim Game (saved the streak atleast 😌)

Day 73 of #100DaysOfCode Solved: (LeetCode 290) Word Pattern It seemed quite easy at first, but turned out to be a little tricky. Learned a new method - stringstream (converts a string into an input stream). Let’s keep the streak burning 🔥 #CPP #LeetCode #CodingJourney

Day 72 of #100dayOfCode Solved - Leetcode 2011 (Final Value of Variable After Performing Operations) This question feels like a sweet Diwali gift from LeetCode — short, crisp & easy Wishing you a Very Happy Diwali ✨ #LeetCode #Cplusplus #CodingJourney #Diwali #CodeEveryday

Day 71 of #100daysOfCode LeetCode 2525 - Categorize Box According to Criteria This problem is the best way to truly understand conditional statements — not just by theory, but by writing clean decision logic like this #LeetCode #DSA #CPP

Day 70 of #100daysOfCode Problem :412(Fizz Buzz)

Day 69 of #100DaysOfCode Solved : Linked List Cycle (141) Today I learned a new concept — Floyd’s Cycle Detection Algorithm, also known as the Tortoise & Hare Algorithm. Implemented hasCycle() using two pointers: - slow → moves 1 step - fast → moves 2 steps #LeetCode #CPP #DSA

Day 68 of #100DaysOfCode Problem : Roman to Integer (LeetCode- 13) Implemented a clean and optimized approach using unordered_map and reverse iteration. #LeetCode #CPlusPlus #ProblemSolving #TechJourney #DSA

Day 67 of #100DaysOfCode Solved :316. Remove Duplicate Letters Same as 1081, but this time implemented using strings

Day 66 of #100DaysOfCode LeetCode 496: Next Greater Element I - Used Brute Force Approach (O(n²)) Works fine, but can be optimized using a stack to achieve O(n) (will try next time) #LeetCode #DSA #cpp

Day 65 of #100DaysOfCode Tried the Sliding Window technique for the first time today — and it’s actually kinda cool Solved LeetCode #643 – Maximum Average Subarray I #LeetCode #Cplusplus #CodingJourney #DevCommunity #100DaysOfDSA

Day 64 of #100DaysOfCode Problem: Remove Stars From a String Today’s challenge focused on efficiently simulating backspace-like deletions using a stack. (was easier than the easy ones 😅)

Day 63 of #100DaysOfCode Solved "Smallest Subsequence of Distinct Characters" on LeetCode today Learned how to use a monotonic stack + last occurrence tracking to ensure lexicographically smallest order. #LeetCode #Coding #Cplusplus #ProblemSolving #DSA

Learning Three.js , any suggestions ?

Day 62 of #100DaysOfCode Solved LeetCode 202: Happy Number (C++) #leetcode #cpp #DSA

Day 61 of #100DaysOfCode Implemented MinStack (155) in C++ Approach: Used two stacks -> - one to store values - one to keep track of the minimum at each step #100DaysOfDSA #LeetCode #CPP #DSA #CodingJourney

Day 60 of #100DaysOfCode Problem: Remove All Adjacent Duplicates in String II Used a stack to keep track of characters + frequency, popping when count = k. #100DaysOfDSA #LeetCode #CPP

Day 59 of #100DaysOfCode Problem: Remove All Adjacent Duplicates in String (LC 1047) Approach: Stack – push chars, pop when duplicate found Complexity: O(n) #100DaysOfDSA #LeetCode #CPP #DSA