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

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;
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;
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;
}*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;
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)```
```

## Reverse a doubly linked list

This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.

## Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

## Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

## Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your \$inOrder* func

## Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

## Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.