In the context of the longest common substring problem, what does "substring" refer to?

  • A contiguous sequence of characters within a string.
  • A sequence of characters obtained by rearranging the characters of a string.
  • A sequence of characters that appears exactly once in a string.
  • Any sequence of characters, regardless of their arrangement, within a string.
In the context of the longest common substring problem, a "substring" refers to a contiguous sequence of characters within a string. It can be of any length and must appear in the same order as it does in the original string.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *