🎯 200 Days of Code — Completed Yesterday! 🚀 200 days of pure consistency, learning, and problem-solving 💻 From brute force to optimal — every approach made me better. But the journey isn’t over yet — I’m continuing until I land in a top product-based company #LeetCode #DSA

🌟 Day 256/∞ 🚀 Solved First Bad Version 🐞🔍 💡 Applied binary search to minimize API calls and locate the first bad version efficiently. Time Complexity: O(log n) | Space: O(1) 💪 #LeetCode #DSA #BinarySearch #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 255/∞ 🚀 Solved Missing Number 🔢❓ 💡 Used the sum formula to find the missing value in linear time. Clean math solution! Time Complexity: O(n) | Space: O(1) 💪 #LeetCode #DSA #Math #BitManipulation #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 254/∞ 🚀 Solved Nim Game 🎮🧠 💡 Observed the pattern — if n % 4 == 0, the first player loses; otherwise, they win. Classic game theory insight! Time Complexity: O(1) | Space: O(1) 💪 #LeetCode #DSA #GameTheory #Math #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 253/∞ 🚀 Solved Ugly Number 🔢 💡 Repeatedly divided the number by 2, 3, and 5 to check if it reduces to 1. Simple math-based validation! Time Complexity: O(log n) | Space: O(1) 💪 #LeetCode #DSA #Math #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 252/∞ 🚀 Solved Reverse Integer 🔢🔄 💡 Reversed digits mathematically while carefully handling 32-bit integer overflow. Time Complexity: O(log n) | Space: O(1) 💪 #LeetCode #DSA #Math #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 251/∞ 🚀 Solved String Compression 🧵✂️ 💡 Used two pointers to compress the string in-place by counting consecutive characters. Time Complexity: O(n) | Space: O(1) 💪 #LeetCode #DSA #TwoPointers #String #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 250/∞ 🚀 Solved Happy Number 😊🔢 💡 Used Floyd’s Cycle Detection to identify loops while repeatedly replacing the number with the sum of squares of its digits. TC: O(log n) | Space: O(1) 💪 #LeetCode #DSA #Math #TwoPointers #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 249/∞ 🚀 Solved String to Integer (atoi) 🔤➡️🔢 💡 Carefully parsed the string, handled leading spaces, optional sign, digits, and overflow conditions. Edge cases make this one tricky but fun! TC: O(n) | SC: O(1) 💪 #LeetCode #DSA #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 248/∞ 🚀 Solved Palindrome Number 🔢🔁 💡 Reversed half of the number and compared — no string conversions needed! Time Complexity: O(log n) | Space: O(1) 💪 #LeetCode #DSA #Math #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 247/∞ 🚀 Solved Score of a String 🔤⚡ 💡 Calculated the score by summing absolute differences between adjacent characters — simple logic, clean implementation! Time Complexity: O(n) | Space: O(1) 💪 #LeetCode #DSA #String #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 246/∞ 🚀 Solved Sort Colors 🎨⚪🔴🔵 💡 Implemented the Dutch National Flag Algorithm — three pointers to sort 0s, 1s, and 2s in a single pass. Time Complexity: O(n) | Space: O(1) ⚡ #LeetCode #DSA #TwoPointers #Greedy #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 245/∞ 🚀 Solved Rearrange Array Elements by Sign ➕➖ 💡 Reordered elements by alternating positive and negative values while keeping their original relative order — clean and intuitive! TC: O(n) | Space: O(n) ⚡ #LeetCode #DSA #TwoPointers #CodeEveryday #KeepCoding

🌟 Day 244/∞ 🚀 Solved Single Number 🔎 💡 Used bitwise XOR to cancel pairs and find the unique element in a single pass. Time Complexity: O(n) | Space: O(1) ⚡ #LeetCode #DSA #BitManipulation #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 243/∞ 🚀 Solved Generate Parentheses 🔁🧩 💡 Used backtracking (build sequences, prune when opens < closes) to generate all valid combinations. TC: O(Cn · n) (Catalan-number growth) | Space: O(n) for recursion. 💪 #LeetCode #DSA #Backtracking #CodeEveryday #KeepCoding

Solved Count Collisions on a Road 🚗💥🚙 💡 Trimmed leading L’s and trailing R’s, then counted all remaining non-static cars — a neat observation-based solution! Time Complexity: O(n) | Space: O(1) ⚡ #LeetCode #DSA #Greedy #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 241/∞ 🚀 Solved Count Partitions with Even Sum Difference ➗🔢 💡 Calculated total sum and counted how many prefix sums split the array so that the difference of the two parts is even. TC: O(n) | Space: O(1) ⚡ #LeetCode #DSA #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 240/∞ 🚀 Solved Spiral Matrix 🔄🌀 💡 Simulated the spiral traversal using four boundaries — top, bottom, left, right — and moved layer by layer. Time Complexity: O(m·n) | Space: O(1) 📐 #LeetCode #DSA #Matrix #Simulation #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 239/∞ 🚀 Solved Contains Duplicate 🔁 💡 Simple and efficient — used a HashSet to detect duplicates in linear time. Time Complexity: O(n) | Space: O(n) ⚡ #LeetCode #DSA #Hashing #CodeEveryday #KeepCoding #100DaysOfCode

🌟 Day 238/∞ 🚀 Solved Valid Sudoku ✔️🔢 💡 Used HashSets to validate rows, columns, and 3×3 subgrids — ensuring no duplicates across the board. Clean checks for a clean Sudoku! Time Complexity: O(1) | Space: O(1) (since the board is fixed size) 💪 #LeetCode #DSA #Hashing

🌟 Day 237/∞ 🚀 Solved Contains Duplicate II 🔁👀 💡 Used a sliding window + HashSet to check if the same value appears within the index distance k. Efficient and clean approach! TC: O(n) | Space: O(k) ⚡ #LeetCode #DSA #Hashing #SlidingWindow #CodeEveryday #KeepCoding