Join the social network of Tech Nerds, increase skill rank, get work, manage projects...
 
Node is saved as draft in My Content >> Draft

  • To find all meaningful sub-strings in a string in least time complexity.

    @avishq
    Recommendations Offline Message

    • 0
    • 0
    • 0
    • 0
    • 0
    • 0
    • 0
    • 0
    Answer it

    Hi folks,

    Can anybody tells me the logic to find all the possible meaningful sub-string from a string for example let my string be "abhishek" then the possible sub-strings from "abhishek" are "hi", "his", "she" & "he" where each one them has some meaning associated. Is there any way to find these sub-strings with least time complexity? Is there any way to solve this problem by dynamic programing?

    Note : We can maintained a dictionary for references using any data structure as per our convenience.
    I am adding some more examples 

    Source String    Possible Sub-Strings
"manish"         "man", "an"
"sachin"         "chin", "hi", "in"
"antin"          "an" , "ant", "tin", "tiny", "in"

    C
    Answer it

 0 Answer(s)

Sign In
Forgot Password?
                           OR                           
Create an account !!
                           OR                           
Register

Sign up using

                           OR                           
Forgot Password
Fill out the form below and instructions to reset your password will be emailed to you:
Reset Password
Fill out the form below and reset your password: