"Building Trie cost time O(m * m * n)" This statement is incorrect. Building is O(m * n). And search is O(m). So total is O(m * n) + O(m) ; which is eventually O(m * n)
And space complexity is O ( 24 * 3 * m ) => O(m)
Thank you for the feedback, I will really have a look into this.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
"Building Trie cost time O(m * m * n)"
This statement is incorrect. Building is O(m * n). And search is O(m).
So total is O(m * n) + O(m) ; which is eventually O(m * n)
And space complexity is O ( 24 * 3 * m ) => O(m)
Thank you for the feedback, I will really have a look into this.