Homepage
Open in app
Sign in
Get started
Array
Backtracking / DP / Greedy
Heap / Linked List
Two Pointers / Binary Search
Tree / Graph
Backend
Array
[Leetcode Pattern] Sliding Window
[Leetcode Pattern] Sliding Window
Sliding windowe is a special kind of two pointers. This technique is often used to find extremum (longest / maximum / minimum …. ) len of…
PHIL
Jul 7, 2022
[Leetcode] Merge Intervals
[Leetcode] Merge Intervals
Not conspicuous at first but two pointer could be helpful.
PHIL
Jan 23, 2022
[Leetcode] Next Permutation
[Leetcode] Next Permutation
Require a very special algo. In place modification makes it more difficult. A good practice for moving pointer and swap design.
PHIL
Jan 26, 2022
[Leetcode] Product of Array Except Self
Require a very special algo. To avoid nums[i] affetcs res[i], make append/update of res[i] prior to nums[i]’s intervention.
PHIL
Jan 26, 2022
[Leetcode] Single Number
[Leetcode] Single Number
The spirit of the problem is to leverage bitwise operator to make computation faster.
PHIL
Mar 27, 2022
[Leetcode] Insert Interval
Manipulation for array elements that requires patience.
PHIL
Apr 15, 2022
[Leetcode] Rotate Image
[Leetcode] Rotate Image
A good practice of efficiently manipulating matrix.
PHIL
Apr 28, 2022
[Leetcode] Valid Parentheses
A good practice of stack problems.
PHIL
Apr 29, 2022
[Leetcode] Find the Duplicate Number
Use some imagination and then it’s essentially the same as Linked List Cycle II.
PHIL
Apr 30, 2022
[Leetcode] Non-overlapping Intervals
A good practice for the greedy algorithm. To waive duplicate computation, keep one local observatory variable and update it along the…
PHIL
Feb 14, 2022
About Coding Memo
Latest Stories
Archive
About Medium
Terms
Privacy
Teams