Two First Names

Question

A person has two first names if their last name is also a common first name. You are tasked with determining which full names in a list are two first names.

John Smith
John Doe
Luke Ryan
Ryan Johnson
Jenna Jackson
Tom John

Any name that occurs in the first name column is potentially a first name. If the number of occurrences of the name in the first name column is greater than the number of occurrences in the last name column, it is definitely a first name.

In the above list, John appears twice in the first names and once in the last names so it is definitely a first name. Ryan appears once in the first and once in the last so it is (probably) a first name.

Therefore, Tom John definitely has two first names and Luke Ryan probably does.

Given the above list, your code should output the follow:

Luke Ryan has two first names
Tom John definitely has two first names

Input

As mentioned above, your code will take in a list of full names (from standard input, one per line) separated by spaces. Names can include hyphens or apostrophes, but you will never be given a first or last name that includes spaces (ie no Liam De Rosa, but Liam De-Rosa or Liam De'Rosa are fair game. In other words, names will match [-'A-Za-z]+.

Each full name will be unique (ie John Smith will not appear twice).

Output

Print full names names (once per line) followed by either has two first names or definitely has two first names if they meet the criteria above. Names should only be printed once.

Names that are not two first names do not need to be printed.

You must preserve the case and special characters of the name.

Examples

Input

Madison Harris
Riley Hudson
Addison Hills
Riley Phillips
Scott Hill
Levi Murphy
Hudson Wright
Nathan Baker
Harper Brooks
Chloe Morris
Aubrey Miller
Hudson Lopez
Samuel Owen
Wyatt Victoria
Brooklyn Cox
Nathan Murphy
Ryan Scott

Output

Riley Hudson definitely has two first names
Ryan Scott has two first names

Input

Owen Parker
Daniel Hall
Cameron Hall
Sofia Watson
Mia Murphy
Ryan Jones
Emily Ramirez

Output

[no output]

Input

Olivia Robinson
Jacob van-Dyke
Jacob Ella
Brayden De'Rosa
Levi Brook
Brook Bella
Ella Hill
Ella Anderson
Brook-Anne van-Dyke

Output

Jacob Ella definitely has two first names
Levi Brook has two first names

Notes and Scoring

This is code golf. Lowest score (bytes) wins.
standard loopholes apply.

Good luck!

Johnson would be different than John. Names must match exactly. — Moose, Commented Oct 19, 2017 at 15:43
How we choose between definitely has two first names and has two first names ? It can be always one of those? — Rod, Commented Oct 19, 2017 at 15:46
Only display definitely if the the name occurs more times in the first-name column than the last-name column. This case overrides, so only display definitely has two first names. Check out the examples. — Moose, Commented Oct 19, 2017 at 15:49
How flexible is input format? Can it be an array of strings, one per person? Or a 2D array of strings? — Luis Mendo, Commented Oct 19, 2017 at 16:08

Roberto Graham · Accepted Answer · 2017-10-20 09:01:52Z

6

Java (OpenJDK 8), 238 222 221 220 212 bytes

l->{for(String n:l){int k=0,j=0,q=0;for(String b=n.split(" ")[1];k<l.length;j+=l[k++].matches(b+" .*")?1:0)q+=l[k].endsWith(" "+b)?1:0;if(j>0)System.out.println(n+(j>q?" definitely":"")+" has two first names");}}

Try it online!

edited Oct 20, 2017 at 9:01

answered Oct 19, 2017 at 16:05

Roberto Graham

1,3357 silver badges10 bronze badges

\$\begingroup\$ Nice! You can collapse your initializations to k=j=q=0. Also, it won't save you any bytes but you could replace the latter x+=y?1:0 with if(y)x++. If you like to optimize readability after length like I do, that's probably the way to go. \$\endgroup\$
– Jakob
Commented Oct 20, 2017 at 5:05
\$\begingroup\$ You can save 8 bytes by putting the String and int directly (in the for-loop): l->{for(String n:l){int k=0,j=0,q=0;for(String b=n.split(" ")[1];k<l.length;j+=l[k++].matches(b+" .*")?1:0)q+=l[k].endsWith(" "+b)?1:0;if(j>0)System.out.println(n+(j>q?" definitely":"")+" has two first names");}} \$\endgroup\$
– Kevin Cruijssen
Commented Oct 20, 2017 at 6:24

Add a comment |

ShreevatsaR · Accepted Answer · 2017-10-21 03:09:03Z

6

Python 2, 141 137 132 130 bytes

-2 bytes thanks to @JonathanFrech

n=map(str.split,input())
for f,l in n:
 c=cmp(*[x.count(l)for x in zip(*n)])
 if~c:print f,l,'definitely '*c+'has two first names'

