Candy (LeetCode 135)
HardLeetCode 135 · Exchange Argument & Ordering · Google, Amazon +20 · 39:33CANDY · 2 Approaches · O(1) Space · O(N) Space · AMAZON · Leetcode 135My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 135 Candy by codestorywithMIK: Greedy, Hard. Topics: Array, Greedy. Watch the explanation, then check the code and solve it on LeetCode.
- Problem
- LeetCode 135: Candy
- Difficulty
- hard
- Topics
- Array, Greedy
- Patterns
- Exchange Argument & Ordering
- Chapter
- Greedy
- Duration
- 39:33
Related problems
- Broken Calculator (LeetCode 991)
- Minimum Number of Taps to Open to Water a Garden (LeetCode 1326)
- Maximum Score of a Good Subarray (LeetCode 1793)
- Water the plants
- Earliest Second to Mark Indices I (LeetCode 3048)
- Patching Array (LeetCode 330)
- Maximum Distance in Arrays (LeetCode 624)
- Minimum Domino Rotations For Equal Row (LeetCode 1007)