An integer sequence is called arithmetic if it contains at least $3$ elements and the difference between any two consecutive elements is constant.

Given an integer array nums, return the number of arithmetic subarrays of nums.

A subarray is a contiguous subsequence of an array.

Constraints:

• $1 \leq$ nums.length $\leq 5000$

• $-1000 \leq$ nums[i] $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.