Alternating Numbers :
Difficulty Level : Easy
Submissions : 624
Asked In :
Marks :10
: 6 | : 0
You are given a zero indexed array of $$$n$$$ integers. You need to rearrange the elements of the array in such a way that positive and negative numbers are placed alternatively at the begining of the array and the length of the prefix $$$k$$$ where $$$a_i*a_{i-1}<0$$$ for each $$$i(1 \leq i \leq k)$$$ is maximum. If there are more positive of negative numbers they are placed at the end of the array. If there are multiple solutions, output any.
The first line contains a single integer $$$n(1 \leq n \leq 10^5)$$$.
The next line contains $$$n$$$ space separated integers $$$a_1,a_2,...,a_n(-10^9 \leq a_i \leq 10^9)$$$ and $$$a_i!=0$$$.
Output $$$n$$$ integers - the resultant array.
5 1 2 3 -4 5
1 -4 2 3 5
