<p>Given an integer array of even length <code>arr</code>, return <code>true</code><em> if it is possible to reorder </em><code>arr</code><em> such that </em><code>arr[2 * i + 1] = 2 * arr[2 * i]</code><em> for every </em><code>0 &lt;= i &lt; len(arr) / 2</code><em>, or </em><code>false</code><em> otherwise</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> arr = [3,1,3,6]
<strong>Output:</strong> false
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> arr = [2,1,2,6]
<strong>Output:</strong> false
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> arr = [4,-2,2,-4]
<strong>Output:</strong> true
<strong>Explanation:</strong> We can take two groups, [-2,-4] and [2,4] to form [-2,-4,2,4] or [2,4,-2,-4].
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= arr.length &lt;= 3 * 10<sup>4</sup></code></li>
	<li><code>arr.length</code> is even.</li>
	<li><code>-10<sup>5</sup> &lt;= arr[i] &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution {
public:
    bool isPossible(vector<int> &arr, map<int, int> &m1) {
        int n = arr.size();
        for(int i = 0; i < n; i++) {
            if (m1[arr[i]] == 0) {
                continue;
            }
            int freq = m1[arr[i]];
            if (m1[2 * arr[i]] < freq) {
                return false;
            }
            m1[arr[i]] -= freq;
            m1[2 * arr[i]] -= freq;
        }
        return true;
    }
    bool canReorderDoubled(vector<int>& arr) {
        int n = arr.size();
        vector<int> pos, neg;
        map<int, int> m1;
        for(int i = 0; i < n; i++) {
            m1[arr[i]] += 1;
            if (arr[i] > 0) {
                pos.push_back(arr[i]);
            }
            else if(arr[i] < 0) {
                neg.push_back(arr[i]);
            }
        }
        if (m1[0] % 2 != 0) {
            return false;
        }
        sort(pos.begin(), pos.end());
        sort(neg.rbegin(), neg.rend());
        return isPossible(pos, m1) && isPossible(neg, m1);
    }
};
70200