Hi,

For this problem I have a set S with initially 0 strings.

There are three types of queries:

1. Add a string to set S with id = queryId.
2. Remove the string from set S with id = removeId.
3. Read a string M and print all strings in set S that have M as substring.

Let N be the size of S.

How would I solve this efficiently? I hope to reach a complexity of O((length of search string) + N) for query 3 and O(length of string) for queries 1 and 2. Is this possible, with for example a suffix tree?

I would like to use this for a fast search engine for a (big) data set that is changing dynamically.

Hello everyone,

I have created a web-based application using the uDebug API and Judge0 API that allows users to test their code for correctness.

The application allows users to enter the code of their solution in several programming languages:

They are then able to search for any competitive programming problem of one of the following online judges:

• ACM-ICPC Live Archive
• CATS Online Judge
• Dev Skill
• URI Online Judge
• Facebook Hacker Cup
• Google Code Jam
• Light Online Judge
• Toph
• UVa Online Judge

Input can be provided either by using input from the input table that contains inputs provided by uDebug users, or by inserting a custom input. The calculated outputs of the provided user code and the correct code of uDebug are then compared to one another, allowing users to spot any differences:

It is also possible to insert code for a random input generator to feed random input for a certain amount of iterations.

I hope this application will be helpful for people that are active on the above mentioned judges. Any feedback is welcome.