dsa1 min read
Boats to Save People [Medium] — Greedy Two Pointers Sort
Find minimum boats to save everyone where each boat carries at most 2 people with total weight <= limit, using sort + greedy two pointers.
Read →
All Posts
1575 articles
dsa2 min read
3Sum [Medium] — Sort + Two Pointer Scan
Find all unique triplets summing to zero by sorting and using two pointers for each fixed element with careful duplicate skipping.
Read →
dsa1 min read
Two Sum II — Input Array Is Sorted [Medium] — O(1) Space Two Ptr
Find two numbers summing to target in a 1-indexed sorted array using inward two pointers in O(n) time O(1) space.
Read →
dsa1 min read
Subarray Product Less Than K [Medium] — Sliding Window
Count contiguous subarrays with product < k using a sliding window that divides from the left when product exceeds the limit.
Read →
dsa1 min read
Maximum Points You Can Obtain from Cards [Medium] — Complement Window
Maximize card points taken from both ends of an array by finding the minimum-sum subarray of size n-k in the middle.
Read →
Page 180 of 315