Leetcode 2393. Count Strictly Increasing Subarrays Problem You are given an array nums consisting of positive integers. Return the number of subarrays of nums that are in strictly increasing order. A subarray is a contiguous part of an array. Example 1:… Read More »Count Strictly Increasing Subarrays
Leetcode 946. Validate Stack Sequences
Leetcode 523. Continuous Subarray Sum
Leetcode 560. Subarray Sum Equals K
Leetcode 1762. Buildings With an Ocean View
Leetcode 1730. Shortest Path to Get Food
Leetcode 2089. Find Target Indices After Sorting Array
Leetcode 32. Longest Valid Parentheses
Leetcode 1944. Number of Visible People in a Queue
Leetcode 173. Binary Search Tree Iterator