Add solution #868

Author: JoshCrozier

0868-binary-gap.js

@@ -0,0 +1,20 @@
+/**
+ * 868. Binary Gap
+ * https://leetcode.com/problems/binary-gap/
+ * Difficulty: Easy
+ *
+ * Given a positive integer n, find and return the longest distance between any two adjacent 1's
+ * in the binary representation of n. If there are no two adjacent 1's, return 0.
+ *
+ * Two 1's are adjacent if there are only 0's separating them (possibly no 0's). The distance
+ * between two 1's is the absolute difference between their bit positions. For example, the two
+ * 1's in "1001" have a distance of 3.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var binaryGap = function(n) {
+  return Math.max(0, ...n.toString(2).split('1').slice(1, -1).map(s => s.length + 1));
+};

README.md

@@ -283,6 +283,7 @@
 844|[Backspace String Compare](./0844-backspace-string-compare.js)|Easy|
 846|[Hand of Straights](./0846-hand-of-straights.js)|Medium|
 867|[Transpose Matrix](./0867-transpose-matrix.js)|Easy|
+868|[Binary Gap](./0868-binary-gap.js)|Easy|
 872|[Leaf-Similar Trees](./0872-leaf-similar-trees.js)|Easy|
 876|[Middle of the Linked List](./0876-middle-of-the-linked-list.js)|Easy|
 884|[Uncommon Words from Two Sentences](./0884-uncommon-words-from-two-sentences.js)|Easy|