String chaining by removing a single character


  • 0
    B

    Hey, I was just wondering if anyone knew where this question was on leetcode cause I think it may have a different name then when I was doing the hackerrank.

    The hackerrank called it "string chaining" and the question was basically: given a dictionary of words then for every word, remove a character and see if the resulting String was in the dictionary. If so, then do the same thing with the result otherwise don't continue.

    If anyone else has seen this question then please let me know cause I'd like to test my implementation in Leetcode to see its runtime. Thanks!


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.