bugl
bugl
HomeLearnPatternsPathsSearchPremium
HomeLearnPatternsPaths
MediumArrays & HashingLC 833

Find And Replace in String

You are given a 0-indexed string s that you must perform k replacement operations on. The replacement operations are given as three 0-indexed parallel arrays, indices, sources, and targets, all of length k. To complete the ith replacement operation:

  1. Check if the substring sources[i] occurs at index indices[i] in the original string s.
  2. If it does not occur, do nothing.
  3. Otherwise if it does occur, replace that substring with targets[i]. For example, if s = "abcd ", indices[i] = 0, sources[i] = "ab ", and targets[i] = "eee ", then the result of this replacement will be "eeecd ". All replacement operations must occur simultaneously, meaning the replacement operations should not affect the indexing of each other.
Asked at 3 companies
GoogleLinkedinMicrosoft
Hints
  • 1.Think about which data structure fits best
  • 2.Consider the time complexity of your approach
  • 3.Look for patterns in the constraints
LeetCode