Digital Dictionary

#34

to bhaiya ese karr skte hai ,
jese abhi aapne vector dia ,
usme hmare paas hashmap hoga…
to maanlo mai temp p khada hu ,
to har ek temp p aake jese isme vector traverse kia vese usme hashmap traverse karenge shayad?

#35

shayad nahi , aisa hi karenge . … . . . . . .

1 Like
#36

lekin pta ni implementation m confuse hora mai , trie ke case m

#37 
class node
{
	char data;
	unordered_map<char,node*> children;
	bool terminal;

};

is baar iske liye function likh ke batao tumhe root pointer given hai
1 Like
#38


dekhna bhaiya , esa kuch?

#39

check karo ->

almost sahi tha.

1 Like
#40

bhaiya jab terminal mil jaayega tb firse str ko khaali bhi to karna hoga or i ko 0 karna hoga

#41

ya fir recursion ke vaapsi ke vakt str ko khali krte jaaye character by character

#42

jab recusion vaapis aayega tab index purana wala hi rahega(jo call karte time tha) isilye hame kuch alag se nahi karna

ab try karo is problem ko ho jaana chaiye

1 Like
#43

chalo thik hai bhaiya , krke dekhta hu

#44

Bhaiya dekhna , kaha dikkat aa rhi hai?

#45

bro tum c++ string use kar rahe ho(0 size ki), uski jagah pe c string(char array) use karo.

by defualt c++ string ki size zero hoti hai, aur phir ham uspe indexing nahi laga sakte.

1 Like
#46

dekhna bhaiya , kuch dikkat hai shayad…
cstring to kar dia

#47
#48

@CODER_JATIN
aise bol raha tha bhai ->

1 Like
#49

bhaiya jab (temp->terminal) true hoga tab str[i]=temp->data bhi to daalenge?

#50

bro usko pehle hi daal diya tha ,call karne se pehel ss

line 78

1 Like
#51

acha okay bhaiya ,
jese ab isko lexicographically print krana to , vector mai daal du ?

fir vector ko sort krdu?

#52

nahi maine ,unordered map ko map se replace kar diya hai.

to wo apne aap lexicographical order hi generate karega

1 Like
#53

okay bhaiya ,
thank you so much :slight_smile: