#javamode результаты поиска

📜 Day 65 of #gfg160 Cracked “Reverse a Linked List” 🔁 Classic pointer-play in #JavaMode 💻 Used 3-pointer approach in O(n) ⏱️ No extra space, just smart moves! 🧠 Head-first into DSA basics 🧩 Thanks @geeksforgeeks 🙌 #dsa #linkedlist #geekstreak2025 #100DaysOfCode

📜 Day 64 of #gfg160 Solved “Product array puzzle” 🧩 No division used! ✅ Tackled with prefix & suffix products in O(n) ⌛ One pass to build the result 💪 Space-efficient & 32-bit safe 🛡️ Thanks @geeksforgeeks 🙌 #JavaMode #dsa #arraylogic #prefixsuffix #geekstreak2025

📜 Day 63 of #gfg160 Solved “Largest Subarray of 0’s and 1’s” ⚖️ Mapped 0 ➡️ -1 & used HashMap+Prefix Sum 🧠 Tracked first occurrence of sum to find longest balanced subarray in O(n)⌚ One pass. Pure logic! 💯 Thanks @geeksforgeeks 🙏 #JavaMode #dsa #prefixsum #geekstreak2025

📜 Day 62 of #gfg160 Solved “Longest Subarray with Sum K” 🧮 Used HashMap + Prefix Sum for O(n) magic ✨ Tracked first occurrence of prefix to stretch subarray length 🎯 Max length in one pass! @geeksforgeeks 🙌 #JavaMode 🚀 #geekstreak2025 #dsa #prefixsum #gfg

📜 Day 61 of #gfg160 Solved “Equilibrium Point” ⚖️ in arrays! Balanced left & right sums at index i ➗ Used totalSum - leftSum - arr[i] == leftSum 💡 Single pass & O(n) clean! Cheers @geeksforgeeks 🙌 #JavaMode 🚀 #geekstreak2025 #dsa #prefixsum #gfg

📜 Day 60 of #gfg160 Conquered “Container With Most Water” 🧱💧 Went full throttle with Two Pointers ➡️⬅️ Calculated width × min height = max H2O trapped 🧠 Efficient, elegant & O(n) swift ⚡ Cheers @geeksforgeeks 🙌 #JavaMode 🚀 #geekstreak2025 #dsa #twopointers #gfg

📜 Day 59 of #gfg160 Solved "Trapping Rain Water" ☔ Used Two Arrays (Prefix + Suffix Max) for O(n) drip magic 💧 Simulated valleys & caught every drop 💦 Drenched in logic, but dry in bugs ✅ Thanks! @geeksforgeeks 🙌 #JavaMode 🚀 #geekstreak2025 #dsa #twopointers #gfg

📜 Day 58 of #gfg160 Solved "Longest Substring with All Distinct Characters" 🔡 Used HashSet+Sliding Window 🪟 for O(n) magic 💡 Handled repeats like a pro 🔁 & maxed out substring length 💪 Onward in #JavaMode 🚀 @geeksforgeeks you're the GOAT 🐐 #geekstreak2025 #dsa #hashset

📜 Day 57 of #gfg160 Solved "Count Distinct Elements in Every Window" 🧠 Used HashMap + Sliding Window magic 🔁 Optimized for O(n) ⏱️ and crushed edge cases 💪 Another Medium-level win in #JavaMode 🧵 @geeksforgeeks you're the real MVP 🙌 #geekstreak2025 #dsa #hashmap

📜 Day 56 of #gfg160 Solved "Indexes of Subarray Sum" 🧮 Used Sliding Window 💡 Handled non-negatives & edge cases like a pro ⚙️ Felt good converting -1s into crisp indices 🔍 Thanks @geeksforgeeks 🙌 #JavaMode #slidingwindow #geekstreak2025 #dsa

📜 Day 55 of #gfg160 Solved "Count the number of possible triangles"🔺 Used Two-pointers + Sorting 💡 Checked triangle inequality efficiently for O(n²) magic ✨ Fun to see 0s turn into 6s with clever bounds 😎 Thanks @geeksforgeeks 🙏 #JavaMode #twopointers #geekstreak2025 #dsa

📜 Day 54 of #gfg160 Solved "Pair with given sum in a sorted array" 🤝 Used Two-pointer magic on sorted input for O(n) ⚡ Handled dupes smartly for exact pair counts 🎯 Fun edge cases too! Thanks @geeksforgeeks 🙌 #JavaMode #twopointers #geekstreak2025 #dsa

📜 Day 53 of #gfg160 Solved "Sum Pair Closest to Target" 🎯 Sorted + Two-pointer approach for optimal O(n log n) ⏱️ Handled tie-breakers with max absolute diff logic 💡 Neat edge handling ✅ Thanks! @geeksforgeeks 🙏 #JavaMode #twopointers #geekstreak2025

