I am exploring a problem where I have to keep track of the number of strings that contains a certain substring. I was wondering how do I use an AVL tree to solve it.

Here is the problem/question: https://open.kattis.com/problems/nicknames