The time complexity would be O(N * 26^L) and space complexity would be O(NL). where N is the number of input words and L is the length of a single word.
@@SonuRajplus How is it N, if we are doing backtracking the time complexity should definitely include exponential term for n^L. Please explain your time complexity analysis
1. The solution is more or less replica of leetcode solution. You should have cited that atleast. Logic is fine but even the way the code is structured is on same lines. 2. Please avoid using companies' resources (PS: Zomato) as it could land you in trouble.
Great explanation. You have put in efforts creating animations too. Thank you so much.
Awesome explanation.
super. Great explanation !
Great explanation bro... Thank you so much for your effort
Great explanation!
Great Explanation
Explained well. :)
what is the time complexity and space complexity of your solution?
The time complexity would be O(N * 26^L) and space complexity would be O(NL). where N is the number of input words and L is the length of a single word.
@@SonuRajplus How is it N, if we are doing backtracking the time complexity should definitely include exponential term for n^L. Please explain your time complexity analysis
1. The solution is more or less replica of leetcode solution. You should have cited that atleast. Logic is fine but even the way the code is structured is on same lines.
2. Please avoid using companies' resources (PS: Zomato) as it could land you in trouble.