Two Pointers

Everything about Two Pointers

1. Article · Java

   Dominant Pairs — Sorting and Two-Pointer Approach in Java

   Given an even-sized integer array, divide the array into two equal halves. A pair (i, j) is considered a dominant pair if i belongs to the first half, j belongs to the second half, and arr[i] >= 5 × arr[j]. The goal is to count the total number of dominant pairs efficiently. A brute-force approach takes O(n²) time. By sorting both halves independently and using the two-pointer technique, we can solve the problem in O(n log n) time. This problem is a good example of how sorting can optimize pair-counting problems by avoiding unnecessary comparisons.

   Sandhiya PriyaSep 162,0751,000
2. Article · Data Structures and Algorithms (DSA)

   Police and Thieves Problem

   Maximize thieves caught by policemen within distance 'k' using a greedy two-pointer approach. Optimal O(n) solution ensures the closest valid pairs are matched first.

   Sandhiya PriyaMay 84831,000
3. 
   Article · Algorithms in C#

   Explaining 3SUM Problem

   Learn how to solve the 3SUM problem in C# using sorting and the two-pointer technique to find unique triplets that sum to zero.

   Rajiv SinghOct 31, 20245,9621,000