report VI VI EN
Register | Login
  • HOME
  • PROBLEMSET
  • ROADMAP
  • COMPETITION
  • TOPIC
  • RANKING
  • GUIDE
  • MASHUP
  • ABOUT
  • CONTACT
Module Hash a set

Hash a set

**Frequency: 4/10** Different from string hashing, this method is used to hash sets and multisets (e.g. $\\{1, 2, 2\\}$ is equivalent to $\\{2, 1, 2\\}$).

Resources

- [Codeforces Blogs: XOR Hashing [TUTORIAL]](https://codeforces.com/blog/entry/85900)

Problems

Prefix equality 123 / 136 1500
Good subarray 108 / 117 1600
Brewing potion 6 66 / 71 1700
Mino 25 / 29 1800
Traffic system 61 / 68 2000
Odd 25 / 63 2100

Data structure

  • Sweep Line
  • Introduction to Trie
  • Square root decomposition

Tree

  • Rerooting
  • Small-to-large
  • Heavy-light decomposition

Graph

  • Strongly connect component
  • Articulation point and bridge
  • Bipartite Matching

Dynamic Programming

  • Digit DP
  • Matrix multiplication

Hashing

  • Hash a set

Others

  • Divide and conquer

Geometry

  • Geometry

Binary search

  • Parallel binary search

Others

  • Additional Problems (Level 5)