Categorygithub.com/Elven9/my-leetcodeProblems211
package
0.0.0-20241209140624-9fce2a725d55
Repository: https://github.com/elven9/my-leetcode.git
Documentation: pkg.go.dev
Overview
Dependencies
1
Dependents
0

# README

Design Add and Search Words Data Structure

Solution IdxTime ComplexitySpace ComplexityComment
1Worst Case: 26 ^ n..TLE
2Recursion..Recursion is Faster than Stack Version ...

It seems like when the depth of recursion is less than some degree (25 in this case), the computational cost of the stack-version dfs is far more than recursive-version dfs.

TODO: Find this "degree"