report VI VI EN
Register | Login
  • HOME
  • PROBLEMSET
  • ROADMAP
  • COMPETITION
  • TOPIC
  • RANKING
  • GUIDE
  • MASHUP
  • ABOUT
  • CONTACT
Module Introduction to Trie

Introduction to Trie

**Frequency: 6/10** A simple data structure for strings.

Resources

- [GeeksforGeeks: Introduction to Trie](https://www.geeksforgeeks.org/introduction-to-trie-data-structure-and-algorithm-tutorials/)

Problems

Prefix 366 / 373 1200
Compare string 233 / 274 1300
Maximum score 244 / 248 1400
Report 218 / 223 1400
Maximum XOR subarray 252 / 255 1500
Query on string 157 / 173 1600
Language 128 / 130 1600
Poem 75 / 84 1800
Palindrome pairs 69 / 88 1900
Mass XOR queries 90 / 106 2000
XOR-path on tree 35 / 54 2000
The ancient book 24 / 33 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)