"Day 58 of #100DaysOfLeetCode: Final Value of Variable After Operations"

✅Day 59 of #100DaysOfLeetCode 📌Problem: Given a fixed-length integer array arr, duplicate each occurrence of zero, shifting the remaining elements to the right. 🟢 Difficulty: Easy 📍Topic: Array 🎯 Goal: To modify the input array in place by duplicating every zero and shifting other elements accordingly, without returning anything. 🧠key idea: Approach 1: Create a new result array to hold the modified elements. Iterate through the original array; if the element is a zero, add it twice to the result array. Otherwise, add the element once. Finally, copy the contents of the result array back into the original array. #100DaysOfCode #LeetCode #CodingChallenge #Java #DataStructures #Algorithms #ProblemSolving #Developer #SoftwareEngineering #CodeNewbie #Tech #Programming #ArrayManipulation #DuplicateZeros #Day59

#Day13 2 – Add Two Numbers Solved this classic linked list problem by implementing an efficient algorithm to add two numbers represented as reverse-digit linked lists. 💡 Approach: Used a dummy node to simplify list construction, iterated through both lists while handling different lengths, and maintained a carry value for proper digit summation. The solution elegantly handles cases where lists have different sizes and final carry propagation. #LeetCode #Java #LinkedList #DataStructures #Algorithms #ProblemSolving #Coding #Tech #SoftwareEngineering #DailyCoding #Programming

✅Day 57 of #100DaysOfLeetCode 1.📌Problem: 350. Intersection of Two Arrays II 2.🟢 Difficulty: Easy 3.📍Topic: Arrays 4.🎯 Goal: Given two integer arrays, nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays, and you may return the result in any order. 5.🧠key idea: Approach 1: Sort both arrays and use a two-pointer technique. Initialize two pointers, one for each array, starting at the beginning. If the elements at the current pointers are the same, add the element to the result and advance both pointers. If the element in the first array is smaller, advance its pointer. If the element in the second array is smaller, advance its pointer. Continue until one of the pointers reaches the end of its array. #100DaysOfLeetCode #LeetCode #CodingChallenge #Java #DataStructures #Algorithms #SoftwareDevelopment #Programming #CodeNewbie #Tech #Developer #SoftwareEngineer #ProblemSolving #TwoPointers #Array

✅Day 74 of #100DaysOfLeetCode 1.📌Problem: Reverse Vowels of a String 2.🟩 Difficulty: Easy 3.📍Topic: Two Pointers 4.🎯 Goal: Given a string, reverse only the vowels in the string and return the modified string. Vowels include 'a', 'e', 'i', 'o', 'u' in both lower and upper cases. 5.🧠key idea: Approach 1: Use two pointers, one starting from the beginning and one from the end. Move towards each other, swap the vowels found at each pointer, and continue until all vowels are reversed. #LeetCode #CodingChallenge #100DaysOfCode #Algorithms #TechCareers #CodeNewbie #WomenWhoCode #Java #Programming #DailyCoding #Developer #InterviewPrep #TwoPointers #DataStructures #LearnToCode #ProblemSolving

Day 26 of #100DaysOfCode 🚀 Today's problem was all about balance — literally. 🔹 LeetCode 1941 — Check if All Characters Have Equal Number of Occurrences The task: Verify whether every character in a string appears the same number of times. At first glance, it looks simple — but it's a great exercise in clean logic, frequency counting, and edge-case handling. 🧠 Approach (Java): Use an array of size 26 to store character frequencies. Track the first non-zero frequency. Compare all other non-zero counts with it. If any mismatch occurs → return false. Otherwise, the string is perfectly balanced. A small problem, but a powerful reminder that clarity > complexity. Efficient logic and readable code always scale better in the long run. 💡 Key Takeaway Mastering these bite-sized logic checks builds strong intuition for: ✔ string manipulation ✔ hashing concepts ✔ pattern consistency ✔ frequency-based problem solving These fundamentals become the building blocks for bigger DSA challenges. #100DaysOfCode #Day26 #LeetCode #DSA #JavaDeveloper #CodingJourney #ProblemSolving #Programming #Strings #Hashing #LearningEveryday #TechJourney

