pokeland157's blog

Do I need to learn polynomial hash and string hashing to reach expert?
By pokeland157, history, 5 hours ago, In English

Do I?

  • Vote: I like it
  • +3
  • Vote: I do not like it

»
5 hours ago, # |
← Rev. 2   Vote: I like it +8 Vote: I do not like it

As an expert, I believe that it is not necessary for you to learn hashing so that you reach expert, because only in very few problems hashing is the only way to solve, but for sure it is a useful technique to learn

→ Reply
  • »
    »
    4 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    if you can provide any good resources, it would be very helpful. Thanks

    → Reply
    • »
      »
      »
      4 hours ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      This should be plenty

      → Reply
»
4 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

I've never used hash stuff on CodeForces, so no

→ Reply
»
4 hours ago, # |
  Vote: I like it +6 Vote: I do not like it

Nah. Chances you'd come across such in expert level are pretty rare, and even if so, deterministic alternative (KMP/Z) usually should also be available.

Not to mention, there are a number of other more prevalent topics you could improve on and reap the result.

→ Reply
  • »
    »
    4 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    What are topics can I learn then?

    → Reply
    • »
      »
      »
      4 hours ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Solve some problems, learn how to use binary search.

      → Reply
    • »
      »
      »
      4 hours ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I'd still advise basic binary search and some common sense to crack ad-hocs.

      Extra quirk if using C++: try to learn set/multiset. They're powerful tools for a handful of problems.

      → Reply
      • »
        »
        »
        »
        4 hours ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I know all that stuff, I guess the only thing I can do is solve tons of more problems.

        → Reply
        • »
          »
          »
          »
          »
          4 hours ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Seems like it. Either be faster or more precise with your code logic. That should do.

          → Reply
»
4 hours ago, # |
  Vote: I like it +10 Vote: I do not like it

I dont know either of those and im expert

→ Reply
»
56 minutes ago, # |
  Vote: I like it 0 Vote: I do not like it

nah you dont have to but imo its not a hard concept. I just copy the usaco guide template and treat it like a black box. Moreover it may be useful in solving some problems, like I've "cheesed" some string hash problems that wouldve been impossible to come up otherwise. Just knowing that you can compare two substrings fast and what not is always good ig.

→ Reply