📅 Day 213 – LeetCode #88.🎯 Merge two sorted arrays in-place.🔁 Used two pointers from end.💡 O(m + n) without extra space.📌 Mastering in-place merging!.#Java #LeetCode #TwoPointers #ArrayManipulation #DSA #300DaysOfCode

📅 Day 212 – LeetCode #78.🎯 Generate all subsets (power set).🧠 Used backtracking + recursion.📌 Explored include/exclude choices.🔥 Clean, efficient structure!.#Java #LeetCode #Backtracking #Subsets #DSA #300DaysOfCode

📌 Day 211 – LeetCode #525.🔁 Problem: Longest subarray with equal 0s & 1s.✅ Replaced 0s with -1s.✅ Used prefix sum & HashMap.✅ Clean O(n) solution!.Powerful example of how mathematical transformations simplify logic 🔥.#Java #LeetCode #DSA #300DaysOfCode

📅 Day 210 – LeetCode #1751.🎯 Pick k max-value non-overlapping events.🧠 DP + Binary Search.📌 State: dp[i][k] = max(val, skip).💡 Event scheduling mastery!.#Java #LeetCode #DP #BinarySearch #300DaysOfCode #ProblemSolving

📅 Day 209 – LeetCode #55.🎯 Can you reach the end of the array?.🧠 Tracked max reachable index.✔️ Early stop if index > farthest.⚡ Classic greedy challenge!.#Java #LeetCode #JumpGame #Greedy #DSA #300DaysOfCode #ProblemSolving

📅 Day 208 – LeetCode #45.🎯 Reach end of array with min jumps.🧠 Used greedy traversal.📌 Jump only when range ends.💡 Clean, efficient & optimal!.#Java #LeetCode #JumpGameII #Greedy #300DaysOfCode #ProblemSolving #DSA

📌 LeetCode Problem #44 – Wildcard Matching.Today’s challenge was all about implementing a pattern matcher with support for two special wildcard characters

📅 Day 206 – LeetCode #1394.🎯 Find the largest value x in array such that x == freq(x).🧠 Used a frequency array.✅ Checked all possible values.💡 Simple but powerful logic!.#Java #LeetCode #LuckyInteger #200DaysOfCode #ProblemSolving #DSA

📅 Day 205 – LeetCode #3307.🎯 Remove one duplicate per value to maximize set size.🧠 Counted freq using HashMap.✅ Smart reduction = bigger set!.#Java #LeetCode #DSA #ProblemSolving #HashMap #200DaysOfCode #Coding

📅 Day 204 – LeetCode #3304.🎯 Score = prefixSum + maxSoFar at each index.🧠 Used prefix sum + running max.✅ Simple logic, big learning 💡.#Java #LeetCode #PrefixSum #ArrayLogic #200DaysOfCode #ProblemSolving #DSA

📅 Day 203 – LeetCode #70.🪜 Climbing Stairs: Ways to reach step n using 1 or 2 steps.🧠 DP + Fibonacci pattern.✅ Optimized to O(1) space using two variables!.#Java #LeetCode #DynamicProgramming #Fibonacci #300DaysOfCode #ProblemSolving #Coding

📅 Day 202 – LeetCode #1498.🎯 Count subsequences where min + max ≤ target.🧠 Sorted + two pointers + power of 2.⚡ Used modular exponentiation.Tough but satisfying! 🔥.#Java #LeetCode #DSA #200DaysOfCode #ProblemSolving #TwoPointers

📅 Day 201 – LeetCode #3330.🔢 Find the distinctly most frequent digit in a string.🧠 Counted occurrences with array.📌 Return -1 if there's a tie.Satisfying logic & frequency challenge!.#Java #LeetCode #DSA #200DaysOfCode #ProblemSolving #StringLogic

📅 Day 200 – LeetCode #594.🎯 Longest Harmonious Subsequence.🧠 Used HashMap to count & match adjacent values.✅ Subsequence with max-min diff = 1.Feeling accomplished hitting 200 days! 🔥.#Java #LeetCode #DSA #200DaysOfCode #ProblemSolving #HashMap

📅 Day 199 – LeetCode #2200.🔍 Find K-distant indices where nums[j] == key & |i-j| ≤ k.🧠 Loop + logic + condition.✅ Simple but powerful for index filtering!.#Java #LeetCode #DSA #Array #KDistance #ProblemSolving #200DaysOfCode

📅 Day 198 – LeetCode #48.🔁 Rotate 2D matrix by 90° (in-place).1️⃣ Transpose.2️⃣ Reverse each row.💡 Clean, space-efficient trick!.#Java #LeetCode #Matrix #InPlace #DSA #200DaysOfCode #ProblemSolving

📅 Day 197 – LeetCode #2081.🔁 Sum of k-Mirror Numbers.🧠 Numbers that are palindromes in base 10 and base k.📊 Used base conversion + palindrome logic.Such a satisfying string + math challenge! 💻.#Java #LeetCode #Palindrome #BaseConversion #DSA #200DaysOfCode

📅 Day 196 – LeetCode #43.✖️ Multiply Strings (no int conversion).🧠 Used manual digit multiplication & carry handling.🔢 Simulated how we multiply numbers on paper 💯.#Java #LeetCode #MultiplyStrings #StringManipulation #200DaysOfCode

📅 Day 195 – LeetCode #29.🔢 Divide without using *, / or %.🧠 Used bit shifts + repeated subtraction.✅ Learned overflow handling & sign logic!.#Java #LeetCode #BitManipulation #DSA #ProblemSolving #200DaysOfCode

📅 Day 194 – LeetCode #3085.🧵 Make String K-Special.→ Used HashMap for freq counting.→ Deleted excess chars with greedy logic.💡 Clean and practical string problem!.#Java #LeetCode #String #DSA #Greedy #HashMap #200DaysOfCode