Add solution #775

Author: JoshCrozier

README.md

@@ -586,6 +586,7 @@
 769|[Max Chunks To Make Sorted](./0769-max-chunks-to-make-sorted.js)|Medium|
 770|[Basic Calculator IV](./0770-basic-calculator-iv.js)|Hard|
 773|[Sliding Puzzle](./0773-sliding-puzzle.js)|Hard|
+775|[Global and Local Inversions](./0775-global-and-local-inversions.js)|Medium|
 783|[Minimum Distance Between BST Nodes](./0783-minimum-distance-between-bst-nodes.js)|Easy|
 784|[Letter Case Permutation](./0784-letter-case-permutation.js)|Medium|
 790|[Domino and Tromino Tiling](./0790-domino-and-tromino-tiling.js)|Medium|

solutions/0775-global-and-local-inversions.js

@@ -0,0 +1,31 @@
+/**
+ * 775. Global and Local Inversions
+ * https://leetcode.com/problems/global-and-local-inversions/
+ * Difficulty: Medium
+ *
+ * You are given an integer array nums of length n which represents a permutation of all the
+ * integers in the range [0, n - 1].
+ *
+ * The number of global inversions is the number of the different pairs (i, j) where:
+ * - 0 <= i < j < n
+ * - nums[i] > nums[j]
+ *
+ * The number of local inversions is the number of indices i where:
+ * - 0 <= i < n - 1
+ * - nums[i] > nums[i + 1]
+ *
+ * Return true if the number of global inversions is equal to the number of local inversions.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var isIdealPermutation = function(nums) {
+  for (let i = 0; i < nums.length; i++) {
+    if (Math.abs(nums[i] - i) > 1) {
+      return false;
+    }
+  }
+  return true;
+};