Given an integer array `nums`

, re-order it such that `nums[0] < nums[1] > nums[2] < nums[3]...`

.

You may assume the input array always has a valid answer.

```
Input: array_nums = [1,5,1,1,6,4]
Output: [1,6,1,5,1,4]
Explanation: [1,4,1,5,1,6] is also accepted.
```

def sorty(arra_nums): for i in range(len(arra_nums)): if (i%2 == 0) == (arra_nums[i-1] < arra_nums[i]): arra_nums[i-1],arra_nums[i] = arra_nums[i],arra_nums[i-1] return arra_nums arr=list(map(int,input('Array_nums : ').split(' '))) print(sorty(arr))

Input_1:

Array_nums : 1,5,1,1,6,4

Output:

[1, 4, 1, 5, 1, 6]

Input_2:

Array _nums: 1,3,2,2,3,1

Output:

[1, 2, 1, 3, 2, 3]

**Input_3:**

Array_nums : 1,4,3,4,1,2,1,3,1,3,2,3,3

**Output:**

[1, 4, 3, 4, 1, 2, 1, 3, 1, 3, 2, 3, 3]

Illustration of the code run/execution

**More Q**

- Find the majority element appearing more than n/2 times
- Return an array of the squares of each number.
- Highest factor in addition.
- Find the empty packets(0) of chocolate and push it to the end of the conveyor belt(array).
- Every element in array appears twice.Find that single one.
- Find the duplicate letters in string. Same to do in dictionary way.
- Find minimum number of edits (operations) required to convert ‘str1’ into ‘str2’.
- Return the maximum number you can get by changing at most one digit.
- Sed Commands – Ranges of lines.
- Find the kth smallest element in the given 2D array.
- Find all elements that appear more than [n/3] times.
- Write a function to return true if s2 contains the permutation of s1.
- Sort the array into a wave like array.
- Re-order array, such that
`nums[0] < nums[1] > nums[2] < nums[3]...`

. - Given the coordinates, return true if the four points construct a square.
- Minimum Distance Between Words of a String.
- Return the shortest distance between these two words.
- Write a program to find the n-th ugly number.
- Check if array could become Non – Decreasing array.
- Find the minimum area of a rectangle that can be formed from given points.