Space and Runtime Complexity


  • 0
    N

    for all of the trie solutions where they use a vector of trienodes of size 26

    can someone explain the space and runtime complexity. especially of the search method dealing with the case of a . or all .

    Best,

    Nick


Log in to reply
 

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