Find Stable Binary Arrays II LeetCode Solution

Day 90/100 – LeetCode Challenge ✅ Problem: #561 Array Partition Difficulty: Easy Language: Java Approach: Sorting + Greedy Pairing Time Complexity: O(n log n) Space Complexity: O(1) Key Insight: To maximize sum of minimums in pairs, pair smallest with smallest, largest with largest. After sorting, take every other element starting from index 0. Solution Brief: Sorted array in ascending order. Iterated through array with step size 2. Added every element at even indices to result. #LeetCode #Day90 #100DaysOfCode #Array #Sorting #Java #Algorithm #CodingChallenge #ProblemSolving #ArrayPartition #EasyProblem #Greedy #Pairing #DSA

#Day8 🚀 ThreadPoolExecutor — how thread pools really work *💡Most developers use Executors, but under the hood it’s powered by ThreadPoolExecutor. Understanding this changed how I design concurrent systems 👇 👉 Task handling flow: Create threads up to corePoolSize Then queue tasks If queue is full → create threads up to maxPoolSize If still full → apply rejection policy ThreadPoolExecutor executor = new ThreadPoolExecutor( 2, 4, 10, TimeUnit.SECONDS, new ArrayBlockingQueue<>(2) ); 💡 Key insight: Unbounded queues can cause memory issues — always design thread pools carefully. #Java #Multithreading #Learning #Concurrency #JavaDeveloper #Threads101 #Coding #InterviewPreparation

Day 33/50 🚀 — Valid Palindrome (Two Pointer Approach) Today’s problem was a great mix of string manipulation + two pointers. 🔹 Ignored non-alphanumeric characters 🔹 Handled case-insensitivity 🔹 Compared characters from both ends efficiently Key insight: Instead of preprocessing the string, we can optimize in-place using two pointers, skipping unwanted characters on the go. 💡 This improves both readability and performance. Performance: ⚡ Runtime: 2 ms (99%+) 📦 Memory: Efficient #Day33 #LeetCode #TwoPointers #DSA #Java #CodingJourney #50DaysOfCode #ProblemSolving

Solved the Valid Parentheses problem using a stack approach. Instead of storing opening brackets, the solution pushes expected closing brackets and matches them directly while traversing the string. This simplifies comparison and avoids extra checks. Time Complexity: O(n) Space Complexity: O(n) #Java #DSA #Stack #LeetCode #Coding

The JVM still evolves. Modern vectorization techniques and the Vector API unlock serious performance improvements. Curious how Hotspot does it? Join the deep dive at Voxxed Days Zürich. 🎟️ https://lnkd.in/gQnKwUpy #Java #JVM #VDZ26

Day 31/50 🚀 — Reverse Vowels of a String (LeetCode 345) Today’s problem was a great reminder that sometimes the simplest approaches are the most efficient. 🔹 Used the two-pointer technique 🔹 Focused on in-place swapping 🔹 Optimized for both time (O(n)) and space (O(1)) Key takeaway: Instead of overthinking, break the problem into smaller checks—identify vowels, move pointers smartly, and swap only when needed. Clean and efficient 💡 Happy to see this solution performing well: ⚡ Runtime: 2 ms (faster than 99%+) 📦 Space: Decent optimization #Day31 #LeetCode #DSA #Java #CodingJourney #50DaysOfCode #ProblemSolving #SoftwareEngineering

Day 50 – Decode String Worked on decoding encoded strings with patterns like k[encoded_string], including handling nested structures using stacks. Key Learnings: Learned how to use stacks to manage nested patterns effectively Understood how to process numbers, brackets, and characters step by step #DSA #Java #Stack #Strings #ProblemSolving #CodingPractice

🚀 Day 38 of #100DaysOfCode 🌱 Topic: Linked List / Recursion ✅ Problem Solved: LeetCode 24 – Swap Nodes in Pairs 🛠 Approach: Used a recursive approach to swap every two adjacent nodes in the linked list. If the list has 0 or 1 node, return it directly (base case). Store the second node (head.next) as a temporary node. Recursively swap the remaining list starting from temp.next. Adjust pointers so the second node becomes the new head of the pair. Connect the swapped pair with the recursively processed list. This swaps nodes without modifying their values, only changing pointers. #100DaysOfCode #Day38 #DSA #LinkedList #Recursion #LeetCode #Java #ProblemSolving #CodingJourney #Consistency

💡 Day 39 of LeetCode Problem Solved! 🔧 🌟1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold 🌟 Task : Given an array of integers arr and two integers k and threshold, return the number of sub-arrays of size k and average greater than or equal to threshold.   Example 1: Input: arr = [2,2,2,2,5,5,5,8], k = 3, threshold = 4 Output: 3 Explanation: Sub-arrays [2,5,5],[5,5,5] and [5,5,8] have averages 4, 5 and 6 respectively. All other sub-arrays of size 3 have averages less than 4 (the threshold). Example 2: Input: arr = [11,13,17,23,29,31,7,5,2,3], k = 3, threshold = 5 Output: 6 Explanation: The first 6 sub-arrays of size 3 have averages greater than 5. Note that averages are not integers. #LeetCode #Java #DSA #ProblemSolving #Consistency #100DaysOfChallenge #CodingJourney #KeepGrowing