Problem - Arithmetic Slices

Given an integer array $nums$, return the number of arithmetic subarrays. An arithmetic subarray is a sequence of at least three elements with constant difference.

For example, $[1, 2, 3, 4]$ contains $3$ arithmetic subarrays: $[1, 2, 3]$, $[2, 3, 4]$, and $[1, 2, 3, 4]$.

This problem tests whether you recognize arithmetic sequences and can count continuous patterns. Think about what makes a subarray arithmetic.