Scribd Logo
Upload

Welcome to Scribd!

  • Maximizing Uniqueness: Lexicographically Smallest - Sample Input Sample Output

    Uploaded by

    AnimeshFatehpuria
    2 views1 page
    Mind Boggling Computer Science Problem on Strings and Data Structures.

    Original Title

    Maximizing Uniqueness

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Mind Boggling Computer Science Problem on Strings and Data Structures.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views1 page

    Maximizing Uniqueness: Lexicographically Smallest - Sample Input Sample Output

    Uploaded by

    AnimeshFatehpuria
    Mind Boggling Computer Science Problem on Strings and Data Structures.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    MAXIMIZINGUNIQUENESS

    GivenaStringofNcharacters(1<=N<=500000)
    youhavetofindthesubstringofitwhichcontainsthe
    mostnumberofdistinctcharacters.Ifthereexists
    multiplesuchsubstrings,youshouldconsiderthe
    onewiththesmallestlength.Ifthereexistsmultiple
    solutionsofthesamelength,choosetheonewhichis
    lexicographicallysmallest.
    Yourtaskistoprinttheoptimalsubstring.
    SampleInputSampleOutput
    ABBCABCABC
    ABBBBBCABBBBBC
    ExplanationofSampleCases:
    Inthefirstcase,thesubstringABCistheshortest
    substringthatconsistsofthreedistinctcharactersand
    it'slengthisthree.NotethatCAB,BCAarealso
    possiblebutABCshouldbeprintedasitis
    lexicographicallysmallest
    Inthesecondcase,theentirestringistheoptimal
    substringconsistingofthreedistinctcharacters.

    You might also like