1995. Count Special Quadruplets

LeetCodeArrayHash TableEnumerationOpen on judge ↗

Given a 0-indexed integer array nums, return the number of distinct quadruplets (a, b, c, d) such that: - nums[a] + nums[b] + nums[c] == nums[d], and - a < b < c < d Example 1: Input: nums = [1,2,3,6] Output: 1 Explanation: The only quadruplet that satisfies the requirement is (0, 1, 2, 3) because 1 + 2 + 3 == 6. Example 2: Input: nums = [3,3,6,4,5] Output: 0 Explanation: There are no such

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI