LeetCode 2798 Number of Employees Who Met the Target

🔥 Day 36 of #LeetCode Journey ✅ Problem: Minimum Distance Between Three Equal Elements I Today’s problem was about finding the minimum distance between three equal elements in an array. 💡 Key Idea: Instead of checking all combinations, we track indices efficiently: Store the last two occurrences of each number When a third occurrence appears, calculate the distance Keep updating the minimum distance 🧠 What I Learned: Optimizing from brute force to O(n) approach Using HashMap effectively for tracking indices Thinking in terms of patterns instead of combinations ⚡ Time Complexity: O(n) ⚡ Space Complexity: O(n) 🔍 Example: Input: [1,2,1,1,3,1] Output: 3 Small optimizations make a big difference 💡 Staying consistent and improving every day! #Java #DSA #LeetCode #CodingJourney #100DaysOfCode #Programming #ProblemSolving

🚀 Turning a simple Java problem into a learning moment! Today I worked on a small but interesting problem: 👉 Find the absolute difference between a number and its reversed form. Leetcode problem: https://lnkd.in/g3wkXSyg 🔍 What this taught me: How to reverse a number using modulus (%) and division (/) Why storing the original value matters before modifying it How Math.abs() helps ensure the result is always positive 💡 Example: If n = 123 Reversed = 321 Absolute difference = |123 - 321| = 198 Sometimes, even small coding challenges sharpen problem-solving skills and reinforce core programming concepts. #Java #Coding #ProblemSolving #DSA #Programming #SoftwareDevelopment #Developers #CodingJourney #LeetCode

🚀 Day 568 of #750DaysOfCode 🚀 🔍 Problem Solved: Two Furthest Houses With Different Colors Today’s problem looked simple at first, but it had a nice twist that tested observation skills more than brute force thinking. 💡 Key Insight: To maximize the distance between two houses with different colors, we don’t need to check all pairs. The answer will always involve either: the first house, or the last house Why? Because the maximum distance comes from the edges of the array. ⚡ Approach: Compare every house with the first and last house If colors are different → calculate distance Keep track of the maximum distance 🧠 Optimization: Instead of an O(n²) brute-force approach, we can solve this in O(n) time with constant space. 📈 Complexity: Time: O(n) Space: O(1) ✨ Takeaway: Sometimes the best solution isn’t about trying everything — it’s about spotting the right pattern. #LeetCode #Java #DSA #CodingJourney #ProblemSolving #100DaysOfCode #Programming #Tech #LearningEveryday

🚀 Day 23 of #50DaysOfCode Solved Daily Temperatures (LeetCode 739) 🌡️ Today’s focus was on mastering the Monotonic Stack concept — one of the most powerful patterns in DSA. Learned how to efficiently find the next greater element by storing indices and resolving them smartly instead of brute force. 💡 Key Learnings: • Stack helps reduce time complexity from O(n²) → O(n) • Always think in terms of “pending answers” • Monotonic stacks are 🔥 for interview questions ✅ Status: Accepted ✔️ ⏱️ Optimized approach implemented Every day getting better at problem-solving and consistency 💪 #DSA #LeetCode #Java #CodingJourney #Consistency #100DaysOfCode #Programming

🚀 Day 44/100 – LeetCode DSA Practice 📌 Problem: 1346. Check If N and Its Double Exist 🧠 Problem Summary Given an integer array, check if there exist two different indices i and j such that: 👉 arr[i] = 2 * arr[j] ⚙️ My Approach (Brute Force) I used two nested loops Compared every pair of elements Checked condition: arr[i] == 2 * arr[j] Ensured indices are different (i != j) ✔️ Simple and easy to understand 💡 What I Learned Brute force helps in understanding logic clearly Always start simple, then optimize Importance of checking all possible pairs 🎯 Next Improvement I will optimize this using HashSet (O(n)) Learning how to reduce time complexity step by step #Day44 #100DaysOfCode #LeetCode #DSA #Java #CodingJourney #Programming #ProblemSolving #TechSkills #Consistency #FutureDeveloper

🚀 Day 76 — LeetCode Practice 🚀 Today’s problem: Count the Number of Consistent Strings 💡 What I learned today: • Used a boolean array to efficiently track allowed characters • Practiced character indexing (c - 'a') technique • Improved understanding of string traversal using nested loops • Learned how to optimize lookup operations to O(1) 🧠 Key Idea: Store all allowed characters in a boolean array. Then, for each word, check if every character exists in the allowed set. If yes → count it as a consistent string ✅ ⚡ Approach Highlights: • Preprocessing allowed characters • Iterating through each word • Breaking early for invalid characters (optimization) • Counting only valid strings 💻 Language Used: Java Consistency is the key 🔑 — improving step by step every day! #Day76 #LeetCode #Java #CodingJourney #ProblemSolving #100DaysOfCode #Programming #Learning

🚀 Code 3 – #50LeetCodeChallenge Problem: 4Sum Given an array of integers and a target value, find all unique quadruplets that sum up to the target. Each element must be used only once, and the solution set should not contain duplicate combinations. 💡 Approach: Sort the array and use nested loops along with a two-pointer technique to find combinations efficiently. Skip duplicate elements to ensure only unique quadruplets are included. 📚 Key Takeaway: Combining sorting with the two-pointer approach helps reduce complexity and is highly effective for solving multi-sum problems like 4Sum. #LeetCode #Java #Coding #ProblemSolving #Arrays #TwoPointers #Programming

💡#LeetCode Daily Challenge – Smart Optimization! Today I worked on a problem where we need to find the minimum distance between three equal elements in an array. At first, it looks like a brute-force problem, but the real trick is simplifying the formula.After observing carefully, the distance formula actually reduces to just twice the difference between the first and last indices. So the middle element doesn’t even matter! That insight helped me avoid unnecessary computations.I grouped indices of each number and checked only consecutive triples to get the minimum distance efficiently. This problem reminded me how powerful pattern recognition can be in coding. #LeetCode #ProblemSolving #DataStructures #Algorithms #CodingInterview #Java #Programming #CodingJourney #TechLearning #Developers #SoftwareEngineering

🚀 Day 10 of #100DaysOfDSA – Solved LeetCode 344: Reverse String Today’s problem was simple yet powerful — Reverse a String (in-place) 💡 🔹 Problem: Given a character array, reverse it without using extra space. 🔹 Approach: Used the Two Pointer Technique: 👉 Start one pointer from the beginning 👉 Another from the end 👉 Swap characters and move inward 🔹 Key Learning: In-place operations improve space efficiency Two-pointer approach is a must-know pattern for interviews 🔹 Time Complexity: O(n) 🔹 Space Complexity: O(1) 💻 Code Insight: Swapping elements until both pointers meet does the job efficiently! ✨ Small problems like this build strong fundamentals for bigger challenges. #DSA #Java #Coding #LeetCode #Programming #SoftwareEngineering #InterviewPrep #100DaysOfCode