Focused on optimizing array problems using two pointers.
✅ 88 Merge Sorted Array (in-place, O(m+n))
✅ 2824 Count Pairs < Target
✅ 1 Two Sum
✅ 167 Two Sum II
Thinking in patterns > brute force 🚀
Day3 #DSA
Top comments (0)
Subscribe
We're a place where coders share, stay up-to-date and grow their careers.
Top comments (0)