Add solution #1409

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,286 LeetCode solutions in JavaScript
+# 1,287 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1076,6 +1076,7 @@
 1405|[Longest Happy String](./solutions/1405-longest-happy-string.js)|Medium|
 1406|[Stone Game III](./solutions/1406-stone-game-iii.js)|Hard|
 1408|[String Matching in an Array](./solutions/1408-string-matching-in-an-array.js)|Easy|
+1409|[Queries on a Permutation With Key](./solutions/1409-queries-on-a-permutation-with-key.js)|Medium|
 1410|[HTML Entity Parser](./solutions/1410-html-entity-parser.js)|Medium|
 1415|[The k-th Lexicographical String of All Happy Strings of Length n](./solutions/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js)|Medium|
 1422|[Maximum Score After Splitting a String](./solutions/1422-maximum-score-after-splitting-a-string.js)|Easy|

solutions/1409-queries-on-a-permutation-with-key.js

@@ -0,0 +1,33 @@
+/**
+ * 1409. Queries on a Permutation With Key
+ * https://leetcode.com/problems/queries-on-a-permutation-with-key/
+ * Difficulty: Medium
+ *
+ * Given the array queries of positive integers between 1 and m, you have to process all
+ * queries[i] (from i=0 to i=queries.length-1) according to the following rules:
+ * - In the beginning, you have the permutation P=[1,2,3,...,m].
+ * - For the current i, find the position of queries[i] in the permutation P (indexing from 0)
+ *   and then move this at the beginning of the permutation P. Notice that the position of
+ *   queries[i] in P is the result for queries[i].
+ *
+ * Return an array containing the result for the given queries.
+ */
+
+/**
+ * @param {number[]} queries
+ * @param {number} m
+ * @return {number[]}
+ */
+var processQueries = function(queries, m) {
+  const permutation = Array.from({ length: m }, (_, i) => i + 1);
+  const result = [];
+
+  for (const query of queries) {
+    const position = permutation.indexOf(query);
+    result.push(position);
+    permutation.splice(position, 1);
+    permutation.unshift(query);
+  }
+
+  return result;
+};