in the video,it is given that we can optimize by making a different hash map as soon as we get to a new common prefix but the complexity of this structure is not good.please tell how to implement this kind of structure
in which we create a different hash map as soon as we get a new common prefix.i am not able to get it on my own
Hashmap implementation issue
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.