Trie implementation

#1


here is the code code for trie insertion and searching can u plz tell me what steps should i add in it in order to find index and no of occurance of pattern in given text…

#2

you can make an unordered or ordered map for keeping track of index and no of occurrence of the pattern you are following

#3

You can take this code for reference it will help you in understanding :slight_smile:

#4

actually i dont want use map can u plz update in my code

#5

I don’t think soo without map this an be done specially in making of a trie.
Though if i will get any intuition i will apply and let you know :slightly_smiling_face:

#6

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.