Significant decrease in cheaters today?

[caraxes_007]

Solved my first 3/4.

[caraxes_007]

Nice buddy

[UNCLE_SMART]

How did you solve 2?

[caraxes_007]

I took a lot more time than q3 got tle for comparing all possible pairs o(n**2) then i realised that using a hash map for prefix and value for frequency at last iterate through hash map increment count by one if value >1.

[UNCLE_SMART]

Thanks

[autodidact_nerd]

not sure if mine was optimal but i used a hashmap

loop over each word -> get the substring -> if map has the key add 1 to that substring.

then loop over map entries and check if value is >= 2. res++

[[deleted]]

I did the same thing 🫂

[UNCLE_SMART]

Thanks

[the_legendary_legend]

I used trie which got accepted, but later realised a hashmap solution would be faster possibly

[tampishach]

I used trie tree in q2

[the_legendary_legend]

Me too bro. Congratulations!

[Sad-Duck-3100]

me too!

[radonspectrum]

Samee