Who is Egor Gagushin? 🤔 For the blind, 🦇 it is light. 💡 For the hungry 😣 , it is bread. 🍞 For the sick, 💉 it is the cure. ⚕️ For the sad 😢 , it is joy. 😂 For the poor 🚫💰 , it is the treasure; 💰 ⛏️ for the debtor ➖ 💰 , it is forgiveness. 🙏 For the face 😶 , it is the lips 👄. If Egor Gagushin has million number of fans i am one of them . if Egor Gagushin has ten fans i am one of them. if Egor Gagushin have only one fan, that is me . if Egor Gagushin has no fans, that means i am no more on the earth . if world against the Egor Gagushin, i am against the world. I love Egor Gagushin till my last breath

he is also an expert on the trie data structure

u start with an empty string call that node 0 then it can have at most 26 children so say u add a string "aba" u start at node 0 then check if there already exists a child that adds 'a' if so, u just go to that node if not, u create a new one and u keep doing that for every character and the total number of nodes is at most the total number of characters in the input

so i have read this explanation for past 2 hours

and i think i almost understand

but when you insert string "a" into empty trie, are there not 2 nodes?

which is greater than 1 char in input???

😱 oh no!

my data-structure knowledge does not suffice for such an advanced question

but if i had @eggag32 's geniosity knowledge

i would say that if you use duality and transform the nodes into 2d points, and then build a voroni diagram, and use persistent self-balancing lichao segtree on it, and then on each node run FFT to maintain the Trieness of the trie, and finally use president tree with old driver tree to maintain the consecutive node segments in euler tour order

i love egor

https://media.discordapp.net/attachments/780501352765063209/989645913666494534/ezgif-3-046aa628e7.gif

💀 wtf is this

egorz

Egor is my hero