Leetcode Problem 2367. Number of Arithmetic Triplets

2367. Number of Arithmetic Triplets

Leetcode Solutions

Initialize a boolean array seen of size 201 (since 0 <= nums[i] <= 200) to keep track of which numbers have been seen in the input array.
Initialize a result counter res to 0.
Iterate over each number n in the input array nums.
If n is greater than or equal to 2 * diff, check if seen[n - diff] and seen[n - 2 * diff] are both true.
If both are true, increment res by 1.
Mark seen[n] as true.
After the loop, return the result counter res.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen