Greatest Sum Divisible by Three (LeetCode 1262)
MediumLeetCode 1262 · Sorting-based Greedy · Google, Amazon +5 · 53:15Greatest Sum Divisible by Three · Multiple Approaches · Detailed · Leetcode 1262My 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 1262 Greatest Sum Divisible by Three by codestorywithMIK: Greedy, Medium. Topics: Array, Dynamic Programming, Greedy, Sorting. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Array, Dynamic Programming, Greedy, Sorting
- Patterns
- Sorting-based Greedy
- Chapter
- Greedy
- Duration
- 53:15
Related problems
- Bag of Tokens (LeetCode 948)
- Boats to Save People (LeetCode 881)
- Earliest Possible Day of Full Bloom(Google, Amazon, Microsoft, Adobe):Explanation ➕ Live Coding (LeetCode 2136)
- Maximum Bags With Full Capacity of Rocks (LeetCode 2279)
- Maximum Ice Cream Bars (LeetCode 1833)
- Minimum Replacements to Sort the Array (LeetCode 2366)
- Minimum Deletions to Make Character Frequencies Unique (LeetCode 1647)
- Eliminate Maximum Number of Monsters (LeetCode 1921)