InterviewBit
InterviewBit copied to clipboard
Collection of Abhishek Agrawal's gists solutions for problems on https://www.interviewbit.com
Updating the --i to ++i in the last loop.
updated solution for +..34 testcase
if ( A.length() == 1) { result = A; return result; } above code can be added.
Accepted solution screenshot : 
with TrieNode implimentation inside.
Also made the program non-recursive