Want to solve this problem? Login now to get access to solve the problems

Problem

Submissions

Solution

Leaderboard

Coming soon

2

Difficulty: EASY

Avg. time to solve

15 min

Success Rate

85%

Problem Statement

Suggest Edit

```
The first line contains a single integer ‘T’ denoting the number of test cases. The test cases follow.
The first line of each test case contains a single integer ‘X’.
The second line of the input contains the elements of the doubly linked list separated by a single space and terminated by -1. Hence, -1 would never be a list element.
```

```
For each test case, print in a new line the number of triplets which have the sum equal to ‘X’.
```

```
You don’t need to print anything; It has already been taken care of.
```

```
1 <= T <= 5
1 <= N <= 1000
-3*10^5 <= X <= 3*10^5
-10^5 <= data <= 10^5 and data != -1
Where ‘N’ is the number of nodes in the given linked list, and ‘X’ is the required triplet sum value.
Time limit: 1 sec
```

```
2
13
-4 2 3 8 9 -1
5
-4 -2 3 4 5 -1
```

```
2
2
```

```
In the first test case, there are two possible triplets {2,3,8} and {-4,8,9}, whose sum is 13.
In the second test case there are two triplets possible {-4,4,5} and {-2,3,4} whose sum is 5.
```

```
2
-4
-3 8 10 -1
12
1 4 6 2 -1
```

```
0
1
```

```
In the first test case, there is no triplet whose sum is -4.
In the second test case, there is only one triplet {6,4,2}, whose sum is 12.
```

Want to solve this problem? Login now to get access to solve the problems