Add solution #1163

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,161 LeetCode solutions in JavaScript
+# 1,162 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -909,6 +909,7 @@
 1160|[Find Words That Can Be Formed by Characters](./solutions/1160-find-words-that-can-be-formed-by-characters.js)|Easy|
 1161|[Maximum Level Sum of a Binary Tree](./solutions/1161-maximum-level-sum-of-a-binary-tree.js)|Medium|
 1162|[As Far from Land as Possible](./solutions/1162-as-far-from-land-as-possible.js)|Medium|
+1163|[Last Substring in Lexicographical Order](./solutions/1163-last-substring-in-lexicographical-order.js)|Hard|
 1189|[Maximum Number of Balloons](./solutions/1189-maximum-number-of-balloons.js)|Easy|
 1200|[Minimum Absolute Difference](./solutions/1200-minimum-absolute-difference.js)|Easy|
 1206|[Design Skiplist](./solutions/1206-design-skiplist.js)|Hard|

solutions/1163-last-substring-in-lexicographical-order.js

@@ -0,0 +1,33 @@
+/**
+ * 1163. Last Substring in Lexicographical Order
+ * https://leetcode.com/problems/last-substring-in-lexicographical-order/
+ * Difficulty: Hard
+ *
+ * Given a string s, return the last substring of s in lexicographical order.
+ */
+
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var lastSubstring = function(s) {
+  let i = 0;
+  let j = 1;
+  let k = 0;
+  const n = s.length;
+
+  while (j + k < n) {
+    if (s[i + k] === s[j + k]) {
+      k++;
+    } else if (s[i + k] < s[j + k]) {
+      i = Math.max(i + k + 1, j);
+      j = i + 1;
+      k = 0;
+    } else {
+      j += k + 1;
+      k = 0;
+    }
+  }
+
+  return s.substring(i);
+};