Add solution #1356

Author: JoshCrozier

README.md

@@ -125,6 +125,7 @@
 1324|[Print Words Vertically](./1324-print-words-vertically.js)|Medium|
 1332|[Remove Palindromic Subsequences](./1332-remove-palindromic-subsequences.js)|Easy|
 1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](./1333-filter-restaurants-by-vegan-friendly-price-and-distance.js)|Medium|
+1356|[Sort Integers by The Number of 1 Bits](./1356-sort-integers-by-the-number-of-1-bits.js)|Easy|
 1360|[Number of Days Between Two Dates](./1360-number-of-days-between-two-dates.js)|Easy|
 1472|[Design Browser History](./1472-design-browser-history.js)|Medium|
 1598|[Crawler Log Folder](./1598-crawler-log-folder.js)|Easy|

solutions/1356-sort-integers-by-the-number-of-1-bits.js

@@ -0,0 +1,22 @@
+/**
+ * 1356. Sort Integers by The Number of 1 Bits
+ * https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/
+ * Difficulty: Easy
+ *
+ * Given an integer array arr. You have to sort the integers in the array in
+ * ascending order by the number of 1's in their binary representation and
+ * in case of two or more integers have the same number of 1's you have to
+ * sort them in ascending order.
+ *
+ * Return the sorted array.
+ */
+
+/**
+ * @param {number[]} arr
+ * @return {number[]}
+ */
+var sortByBits = function(arr) {
+  const getCount = n => n.toString(2).replace(/0/g, '').length;
+
+  return arr.sort((a, b) => getCount(a) - getCount(b) || a - b);
+};