Trie | (Delete)
Medium Accuracy: 29.21% Submissions: 4024 Points: 4

Trie is an efficient information retrieval data structure. This data structure is used to store Strings and search strings, String stored can also be deleted. Given a Trie root for a larger string super and a string key, delete all the occurences of key in the Trie.

Example 1:

Input:
N = 8
super = "the a there answer any by bye their" 
key = "the" 

 

Your Task:

Complete the function deleteKey() to delete the given string key.The String key if exists in the larger string super, must be deleted from Trie root. The larger string super contains space separated small strings. And if the string is deleted successfully than 1 will be printed.
If any other string other than String A is deleted, you will get wrong answer.

 

Constraints:
1≤ T ≤200
1≤ N, |A| ≤20

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Trie | (Delete)

Output Window