Leetcode Medium problem explanation in 1 MINUTE - Maximum Erasure Value
Автор: Friendly Neighborhood Coder
Загружено: 2020-12-20
Просмотров: 534
Описание:
#shorts #leetcode #Shorts #datastructures #algorithms
https://leetcode.com/contest/weekly-c...
You are given an array of positive integers nums and want to erase a subarray containing unique elements. The score you get by erasing the subarray is equal to the sum of its elements.
Return the maximum score you can get by erasing exactly one subarray.
Leetcode problem 1695. Maximum Erasure Value
Hard to explain this in a 1 minute video. This is a fairly easy problem using sliding window technique.
I have another video on what Sliding window technique linked below:
• The Sliding window technique
If you want me to make a more detailed explanation for this particular problem or any other problem, let me know in the comments.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
