3410.js

/** ------------------------------------------------------------------------------
 * 
 * 3410. Maximize Subarray Sum After Removing All Occurrences of One Element
 * Topics: DP, Segment Tree
 * https://leetcode.com/problems/find-the-lexicographically-largest-string-from-the-box-i/description/?envType=daily-question&envId=2025-06-04
 * 
 ------------------------------------------------------------------------------ */
var lastSubstring = function (s) {
  let i = 0,
    j = 1,
    n = s.length
  while (j < n) {
    let k = 0
    while (j + k < n && s[i + k] === s[j + k]) {
      k++
    }
    if (j + k < n && s[i + k] < s[j + k]) {
      let t = i
      i = j
      j = Math.max(j + 1, t + k + 1)
    } else {
      j = j + k + 1
    }
  }
  return s.substring(i, n)
}

var answerString = function (word, numFriends) {
  if (numFriends === 1) {
    return word
  }
  let last = lastSubstring(word)
  let n = word.length,
    m = last.length
  return last.substring(0, Math.min(m, n - numFriends + 1))
}

console.log()