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];

int check_prefix(string str){
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(s);
}
else if(ctr == s.length()){
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 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;
{
}
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;

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;
scanf("%d",&number);
while(number--)
{
scanf("%s",words);
if(Search(words)==1)
{
break;
}
else
Insert(words);
}
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(ret)```
```

Pair Sums

Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v

Lazy White Falcon

White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi

Ticket to Ride

Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o

Heavy Light White Falcon

Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with N nodes and each node's value is initially 0. The problem asks you to operate the following two types of queries: "1 u x" assign x to the value of the node . "2 u v" print the maxim

Number Game on a Tree

Andy and Lily love playing games with numbers and trees. Today they have a tree consisting of n nodes and n -1 edges. Each edge i has an integer weight, wi. Before the game starts, Andy chooses an unordered pair of distinct nodes, ( u , v ), and uses all the edge weights present on the unique path from node u to node v to construct a list of numbers. For example, in the diagram below, Andy

Heavy Light 2 White Falcon

White Falcon was amazed by what she can do with heavy-light decomposition on trees. As a resut, she wants to improve her expertise on heavy-light decomposition. Her teacher gave her an another assignment which requires path updates. As always, White Falcon needs your help with the assignment. You are given a tree with N nodes and each node's value Vi is initially 0. Let's denote the path fr