### Problem Statement :

```You are given a list of integers nums.

Return whether the list alternates from first strictly increasing to strictly decreasing and then strictly increasing etc.

If a list is only strictly increasing, return true.

Constraints

2 ≤ n ≤ 100,000 where n is the length of nums

Example 1

Input

nums = [1, 2, 5, 7, 4, 1, 6, 8, 3, 2]

Output

True

Explanation

This list strictly increases, strictly decreases, strictly increases, then strictly decreases.

Example 2

Input

nums = [1, 1, 2, 3, 2, 1]

Output

False

Explanation

This list increases and then decreases, but is not strictly increasing at first.

Example 3

Input

nums = [1, 3, 5, 7]

Output

True

Explanation

This list is strictly increasing.

Example 4

Input

nums = [5, 3, 1, 5, 7]

Output

False

Explanation

This list is not strictly increasing at first.```

### Solution :

```                        ```Solution in C++ :

bool solve(vector<int>& nums) {
int n = nums.size();
for (int i = 1; i < n; i++) {
if (nums[i] == nums[i - 1]) return false;
if (i == 1 and nums[i] < nums[i - 1]) return false;
}
return true;
}```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
public boolean solve(int[] nums) {
if (nums.length <= 1)
return true;
if (nums <= nums)
return false;
for (int i = 1; i < nums.length; i++) {
if (nums[i] == nums[i - 1]) {
return false;
}
}
return true;
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, a):
return a < a and all(a[i - 1] != a[i] for i in range(1, len(a)))```
```

## Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink

## Insert a Node at the head of a Linked List

Given a pointer to the head of a linked list, insert a new node before the head. The next value in the new node should point to head and the data value should be replaced with a given value. Return a reference to the new head of the list. The head pointer given may be null meaning that the initial list is empty. Function Description: Complete the function insertNodeAtHead in the editor below

## Insert a node at a specific position in a linked list

Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its data attribute, insert this node at the desired position and return the head node. A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is e

## Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

## Print in Reverse

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 head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

## Reverse a linked list

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio