Leetcode 2393. Count Strictly Increasing Subarrays - Python tutorial

preview_player
Показать описание
Today I solve and explain very quickly a medium level difficulty leetcode algorithm using Python3 called "2393. Count Strictly Increasing Subarrays". I go over two possible approaches. One using a monotonic stack the other using the "kadane-ish" pattern. Essentially allowing us to go from O(N) space complexity to O(1)!

If you found this helpful Like and Subscribe! I solve LeetCode Algorithms (Python/ Java) and SQL Problems daily!

#leetcode #python #python3 #tutorial #coding #programming
Рекомендации по теме
Комментарии
Автор

Carter, what do you suggest me to get better with my programming logic? i know how to structure the code but i often get stuck in logic problems.

Pessoa