Four Sum Count Problem

Four Sum Count Problem — ExecCode Easy DSA Practice

Solve the Four Sum Count problem on ExecCode. Free online easy DSA practice in Hashing. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given the input needed to solve Four Sum Count. Your task is to compute the required answer and return count of valid index tuples. A sequence of values is given, and order matters. In Four Sum Count, the goal is to transform, count, or select values according to the exact rule. n, then four lines of n integers each.

Examples

Input {"A": [1, 2], "B": [-2, -1], "C": [-1, 2], "D": [0, 2]}; Output 2

Constraints

1 <= n <= 200

Practice Four Sum Count free on ExecCode. Browse DSA problems, topic map, and placement guides.