**No Prefix Set**

### Problem Statement :

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Description Complete the noPrefix function in the editor below. noPrefix has the following parameter(s): - string words[n]: an array of strings Prints - string(s): either GOOD SET or BAD SET on one line followed by the word on the next line. No return value is expected. Input Format First line contains n, the size of words[]. Then next n lines each contain a string, words[ i ] . Constraints 1 <= n <= 10^5 1 <= the length of words[i] <= 60 All letters in words[ i ] are in the range 'a' through 'j', inclusive.

### Solution :

` ````
Solution in C :
In C ++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
struct node {
char end;
struct node * next[10];
} head;
int check_prefix(string str){
struct node *nptr = &head;
int i;
int index;
int new_node = 0;
for(i=0;i<str.size();i++){
index = ((int)str[i])%'a';
if(nptr->next[index]==0) {
nptr->next[index] = new node;
nptr = nptr->next[index];
memset (nptr,0,sizeof(struct node));
new_node = 1;
}
else {
nptr = nptr->next[index];
}
if(nptr->end == 1) {cout <<"BAD SET"<<endl; return 1;}
}
if(new_node == 0) {cout <<"BAD SET"<<endl; return 1;}
nptr->end = 1;
return 0;
}
int main() {
string str;
int n;
int i;
cin >>n;
for (i=0;i<n;i++){
cin >> str;
if (check_prefix(str)) break;
}
if(i!=n) cout << str <<endl;
else cout << "GOOD SET" <<endl;
return 0;
}
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
class Trie{
char c;
boolean isEndOfString;
Trie []children;
}
public class Solution {
Trie root;
void input(){
Scanner sin = new Scanner(System.in);
int N = sin.nextInt();
root = new Trie();
root.children = new Trie[26];
boolean flag = false;
for(int i = 0; i < N; i++){
String s = sin.next();
if(!flag)
flag = insert(s);
}
if(!flag){
System.out.println("GOOD SET");
}
}
Trie newNode(char c){
Trie newNode = new Trie();
newNode.c = c;
newNode.isEndOfString = false;
newNode.children = new Trie[26];
return newNode;
}
boolean insert(String s){
Trie ptr = root;
boolean flag = false;
int i = 0;
int ctr = 0;
for(; i < s.length(); i++){
char c = s.charAt(i);
int index = (int)c - 97;
if(ptr.children[index] == null){
Trie newNode = newNode(c);
ptr.children[index] = newNode;
ptr = ptr.children[index];
}
else{
ctr++;
ptr = ptr.children[index];
if(ptr.isEndOfString){
flag = true;
break;
}
}
}
if(i == s.length()){
ptr.isEndOfString = true;
}
if(flag){
System.out.println("BAD SET");
System.out.println(s);
}
else if(ctr == s.length()){
System.out.println("BAD SET");
System.out.println(s);
flag = true;
}
return flag;
}
public static void main(String[] args) {
Solution s = new Solution();
s.input();
}
}
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
typedef struct node
{
int is_word;
struct node* children[10];
}*NODE;
NODE head=NULL;
NODE GetNewNode()
{
NODE temp = (NODE)malloc(sizeof(struct node));
temp->is_word = 0;
int i;
for(i=1;i<=5;i++)
temp->children[i]=NULL;
return temp;
}
void Insert(char word[])
{
int digit;
//printf("%d\n",rev);
NODE temp;
if(head==NULL)
{
head = GetNewNode();
}
temp=head;
int i=0;
while(word[i]!='\0')
{
digit = word[i];
digit=digit-97;
if(temp->children[digit]==NULL)
{
temp->children[digit]=GetNewNode();
}
temp = temp->children[digit];
i++;
}
temp->is_word=1;
}
int Search(char word[])
{
int digit,found=0;
NODE temp = head;
if(temp==NULL)return 0;
int i=0;
while(word[i]!='\0')
{
digit=word[i];
digit=digit-97;
if(temp->children[digit]==NULL)
return 0;
temp=temp->children[digit];
if(temp->is_word==1)return 1;
i++;
}
if(word[i]=='\0')//Check if we have scanned all characters....if we have, then prefix present
found=1;
return found;
}
int main(void)
{
char words[61];
int number;
int bad_set=0;
scanf("%d",&number);
while(number--)
{
scanf("%s",words);
if(Search(words)==1)
{
printf("BAD SET\n%s",words);
bad_set=1;
break;
}
else
Insert(words);
}
if(bad_set==0)
printf("GOOD SET");
}
In Python3 :
class solution:
def checkSET(self, strs):
trie = dict()
for cstr in strs:
curr = trie
for ch in cstr:
if ch not in curr:
curr[ch] = dict()
curr = curr[ch]
if '_end' in curr:
return cstr
if len(curr) > 0:
return cstr
curr['_end'] = ''
return ''
n = int(input())
strs = []
for i in range(n):
strs.append(input())
sol = solution()
ret = sol.checkSET(strs)
if ret == '':
print('GOOD SET')
else:
print('BAD SET')
print(ret)
```

## View More Similar Problems

## Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →## Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →## Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →## Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →## Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →## Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →