Goldman Sachs OA
Anonymous User
5926
  1. Given a string, find the lexicographically largest substring. (Can't quite remember description, see example below)

eg)

  • abcdefabc --> fabc
  • zabcdzt --> zt
  • dcba --> dcba
Comments (6)