Day 53 of #160DaysOfCode ✅ with @geeksforgeeks.Solved "Find Pair with Sum Closest to Target" today! 🎯.At first, I tried all combinations with brute force 🐌, but quickly switched to the efficient two-pointer approach after sorting the array! 🚀.#GFGDailyChallenge

Day 52 of #160DaysOfCode ✅ with @geeksforgeeks. Tackled "Count Pairs with Sum Less Than Target" today! 🔍💥.Started with a naive O(n²) solution, but then leveraged the two-pointer technique on a sorted array to bring it down to O(n)! ⚡.#GFGDailyChallenge #TwoPointerTechnique

Day 51 of #160DaysOfCode ✅ with.@geeksforgeeks.Solved "Count All Triplets with Given Sum in Sorted Array" today! 🎯.Started with brute-force (O(n³) 😅), then switched to the two-pointer approach for an efficient O(n²)! 🧠💡.#GFGDailyChallenge #TwoPointerTechnique

Day 50 of #160DaysOfCode ✅ with @geeksforgeeks. Solved "Count Subarrays with Given XOR" today! 💥.Started naive, then optimized with prefix XOR + HashMap for O(n) speed! ⚡.XOR logic is 🔥 — tricky but satisfying!.#GFGDailyChallenge

Day 49 of #160DaysOfCode ✅ with.@geeksforgeeks.Cracked "Subarrays with Sum K" today! 💥.Started with the naive nested loop approach to build intuition 🧠.Then optimized it using prefix sums + HashMap for O(n) efficiency — blazing fast and super clean! ⚡️.#GFGDailyChallenge

Day 47 of #160DaysOfCode ✅ with @geeksforgeeks. Solved Print Anagrams Together today! 🔠.Started with sorting each word to form keys — simple yet effective 🧠.#GFGDailyChallenge #CodingJourney

Day 47 of #160DaysOfCode ✅ with.@geeksforgeeks.Tackled Longest Consecutive Sequence today! 🔥.Started with brute force using sorting to group sequences 🧠.Then dived into the HashSet approach for optimal O(n) time — clean, efficient, and elegant! 🚀.#GFGDailyChallenge

Day 46 of #160DaysOfCode ✅ with.@geeksforgeeks.Solved Union of Two Arrays with Duplicates today!.Started with HashMaps to track frequency and merge intelligently .Then explored sorting + two pointers approach for a cleaner, sorted union! 🔍.#GFGDailyChallenge #CodingPractice

Day 45 of #160DaysOfCode ✅ with @geeksforgeeks. Solved Intersection of Two Arrays with Duplicates today!.Started with HashMaps for frequency counting 🧠.Then optimized using two pointers after sorting — fast and neat! ⚡.#GFGDailyChallenge #CodingPractice #ProblemSolving

Day 44 of #160DaysOfCode ✅ with @geeksforgeeks.Solved Find All Triplets with Zero Sum today!.Started with brute-force, then optimized to O(n²) using sorting + two pointers 💡.Handled duplicates smoothly — clean and efficient! 🔄.#GFGDailyChallenge #CodingPractice

Day 43 of #160DaysOfCode ✅ with.@geeksforgeeks.Tackled the Count Pairs with Given Sum problem today!.Started with a brute-force approach, then optimized it using a hash map 🧮.Achieved O(n) time complexity by counting complement frequencies efficiently 💡.#GFGDailyChallenge

Day 42 of #160DaysOfCode ✅ with @geeksforgeeks. Solved the classic Two Sum – Pair with Given Sum problem today!.Explored both brute-force and optimized hash-based solutions 🧠.Achieved O(n) time complexity using a hash set to track complements .#GFGDailyChallenge

Day 41 of #160DaysOfCode ✅ with @geeksforgeeks. Tackled the Set Matrix Zeroes problem today! .Used an efficient in-place approach with marker flags to minimize space —.brought it down to O(1) space complexity without losing clarity or correctness! .#GFGDailyChallenge

Day 40 of #160DaysOfCode ✅ with @geeksforgeeks. Cracked the Search in a Sorted Matrix problem today! 🔍.Leveraged the top-right corner approach to smartly reduce the search space —.achieving O(n + m) time complexity! 🚀📉. #GFGDailyChallenge #MatrixTraversal #OptimizedSearch

Day 39 of #160DaysOfCode ✅ with @geeksforgeeks. Tackled the Search in a Row-wise Sorted Matrix problem today! 🔍.Used binary search on each row for optimal time complexity — from O(n×m) to O(n × log m)! ⚡📈.#GFGDailyChallenge #BinarySearch #MatrixMagic #CodeNewbie #DevJourney

Day 38 of #160DaysOfCode ✅ with @geeksforgeeks. Cracked the Search in a Row-Column Sorted Matrix problem today! 🔍📊.Leveraged the top-right corner strategy — moved left if the number was bigger, moved down if it was smaller. #GFGDailyChallenge #MatrixMagic

Day 37 of #160DaysOfCode ✅ with.@geeksforgeeks.Tackled the Rotate by 90 Degree problem today! 🔄.Rotated the matrix clockwise using two key steps: transpose the matrix and then reverse each row. Efficient and super satisfying to watch it fall into place! 💡.#GFGDailyChallenge

Day 36 of #160DaysOfCode ✅ with.@geeksforgeeks.Solved the Spirally Traversing a Matrix problem today! 🔁.Carefully navigated the matrix layer by layer — used four boundary pointers to control direction and avoid overlaps. #GFGDailyChallenge

Day 35 of #160DaysOfCode ✅ with.@geeksforgeeks.Solved the Kth Missing Positive Number problem today! 🔍.Used a simple yet clever approach — leveraged the difference between index and value to skip over the missing elements efficiently. #GFGDailyChallenge

Day 34 of #160DaysOfCode ✅ with @geeksforgeeks.Solved the Allocate Minimum Pages 📚 problem today!.Applied binary search on the answer again — balanced the load among students while minimizing the maximum pages assigned. Elegant and efficient! 💡.#GFGDailyChallenge