Open in app
Sign inGet started

Two Pointers / Binary Search

[Leetcode] Container With Most Water

[Leetcode] Container With Most Water

A classic practice for two pointers.
Go to the profile of PHIL
PHIL

[Leetcode] Binary Search

PHIL

[Leetcode] Backspace String Compare

PHIL

[Leetcode] Find Minimum in Rotated Sorted Array

PHIL

[Leetcode] Longest Repeating Character Replacement

PHIL

[Leetcode] Longest Substring Without Repeating Characters

PHIL

[Leetcode] Subarray Product Less Than K

PHIL
[Leetcode Pattern] Binary Search

[Leetcode Pattern] Binary Search

While binary search seems an ordinary technique, there are many special cases that require some modification of the usual template.
Go to the profile of PHIL
PHIL

[Leetcode] Trapping Rain Water

While the concept is two pointers converging from opposite sides, the implementation is more in a dp form.
Go to the profile of PHIL
PHIL
[Leetcode Pattern] Two Pointers

[Leetcode Pattern] Two Pointers

Two pointers are very commonly used in leetcode problems. The purpose is mostly to turn nested loop traversal solvable in linear mode.
Go to the profile of PHIL
PHIL
About Coding MemoLatest StoriesArchiveAbout MediumTermsPrivacyTeams