Median of Two Sorted Arrays Binary Search Optimization

🚀 Day 6/60 — LeetCode Discipline Problem Solved: Two Sum II – Input Array Is Sorted (Revision) Difficulty: Medium Today’s focus was on leveraging the sorted property of arrays to move from brute-force thinking to an optimal two-pointer approach. Revisiting this pattern helped reinforce how problem constraints can guide us toward more efficient solutions. 💡 Focus Areas: • Strengthened two-pointer technique • Utilized sorted array properties effectively • Improved constant-space optimization thinking • Focused on writing clean and efficient logic ⚡ Performance Highlight: Achieved ~96% runtime efficiency on submission. Steadily refining core patterns, one day at a time. #LeetCode #60DaysOfCode #100DaysOfCode #DSA #TwoPointers #BinarySearch #Algorithms #DataStructures #ProblemSolving #CodingJourney #SoftwareEngineering #TechCareers #Programming #Developers #CodingLife

🚀 Day 8/60 — LeetCode Discipline Problem Solved: 3Sum (Revision) Difficulty: Medium Today’s session revisited the classic 3Sum problem, focusing on combining sorting with the two-pointer technique to efficiently identify unique triplets. This problem continues to be a great exercise in careful duplicate handling and pointer movement discipline. 💡 Focus Areas: • Strengthened sorting + two-pointer pattern • Practiced duplicate triplet elimination • Improved nested pointer reasoning • Focused on writing clean and efficient logic ⚡ Performance Highlight: Achieved solid runtime performance on submission. Step by step, the patterns grow clearer and the intuition sharper. #LeetCode #60DaysOfCode #100DaysOfCode #DSA #TwoPointers #ThreeSum #Algorithms #DataStructures #ProblemSolving #CodingJourney #SoftwareEngineering #TechCareers #Programming #Developers #CodingLife

🚀 Day 5/60 — LeetCode Discipline Problem Solved: Range Sum Query – Immutable (Revision) Difficulty: Easy Today’s practice was centered around strengthening prefix sum intuition for efficient range queries. Instead of recalculating sums repeatedly, the focus was on preprocessing the array to enable constant-time query responses. 💡 Focus Areas: • Reinforced prefix sum technique • Practiced preprocessing for query optimization • Improved time–space trade-off understanding • Focused on writing clean and efficient logic ⚡ Performance Highlight: Achieved ~99% runtime efficiency on submission. Quiet, consistent refinement of core patterns continues. #LeetCode #60DaysOfCode #100DaysOfCode #DSA #PrefixSum #Algorithms #DataStructures #ProblemSolving #CodingJourney #SoftwareEngineering #TechCareers #Programming #Developers #CodingLife

Just solved a challenging binary tree problem! 🌳💻 🔍 Problem: Given a binary tree and an integer k, find the number of downward-only paths where the sum of node values equals k. ➡️ Paths can start and end at any node, but must always move from parent to child. 💡 Key Insight: Using prefix sum + hashmap during DFS traversal helps efficiently track all valid paths in O(n) time! ✅ All test cases passed ⚡ Optimized approach 🔥 Consistency streak continues! #geekstreak #gfg #npci #coding #dsa #binarytree #algorithms #100DaysOfCode #programming #developers #techgrowth

Day 38 on LeetCode — Brick Wall ✅ Today’s challenge focused on prefix sums and hash maps to minimize edge crossings. 🔹 Brick Wall The goal was to draw a vertical line that crosses the least number of bricks. Instead of checking every possible position, the optimized idea was to track edge positions of bricks (excluding the rightmost edge) using a hash map. By computing the prefix sum of brick widths in each row, we counted how many times a particular edge appears. The position with the maximum edge frequency means the line passes through gaps between bricks, resulting in fewer bricks crossed. ⚡ Complexity: • Time Complexity: O(n × m) • Space Complexity: O(n) 💡 Key Takeaways: • Learned how prefix sums help track cumulative positions • Applied hash maps for frequency counting • Practiced optimizing problems by transforming the perspective of the task #LeetCode #DSA #Algorithms #DataStructures #HashMap #PrefixSum #ProblemSolving #Coding #Programming #Cpp #STL #SoftwareEngineering #ComputerScience #CodingPractice #DeveloperLife #TechJourney #CodingDaily #100DaysOfCode #BuildInPublic #AlgorithmPractice #CodingSkills #Developers #TechCommunity #SoftwareDeveloper #EngineeringJourney