📜 Day 52 of #gfg160 Solved Count Pairs whose sum is less than target ➖🎯 Used sorting + 2-pointer for efficient O(n log n) ➕ O(n) sweep 🚀 Handled all pairs strictly below target with clean logic ✅ @geeksforgeeks #JavaMode #twopointers #geekstreak2025 #arrays

📜 Day 51 of #gfg160 Solved Count all triplets with given sum in sorted array ➕➕➕ Used 2-pointer with fixed base + smart duplicate handling ✅ Optimized to O(n²) with clean edge case coverage 🔍 Thanks! 🙌 @geeksforgeeks #JavaMode #geekstreak2025 #twopointers #triplets

📜 Day 50 of #gfg160 Solved Count Subarrays with given XOR ✖️➕ Used prefix XOR + HashMap for fast O(n) ⚡ Tracked XOR pairs to find subarrays in real-time 🧠 Clean Java code with edge cases handled 🔍 Thanks! @geeksforgeeks 🙌 #JavaMode #geekstreak2025 #bitmagic

📜 Day 49 of #gfg160 Solved Subarrays with Sum K ➕➖ Used prefix sum + HashMap for optimal O(n) 🧠 Tracked cumulative sums to count subarrays in real-time 🧩 Handled negatives too! Clean & efficient Java solution 🚀 Thanks! @geeksforgeeks 🙏 #JavaMode #geekstreak2025

📜 Day 48 of #gfg160 Solved Print Anagrams Together 🔡 Grouped strings like "act", "cat", "tac" with a HashMap<Sorted, List>🧩 No sort of full array—just smart grouping with O(n * k log k)!🧠 Maintained input order, clean Java logic💻 @geeksforgeeks 🙏 #JavaMode #geekstreak2025

📜 Day 47 of #gfg160 Solved Longest Consecutive Subsequence 🔗 Used HashSet for O(n) lookup & detected sequence starts! 🚀 Found max streaks like 1️⃣2️⃣3️⃣4️⃣5️⃣6️⃣ in unsorted arrays. Pure logic, no sort needed! 🧠 @geeksforgeeks 🙏 #JavaMode #DSA #ArrayOps #geekstreak2025

📜 Day 46 of #gfg160 Solved Union of Arrays with Duplicates 🔗 Used HashSet to combine unique elements from both arrays. Clean O(n + m) logic 💡 No duplicates, just pure union! Grind continues! 🔥 Thanks @geeksforgeeks 🙏 #JavaMode #DSA #ArrayOps #geekstreak2025

📜 Day 53 of #gfg160 Solved "Sum Pair Closest to Target" 🎯 Sorted + Two-pointer approach for optimal O(n log n) ⏱️ Handled tie-breakers with max absolute diff logic 💡 Neat edge handling ✅ Thanks! @geeksforgeeks 🙏 #JavaMode #twopointers #geekstreak2025

📜 Day 54 of #gfg160 Solved "Pair with given sum in a sorted array" 🤝 Used Two-pointer magic on sorted input for O(n) ⚡ Handled dupes smartly for exact pair counts 🎯 Fun edge cases too! Thanks @geeksforgeeks 🙌 #JavaMode #twopointers #geekstreak2025 #dsa

📜 Day 65 of #gfg160 Cracked “Reverse a Linked List” 🔁 Classic pointer-play in #JavaMode 💻 Used 3-pointer approach in O(n) ⏱️ No extra space, just smart moves! 🧠 Head-first into DSA basics 🧩 Thanks @geeksforgeeks 🙌 #dsa #linkedlist #geekstreak2025 #100DaysOfCode

📜 Day 46 of #gfg160 Solved Union of Arrays with Duplicates 🔗 Used HashSet to combine unique elements from both arrays. Clean O(n + m) logic 💡 No duplicates, just pure union! Grind continues! 🔥 Thanks @geeksforgeeks 🙏 #JavaMode #DSA #ArrayOps #geekstreak2025

📜 Day 61 of #gfg160 Solved “Equilibrium Point” ⚖️ in arrays! Balanced left & right sums at index i ➗ Used totalSum - leftSum - arr[i] == leftSum 💡 Single pass & O(n) clean! Cheers @geeksforgeeks 🙌 #JavaMode 🚀 #geekstreak2025 #dsa #prefixsum #gfg

📜 Day 50 of #gfg160 Solved Count Subarrays with given XOR ✖️➕ Used prefix XOR + HashMap for fast O(n) ⚡ Tracked XOR pairs to find subarrays in real-time 🧠 Clean Java code with edge cases handled 🔍 Thanks! @geeksforgeeks 🙌 #JavaMode #geekstreak2025 #bitmagic

📜 Day 56 of #gfg160 Solved "Indexes of Subarray Sum" 🧮 Used Sliding Window 💡 Handled non-negatives & edge cases like a pro ⚙️ Felt good converting -1s into crisp indices 🔍 Thanks @geeksforgeeks 🙌 #JavaMode #slidingwindow #geekstreak2025 #dsa

📜 Day 59 of #gfg160 Solved "Trapping Rain Water" ☔ Used Two Arrays (Prefix + Suffix Max) for O(n) drip magic 💧 Simulated valleys & caught every drop 💦 Drenched in logic, but dry in bugs ✅ Thanks! @geeksforgeeks 🙌 #JavaMode 🚀 #geekstreak2025 #dsa #twopointers #gfg

📜 Day 60 of #gfg160 Conquered “Container With Most Water” 🧱💧 Went full throttle with Two Pointers ➡️⬅️ Calculated width × min height = max H2O trapped 🧠 Efficient, elegant & O(n) swift ⚡ Cheers @geeksforgeeks 🙌 #JavaMode 🚀 #geekstreak2025 #dsa #twopointers #gfg

📜 Day 62 of #gfg160 Solved “Longest Subarray with Sum K” 🧮 Used HashMap + Prefix Sum for O(n) magic ✨ Tracked first occurrence of prefix to stretch subarray length 🎯 Max length in one pass! @geeksforgeeks 🙌 #JavaMode 🚀 #geekstreak2025 #dsa #prefixsum #gfg

📜 Day 51 of #gfg160 Solved Count all triplets with given sum in sorted array ➕➕➕ Used 2-pointer with fixed base + smart duplicate handling ✅ Optimized to O(n²) with clean edge case coverage 🔍 Thanks! 🙌 @geeksforgeeks #JavaMode #geekstreak2025 #twopointers #triplets

📜 Day 52 of #gfg160 Solved Count Pairs whose sum is less than target ➖🎯 Used sorting + 2-pointer for efficient O(n log n) ➕ O(n) sweep 🚀 Handled all pairs strictly below target with clean logic ✅ @geeksforgeeks #JavaMode #twopointers #geekstreak2025 #arrays

📜 Day 64 of #gfg160 Solved “Product array puzzle” 🧩 No division used! ✅ Tackled with prefix & suffix products in O(n) ⌛ One pass to build the result 💪 Space-efficient & 32-bit safe 🛡️ Thanks @geeksforgeeks 🙌 #JavaMode #dsa #arraylogic #prefixsuffix #geekstreak2025

📜 Day 47 of #gfg160 Solved Longest Consecutive Subsequence 🔗 Used HashSet for O(n) lookup & detected sequence starts! 🚀 Found max streaks like 1️⃣2️⃣3️⃣4️⃣5️⃣6️⃣ in unsorted arrays. Pure logic, no sort needed! 🧠 @geeksforgeeks 🙏 #JavaMode #DSA #ArrayOps #geekstreak2025

📜 Day 48 of #gfg160 Solved Print Anagrams Together 🔡 Grouped strings like "act", "cat", "tac" with a HashMap<Sorted, List>🧩 No sort of full array—just smart grouping with O(n * k log k)!🧠 Maintained input order, clean Java logic💻 @geeksforgeeks 🙏 #JavaMode #geekstreak2025

📜 Day 57 of #gfg160 Solved "Count Distinct Elements in Every Window" 🧠 Used HashMap + Sliding Window magic 🔁 Optimized for O(n) ⏱️ and crushed edge cases 💪 Another Medium-level win in #JavaMode 🧵 @geeksforgeeks you're the real MVP 🙌 #geekstreak2025 #dsa #hashmap

📜 Day 58 of #gfg160 Solved "Longest Substring with All Distinct Characters" 🔡 Used HashSet+Sliding Window 🪟 for O(n) magic 💡 Handled repeats like a pro 🔁 & maxed out substring length 💪 Onward in #JavaMode 🚀 @geeksforgeeks you're the GOAT 🐐 #geekstreak2025 #dsa #hashset

📜 Day 49 of #gfg160 Solved Subarrays with Sum K ➕➖ Used prefix sum + HashMap for optimal O(n) 🧠 Tracked cumulative sums to count subarrays in real-time 🧩 Handled negatives too! Clean & efficient Java solution 🚀 Thanks! @geeksforgeeks 🙏 #JavaMode #geekstreak2025

📜 Day 63 of #gfg160 Solved “Largest Subarray of 0’s and 1’s” ⚖️ Mapped 0 ➡️ -1 & used HashMap+Prefix Sum 🧠 Tracked first occurrence of sum to find longest balanced subarray in O(n)⌚ One pass. Pure logic! 💯 Thanks @geeksforgeeks 🙏 #JavaMode #dsa #prefixsum #geekstreak2025

📜 Day 55 of #gfg160 Solved "Count the number of possible triangles"🔺 Used Two-pointers + Sorting 💡 Checked triangle inequality efficiently for O(n²) magic ✨ Fun to see 0s turn into 6s with clever bounds 😎 Thanks @geeksforgeeks 🙏 #JavaMode #twopointers #geekstreak2025 #dsa