
- Javascript Basics Tutorial
- Javascript - Home
- Javascript - Overview
- Javascript - Syntax
- Javascript - Enabling
- Javascript - Placement
- Javascript - Variables
- Javascript - Operators
- Javascript - If...Else
- Javascript - Switch Case
- Javascript - While Loop
- Javascript - For Loop
- Javascript - For...in
- Javascript - Loop Control
- Javascript - Functions
- Javascript - Events
- Javascript - Cookies
- Javascript - Page Redirect
- Javascript - Dialog Boxes
- Javascript - Void Keyword
- Javascript - Page Printing
- JavaScript Objects
- Javascript - Objects
- Javascript - Number
- Javascript - Boolean
- Javascript - Strings
- Javascript - Arrays
- Javascript - Date
- Javascript - Math
- Javascript - RegExp
- Javascript - HTML DOM
- JavaScript Advanced
- Javascript - Error Handling
- Javascript - Validations
- Javascript - Animation
- Javascript - Multimedia
- Javascript - Debugging
- Javascript - Image Map
- Javascript - Browsers
- JavaScript Useful Resources
- Javascript - Questions And Answers
- Javascript - Quick Guide
- Javascript - Functions
- Javascript - Resources
Rearranging elements of an array in JavaScript
Problem
We are required to write a JavaScript function that takes in an array of numbers, arr, as the first and the only argument.
The array arr, will always be of even length.
Our function should return true if and only if it is possible to reorder it such that arr[2 * i + 1] = 2 * arr[2 * i] for every 0 <= i < length(arr) / 2.
For example, if the input to the function is −
const arr = [4, -2, 2, -4];
Then the output should be −
const output = true;
Output Explanation
We can take two groups, [-2,-4] and [2,4] to form [-2,-4,2,4] or [2,4,-2,-4].
Example
The code for this will be −
const arr = [4, -2, 2, -4]; const canRearrange = (arr = []) => { const map = arr.reduce((acc, num) => { acc[num] = (acc[num] || 0) + 1 return acc }, {}); const keys = Object.keys(map) .map(key => Number(key)) .sort((a, b) => a - b) for (const key of keys) { if (key < 0) { while (map[key] > 0) { if (map[key / 2] > 0) { map[key] -= 1 map[key / 2] -= 1 } else { return false } } } else { while (map[key] > 0) { if (map[key * 2] > 0) { map[key] -= 1 map[key * 2] -= 1 } else { return false } } } } return true }; console.log(canRearrange(arr));
Output
And the output in the console will be −
true
- Related Articles
- Rearranging array elements in JavaScript
- Sum of distinct elements of an array in JavaScript
- Sum of distinct elements of an array - JavaScript
- Rearranging cards into groups in JavaScript
- Compute cartesian product of elements in an array in JavaScript
- Finding desired sum of elements in an array in JavaScript
- Unique number of occurrences of elements in an array in JavaScript
- Counting unique elements in an array in JavaScript
- Deep count of elements of an array using JavaScript
- Constructing an array of smaller elements than the corresponding elements based on input array in JavaScript
- Finding special kind of elements with in an array in JavaScript
- How to duplicate elements of an array in the same array with JavaScript?
- Return an array of all the indices of minimum elements in the array in JavaScript
- Building frequency map of all the elements in an array JavaScript
- How to filter an array from all elements of another array – JavaScript?

Advertisements