Well this is my first post using Buffer, dont really know what to share but I'm trying to write some blog post soon let's all hope I do sth soon hehe. 😗
I'll probably publish the post on medium, substack and wordpress? ✍️ Medium: [@produde](https://t.co/RKUUk0rqke)
@OpenAI Hey is there a way I can reach out to you guys? Im trying to try out chat GPT for my own work (I'm a CS student) but I can't register due to my country isn't supported (Vietnam).
Sorry for tagging directly, but I cant reach you through the help center😭
@neetcode1 It's true that both reduces to O(nm) but im trying to figure out (definitively) why the sorted solution on leetcode is faster than our more optimal hashmap approach.
I just cant see where the "times 26" comes from when we only have two loops: m and n
Here's my thought process
@neetcode1 Can you help me with your video? I went through the WHOLE comment section + leetcode discussion + stackoverflow with no good explanations😭
https://t.co/bDL4haUb07
Why is complexity of HashMap implementation O(m*n* 26) and not O(m*(n+26))?
Love your channet btw 🥳