## Trapping Rain Water 💦 (Leetcode 42)

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

## Count Strictly Increasing Subarrays

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

## Validate Stack Sequences

Leetcode 946. Validate Stack Sequences

## Rotting Oranges

Leetcode 994. Rotting Oranges

## Find Pivot Index

Leetcode 724. Find Pivot Index

## Contiguous Array

Leetcode 525. Contiguous Array

## Maximum Subarray with Kadane’s Algorithm

Leetcode 53. Maximum Subarray with Kadane’s Algorithm

## Maximum Size Subarray Sum Equals k

Leetcode 325. Maximum Size Subarray Sum Equals k

## Subarray Product Less Than K

Leetcode 713. Subarray Product Less Than K

## Continuous Subarray Sum

Leetcode 523. Continuous Subarray Sum

## Subarray Sum Equals K

Leetcode 560. Subarray Sum Equals K