# Print in Reverse

### Problem Statement :

```Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything.

Example

Print the following:
3
2
1

Function Description:

Complete the reversePrint function in the editor below.

reversePrint has the following parameters:

Prints

The data values of each node in the reversed list.

Input Format:

The first line of input contains t, the number of test cases.

The input of each test case is as follows:
1. The first line contains an integer n, the number of elements in the list.
2. Each of the next n lines contains a data element for a list node.

Constraints:
1.   1<=n<=1000
2.   1<=list[i]<=1000```

### Solution :

```                            ```Solution in C :

In C:

//the following fuction is all that is needed to complete the
//challenge in hackerrank platform.

while(current!=NULL)
{   next=current->next;
current->next=prev;
prev=current;
current=next;

}
while(temp!=NULL)
{
printf("%d\n",temp->data);
temp=temp->next;
}

}

In C++:

//the following fuction is all that is needed to complete the
//challenge in hackerrank platform.

{
// This is a "method-only" submission.
// You only need to complete this method.
{
}

}

In Java:

//the following method is all that is needed to complete the
//challenge in hackerrank platform.

}

}

In Python 3 :

//the following method is all that is needed to complete the
//challenge in hackerrank platform.

return
```

## Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

## Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

## Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =