[Solution] 3SUM Codeforces Solution

[Solution] 3SUM Codeforces Solution | Codeforces Problem Solution 2022

Given an array a$a$ of positive integers with length n$n$, determine if there exist three distinct indices i$i$, j$j$, k$k$ such that ai+aj+ak$a_i+a_j+a_k$ ends in the digit 3$3$.

Input

The first line contains an integer t$t$ (1≤t≤1000$1\le t\le 1000$) — the number of test cases.

The first line of each test case contains an integer n$n$ (3≤n≤2⋅105$3\le n\le 2\cdot {10}^5$) — the length of the array.

The second line of each test case contains n$n$ integers a1,a2,…,an$a_1,a_2,\dots ,a_n$ (1≤ai≤109$1\le a_i\le {10}^9$) — the elements of the array.

Solution Click Below:-  CLICK HERE

The sum of n$n$ across all test cases does not exceed 2⋅105$2\cdot {10}^5$.

Output

Output t$t$ lines, each of which contains the answer to the corresponding test case. Output "YES" if there exist three distinct indices i$i$, j$j$, k$k$ satisfying the constraints in the statement, and "NO" otherwise.

Marathon Codeforces Solution

3SUM Codeforces Solution

All Distinct Codeforces Solution

Where's the Bishop? Codeforces Solution

The Clock Codeforces Solution

Binary Deque Codeforces Solution

2^Sort Codeforces Solution

You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).