Give test cases for which wrong

#1
#2

Hey Sparsh!
when no word exists with given prefix then instead of printing “No suggestions”, print nothing and insert that prefix into your trie

#3


updated code wo map isliye use kiya taki lexicographically sahi aaye aab tle kyu aa rha h?

#4

It should be because of use of unordered_map!
use an array of size 26 instead as characters belongs to [a,z]
Also don’t use map! things can be done without using a map as well.

#5

without map if i print then guarantee nhi h ki lexo sort aaye

#6

if you do dfs in order, its guaranteed that output is sorted!

#7


for input:
4
pet
peter
rat
rack
5
rpet
pet
r
rac
rat

#8

For this use of array is necessary! (instead of unordered_map)

#9

if we write only map instead of unordered_mao then it is in order cant be this better way.

#10


bhai ismein changes kar ke bata do mujhe nhu aa rh samjh

#11

See what I’m trying to say is that you use array instead of unordered_map!
let it be
node *children[26];
mark every value as NULL initially,
insert/search operation follows as ((temp->children[s[i]-‘a’]))
now when you do dfs then it is guaranteed to be sorted as you visit from 0 to 25 (or ‘a’ to ‘z’)
try to implement this.
If you still face problem then I can share my code for reference in which I implemented same.
problems with map is increased time complexity!

#12

not able to code after trying can u help.

#13

https://ide.codingblocks.com/s/279665
take a look at it!

#14

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.