💡 Day 56 of #100DaysOfCode 💡 Today, I tackled LeetCode Problem #2220 – Minimum Bit Flips to Convert Number ⚙️ A bit flip means toggling a binary bit from 0 → 1 or 1 → 0. The goal: find the minimum number of flips needed to convert one integer into another using their binary forms. 💻 Language: Java ⚡ Runtime: 0 ms — Beats 💯% 🚀 📉 Memory: 40.31 MB — Beats 90.20% 🧠 Key Learnings: Refreshed bitwise manipulation concepts. Learned efficient use of XOR (^) to find differing bits. Strengthened understanding of binary representation and counting set bits. 🧩 Approach: 1️⃣ Use XOR (start ^ goal) to identify bits that differ. 2️⃣ Count the number of set bits (1s) — each represents one flip needed. 3️⃣ Return the total count as the minimum flips. ✅ Complexity: Time: O(1) — 32-bit integer fixed loop Space: O(1) ✨ Takeaway: Bitwise problems help sharpen low-level thinking — a must for optimizing performance in system-level or embedded applications. #100DaysOfCode #LeetCode #Java #BitManipulation #CodingChallenge #ProblemSolving #CleanCode #Programming #SoftwareEngineering #TechLearning #Algorithms

✅Day 79 of #100DaysOfLeetCode 1.📌Problem: Can Make Arithmetic Progression From Sequence 2.🟢 Difficulty: Easy 3.📍Topic: Arrays, sorting 4.🎯 Goal: Given an array of numbers, return true if the array can be rearranged to form an arithmetic progression; otherwise, return false. 5.🧠 Key idea: Approach 1: Sort the array to bring numbers in order. Calculate the common difference between the first two elements. Iterate through the array and check if the difference between consecutive elements matches the common difference. If any element does not satisfy the condition, return false; otherwise, return true. #LeetCode #100DaysChallenge #Programming #Coding #Java #Algorithms #CodingPractice #Developer #Tech #CodeNewbie #LearnToCode #ProblemSolving #DataStructures #Arithmetics #InterviewPreparation #CodingSkills #DailyCoding #LinkedInChallenge

✅Day 78 of #100DaysOfLeetCode 1.📌Problem: Find the Difference Given two strings s and t, where t is generated by shuffling s and adding one extra letter at a random position, return the letter that was added. 2.🟢 Difficulty: Easy 3.📍Topic: Strings 4.🎯 Goal: Find the extra character that was added to string t after shuffling and insertion. 5.🧠Key idea: Approach 1: Use the XOR operation to efficiently find the difference. Iterate over both strings, XOR all characters together, and the result will be the added character. This works because XOR-ing identical characters cancels them out, leaving only the unique/added character. #LeetCode #100DaysChallenge #Programming #Coding #CodeNewbie #Java #Tech #SoftwareEngineering #ProblemSolving #Developer #DailyChallenge #HashTable #Algorithms #CodingInterview #LearnToCode

✅Day 62 of #100DaysOfLeetCode 📌Problem: You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. 🟠 Difficulty: Medium 📍Topic: Array, Binary Search 🎯 Goal: Return the single element that appears only once in O(log n) time and O(1) space. 🧠key idea: Approach 1: The problem can be efficiently solved using a modified binary search. The core logic relies on the properties of the sorted array. If we are at an even index, its duplicate pair should be at the next (odd) index. If we are at an odd index, its pair should be at the previous (even) index. By examining the middle element and its neighbor, we can determine if the single, non-duplicated element lies in the left or right half of the array, allowing us to discard one half in each step and achieve a logarithmic time complexity. #100DaysOfCode #LeetCode #CodingChallenge #Java #DataStructures #Algorithms #BinarySearch #ProblemSolving #SoftwareDeveloper #TechJobs #DeveloperLife #CodeNewbie #Programming #LearnToCode #JobSeekers