Leetcode Problem 1248. Count Number of Nice Subarrays

1248. Count Number of Nice Subarrays

Leetcode Solutions

Sliding Window Approach

  1. Initialize two pointers left and right to 0, a counter count for odd numbers, and a variable result to store the number of nice subarrays.
  2. Iterate through the array using the right pointer.
  3. When an odd number is encountered, decrement k.
  4. If k is less than 0, increment the left pointer and adjust k accordingly.
  5. Add the difference between right and left pointers plus one to the result.
  6. Return the result as the final answer.
UML Thumbnail

Prefix Sum and Hash Map Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...