Algorithm

Leetcode 2393. Count Strictly Increasing Subarrays

Count Strictly Increasing Subarrays

by foolish
Algorithm

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

Validate Stack Sequences

by foolish
Algorithm

Leetcode 946. Validate Stack Sequences

Leetcode 994. Rotting Oranges

Rotting Oranges

by foolish
Algorithm

Leetcode 994. Rotting Oranges

Leetcode 724. Find Pivot Index

Find Pivot Index

by foolish
Algorithm

Leetcode 724. Find Pivot Index

Leetcode 525. Contiguous Array

Contiguous Array

by foolish
Algorithm

Leetcode 525. Contiguous Array

Leetcode 53. Maximum Subarray with Kadane's Algorithm

Maximum Subarray with Kadane’s Algorithm

by foolish
Algorithm

Leetcode 53. Maximum Subarray with Kadane’s Algorithm

Leetcode 325. Maximum Size Subarray Sum Equals k

Maximum Size Subarray Sum Equals k

by foolish
Algorithm

Leetcode 325. Maximum Size Subarray Sum Equals k

Leetcode 713. Subarray Product Less Than K

Subarray Product Less Than K

by foolish
Algorithm

Leetcode 713. Subarray Product Less Than K

Leetcode 523. Continuous Subarray Sum

Continuous Subarray Sum

by foolish
Algorithm

Leetcode 523. Continuous Subarray Sum

Leetcode 560. Subarray Sum Equals K

Subarray Sum Equals K

by foolish
Algorithm

Leetcode 560. Subarray Sum Equals K

1
2
3
4
Next »