# Piling Up! python

### Problem Statement :

```There is a horizontal row of n cubes. The length of each cube is given. You need to create a new vertical pile of cubes. The new pile should follow these directions: if cubei is on top of cubej then sideLengthj >= sideLengthi.

When stacking the cubes, you can only pick up either the leftmost or the rightmost cube each time. Print "Yes" if it is possible to stack the cubes. Otherwise, print "No". Do not print the quotation marks.

Input Format

The first line contains a single integer T, the number of test cases.
For each test case, there are 2 lines.
The first line of each test case contains n, the number of cubes.
The second line contains n space separated integers, denoting the sideLengths of each cube in that order.

Constraints
1<=T<=5
1<=n<=10^5
1<side Lenght<=2^31

Output Format

For each test case, output a single line containing either "Yes" or "No" without the quotes.```

### Solution :

```                            ```Solution in C :

import sys

def test_cubes(cubes):
t_cube = 0

if cubes > cubes[len(cubes)-1]:
t_cube = cubes
cubes.pop(0)
else:
t_cube = cubes[len(cubes)-1]
cubes.pop(len(cubes)-1)

while len(cubes) > 0:
if t_cube == cubes:
t_cube = cubes.pop(0)
elif t_cube == cubes[len(cubes)-1]:
t_cube = cubes.pop(len(cubes)-1)
elif (cubes > cubes[len(cubes)-1]) and (t_cube >= cubes):
t_cube = cubes.pop(0)
elif (cubes < cubes[len(cubes)-1]) and (t_cube >= cubes[len(cubes)-1]):
t_cube = cubes.pop(len(cubes)-1)
elif (cubes == cubes[len(cubes)-1]):
t_cube = cubes.pop(0)
else:
return "No"
return "Yes"

num_of_tests = int(num_of_tests)

for i in range(0, num_of_tests):
print(test_cubes(cubes))```
```

## Truck Tour

Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr

## Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

## QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element