Comments by "raianmr" (@raianmr2843) on "NeetCode" channel.

  1. Code, Neet Code.
    10
  2. ​ @atomicgray  he's joker irl and just reenacting that scene from the movie calm down
    7
  3. Most problems don't require you to use any particular data structure. This one is different tho. It's the O(1) insertion and lookup that implies a hash map. There many are other data structures that offer similar performance, but for 80% of all problems you don't actually have to stray further than the same old five or more data structures. The DLL part is a bit hard to grasp for newbies like us but long story short, DLLs play nicely with hash maps, more so than others.
    4
  4.  @deviantstar3836  The whole reason we're using a trie with dfs is because storing all the words separately has insane memory implications.
    4
  5. People already get overwhelmed by their own thoughts. This sounds like black mirror material.
    1
  6. lmao same
    1