2964. Number of Divisible Triplet Sums

Fix index L to be the leftmost element of a triplet.

Starting from L, go forward and add the remainder of each element to a map.

Now when you are at index R, consider nums[L] + nums[R] and calculate what the remainder of the third element should be.

Then use the map to find the number of valid third elements between L and R.