Try it online!

edited Oct 21, 2017 at 3:09

ShreevatsaR

1,0858 silver badges20 bronze badges

answered Oct 19, 2017 at 17:35

ovs

60.6k3 gold badges47 silver badges161 bronze badges

\$\begingroup\$ I think -c<1 can be ~c, as c does not appear to ever get positive. \$\endgroup\$
– Jonathan Frech
Commented Oct 20, 2017 at 21:05

Add a comment |

Robert Benson · Accepted Answer · 2017-10-19 18:45:08Z

3

AWK, 127 123 bytes

{a[$1]++
b[L[++X]=$2]++
N[X]=$0}END{for(;++i<=X;)if(A=a[L[i]])print N[i],(b[L[i]]<A?"definitely ":"")"has two first names"}

Saving 1 byte by not using the built-in NR value.

Try it online!

edited Oct 19, 2017 at 18:45

answered Oct 19, 2017 at 18:29

Robert Benson

1,63711 silver badges13 bronze badges

Add a comment |

Xcali · Accepted Answer · 2017-10-19 18:46:11Z

3

Perl 5, 120 118 + 2 (`-al`) = 120 bytes

$f{$F[0]}++;$l{$k{$_}=$F[1]}++}{map{print$_.' definitely'x($f{$t}>$l{$t})." has two first names"if$f{$t=$k{$_}}}keys%k

Try it online!

edited Oct 19, 2017 at 18:46

answered Oct 19, 2017 at 18:22

Xcali

16.2k2 gold badges15 silver badges39 bronze badges

Add a comment |

Value Ink · Accepted Answer · 2017-10-20 04:10:11Z

3

Ruby, 105 129 bytes

+24 bytes because I missed part of the spec

->a{a.map{|e|l=e[r=/\S+$/];i=a.count{|n|n[/\S+/]==l};e+"#{' definitely'if i>a.count{|n|n[r]==l}} has two first names"if i>0}-[p]}

Try it online!

edited Oct 20, 2017 at 4:10

answered Oct 19, 2017 at 19:08

Value Ink

12.6k1 gold badge17 silver badges42 bronze badges

Add a comment |

TFeld · Accepted Answer · 2017-10-20 08:17:33Z

3

Python 2, 140 127 122 131 bytes

N=map(str.split,input())
F,L=zip(*N)
for f,l in N:
 if l in F:print f,l,'definitely '*(F.count(l)>L.count(l))+'has two first names'

Try it online!

edited Oct 20, 2017 at 8:17

answered Oct 20, 2017 at 7:08

TFeld

19.9k3 gold badges20 silver badges63 bronze badges

Add a comment |

David Smith · Accepted Answer · 2017-10-19 23:22:43Z

2

05AB1E, 144 bytes (Work in progress)

|vy#Dθˆн})©gF®®NèQO¯®NèQO-D®¯NèQO¯¯NèQO-D.À>0›s>0›&i0›s0›&i®Nè" "¯Nè" defínítely has two fírst names"J,ë®Nè" "¯Nè" has two fírst names"J,}ë\\}}´

answered Oct 19, 2017 at 23:22

David Smith

413 bronze badges

5

\$\begingroup\$ No it works, I am just working on reducing the number of bytes \$\endgroup\$
– David Smith
Commented Oct 20, 2017 at 0:09

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

05AB1E, 53 51 bytes

|UXv“€°‚•€ÛŒî“D„´Î ì)yð«ìõ¸ìXð¡øεy#θQO}`.S>sèˆ}¯õK»

Try it online!

Explanation

|                                                       # Take inputs as array
 UX                                                     # Store in X and push X to stack
   v                                          }         # For each name, do
    “€°‚•€ÛŒî“D                                         #   Push "has two first names" twice
               „´Î ì                                    #   Prepend "definitely " to one of those
                    )yð«ì                               #   Wrap both strings in an array and prepend (name + " ") to each
                         õ¸ì                            #   Prepend " " to array
                            Xð¡øεy#θQO}`                #   Get occurences in input first and last names
                                        .S>             #   0 for not first name, 1 for first name and 2 for definitely first name
                                           sèˆ          #   Get string at that index and push to global array
                                               ¯õK»     # Output global array, 1 string per line

Or 51 49 bytes, assuming standard I/O Rules (input and output as arrays)

UXv“€°‚•€ÛŒî“D„´Î ì)yð«ìõ¸ìXð¡øεy#θQO}`.S>sèˆ}¯õK

Try it online!

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

PHP, 172 bytes

for(;$s=$argv[++$i];$f[$a]++,$l[$n[]=$b]++)[$a,$b]=explode(" ",$s);for(;$b=$n[+$k++];)$f[$b]<$l[$b]||print$argv[$k].($f[$b]>$l[$b]?" definetly":"")." has two first names
";

takes names as separate command line arguments.

Run with -nr or try it online.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Oct 20, 2017 at 8:11

Titus

14.8k1 gold badge24 silver badges41 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

Python 3, 187 bytes

n={}
c=[]
while 1:
 try:a,b=input().split();n[a]=n.get(a,0)+1;n[b]=n.get(b,0)-1;c+=[[a,b]]
 except:[print(a,b,'definitely has two first names'[(n[b]>0)*11:])for a,b in c if n[b]>=0];break

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Oct 19, 2017 at 19:22

mypetlion

8124 silver badges12 bronze badges

Add a comment |

NofP · Accepted Answer · 2017-10-20 00:38:30Z

0

R, 207 bytes

n=readLines("stdin")
s='definitively has two first names\n'
x=matrix(t(unlist(sapply(n,strsplit,' '))),2)
j=1
for(i in n){a=apply(x[2,j]==x,1,sum)
b=a[2]>=a[1]
if(a[1])cat(paste(i,substr(s,14*b,34)))
j=j+1}

Try it online!

answered Oct 20, 2017 at 0:38

NofP

7945 silver badges8 bronze badges

Add a comment |

Neil · Accepted Answer · 2017-10-20 09:33:16Z

0

JavaScript (ES6), 149 bytes

s=>s.replace(/(.*) (.*)\n/g,(_,t,u)=>g(`
${u} `)>1?t+` ${u}${v>g(` ${u}
`)?` definitely`:``} has two first names
`:``,g=u=>v=`
${s}`.split(u).length)

I/O includes trailing newline. Largely inspired by @RobertoGraham's answer.

answered Oct 20, 2017 at 9:33

Neil

177k12 gold badges74 silver badges281 bronze badges

Add a comment |

Laikoni · Accepted Answer · 2017-10-20 20:50:00Z

0

Haskell, 144 140 139 bytes

g.map words.lines
g s=id=<<[n++' ':f++[c|c<-" definitely",t 0>t 1]++" has two first names\n"|[n,f]<-s,let t i=filter(==f)$map(!!i)s,[]<t 0]

Try it online!

edited Oct 20, 2017 at 20:50

answered Oct 20, 2017 at 20:33

Laikoni

26.3k6 gold badges52 silver badges115 bronze badges

Add a comment |

brendan62269 · Accepted Answer · 2017-10-23 17:08:46Z

0

PowerShell, 176 bytes

$n=$args
$s=" has two first names"
$f=$n|%{$_.Split()[0]}
$l=$n|%{$_.Split()[1]}
$i=0
$l|%{switch(($f-match$_).count){{$_-eq1}{$n[$i]+$s}{$_-gt1}{$n[$i]+" definitely"+$s}}$i++}

answered Oct 23, 2017 at 17:08

brendan62269

1012 bronze badges

Add a comment |

Stack Exchange Network

Two First Names

14 Answers 14

Java (OpenJDK 8), 238 222 221 220 212 bytes

Python 2, 141 137 132 130 bytes

AWK, 127 123 bytes

Perl 5, 120 118 + 2 (`-al`) = 120 bytes

Ruby, 105 129 bytes

Python 2, 140 127 122 131 bytes

05AB1E, 144 bytes (Work in progress)

05AB1E, 53 51 bytes

Explanation

Or 51 49 bytes, assuming standard I/O Rules (input and output as arrays)

PHP, 172 bytes

Python 3, 187 bytes

R, 207 bytes

JavaScript (ES6), 149 bytes

Haskell, 144 140 139 bytes

PowerShell, 176 bytes

Your Answer

Not the answer you're looking for? Browse other questions tagged
code-golf
string
or ask your own question.

Hot Network Questions

Two First Names

14 Answers 14

Java (OpenJDK 8), 238 222 221 220 212 bytes

Python 2, 141 137 132 130 bytes

AWK, 127 123 bytes

Perl 5, 120 118 + 2 (-al) = 120 bytes

Ruby, 105 129 bytes

Python 2, 140 127 122 131 bytes

05AB1E, 144 bytes (Work in progress)

05AB1E, 53 51 bytes

Explanation

Or 51 49 bytes, assuming standard I/O Rules (input and output as arrays)

PHP, 172 bytes

Python 3, 187 bytes

R, 207 bytes

JavaScript (ES6), 149 bytes

Haskell, 144 140 139 bytes

PowerShell, 176 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfstring or ask your own question.

Related

Hot Network Questions

Perl 5, 120 118 + 2 (`-al`) = 120 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
string
or ask your own question.