🚀 Day 9/60 — LeetCode Discipline Problem Solved: Container With Most Water (Revision) Difficulty: Medium Today’s session focused on revisiting this classic two-pointer optimization problem. The key insight was understanding how intelligently moving pointers can reduce time complexity while still exploring the optimal solution space. 💡 Focus Areas: • Strengthened two-pointer optimization technique • Improved area maximization intuition • Practiced greedy pointer movement logic • Focused on writing clean and efficient implementation ⚡ Performance Highlight: Achieved ~81% runtime efficiency on submission. Steady practice. Sharper instincts. Stronger foundations. #LeetCode #60DaysOfCode #100DaysOfCode #DSA #TwoPointers #Greedy #Algorithms #DataStructures #ProblemSolving #CodingJourney #SoftwareEngineering #TechCareers #Programming #Developers #CodingLife

🚀 Day 17/60 — LeetCode Discipline Problem Solved: 4Sum (Revision) Difficulty: Medium Today’s session revisited the classic k-Sum family problem — 4Sum. After solving 2Sum and 3Sum patterns previously, this problem naturally extends the idea by combining sorting with nested iteration and the two-pointer technique to efficiently identify unique quadruplets. The key challenge lies in managing duplicates carefully while keeping the solution efficient and structured. 💡 Focus Areas: • Strengthened k-Sum pattern understanding • Practiced sorting + two-pointer combination • Improved duplicate handling in multi-pointer problems • Reinforced nested iteration optimization • Focused on writing structured and readable code Problems like these highlight how mastering one pattern allows you to scale the same idea to more complex variations. #LeetCode #60DaysOfCode #100DaysOfCode #DSA #TwoPointers #Arrays #Algorithms #DataStructures #ProblemSolving #CodingJourney #SoftwareEngineering #Programming #Developers #TechCareers

Day 47 on LeetCode — Partition Labels ✂️✅ Today’s problem was a great example of greedy strategy with smart indexing. 🔹 Approach Used in My Solution The goal was to split the string into maximum number of partitions such that each character appears in only one part. Key idea in the solution: • First, store the last occurrence of each character in an array • Traverse the string while maintaining a current partition range • Continuously update the end of the partition using the last index of characters encountered • When the current index reaches end, it means the partition is complete • Store the partition size and start a new one This greedy approach ensures each partition is as small as possible while still valid. ⚡ Complexity: • Time Complexity: O(n) • Space Complexity: O(1) 💡 Key Takeaways: • Learned how preprocessing (last occurrence tracking) simplifies problems • Practiced greedy partitioning techniques • Strengthened understanding of interval expansion logic #LeetCode #DSA #Algorithms #DataStructures #GreedyAlgorithm #Strings #ProblemSolving #Coding #Programming #Cpp #STL #SoftwareEngineering #ComputerScience #CodingPractice #DeveloperLife #TechJourney #CodingDaily #100DaysOfCode #BuildInPublic #AlgorithmPractice #CodingSkills #Developers #TechCommunity #SoftwareDeveloper #EngineeringJourney

Stacks power many algorithms developers use daily. Learn LIFO, push/pop, and key coding interview patterns. Mentoring 👉 https://rebeloper.com/ #datastructures #algorithms #codinginterview #programming #softwaredev

Day 43 on LeetCode — Squares of a Sorted Array ✅ Today’s problem focused on two-pointer technique and handling absolute values for efficient array transformation. 🔹 Approach Used in My Solution The goal was to return a sorted array of squares from a non-decreasing sorted input array, which may contain negative numbers. Key points in the logic: • Use two pointers at the start (left) and end (right) of the array • Compare absolute values of elements at both ends • Place the larger square at the current last position in the result array (pos) • Move the pointer of the larger absolute value and fill the result array from back to front • Continue until all elements are squared and placed This ensures a single-pass O(n) solution without extra sorting. ⚡ Complexity: • Time Complexity: O(n) • Space Complexity: O(n) 💡 Key Takeaways: • Practiced the two-pointer technique for array transformations • Learned to handle negative numbers when squaring • Strengthened understanding of in-place logic using a separate result array #LeetCode #DSA #Algorithms #DataStructures #Arrays #TwoPointers #ProblemSolving #Coding #Programming #Cpp #STL #SoftwareEngineering #ComputerScience #CodingPractice #DeveloperLife #TechJourney #CodingDaily #100DaysOfCode #BuildInPublic #AlgorithmPractice #CodingSkills #Developers #TechCommunity #SoftwareDeveloper #EngineeringJourney