Problem 44079. GJam 2017 Kickstart: Leader (Large)

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This Challenge is derived from</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/6304486/dashboard#s=p0\"><w:r><w:t>GJam 2017 Kickstart Leader</w:t></w:r></w:hyperlink><w:r><w:t>. This is the first 61 large cases with spaces in some names.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:hyperlink w:docLocation=\"http://code.google.com/codejam\"><w:r><w:t>Google Code Jam 2017 Qualifier</w:t></w:r></w:hyperlink><w:r><w:t> is March 7, 2017. Typically four challenges with small and large aspects with 27 hours to complete.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The GJam story is to determine the rightful leader. The leader is the person whose name utilizes the most unique letters, spaces do not count, and if two or more people are tied then the leader is the one whom comes first alphabetically, with space preceding A, given a list of 100 or fewer names.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> [names], a cell array of names using only A thru Z; max 100 names</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> [Leader], a string of the name of the leader</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Examples:</w:t></w:r><w:r><w:t> [names] [Leader]; {'ADAM' 'BOBOS' 'AD AM'} ['AD AM']</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For the example the all have have three unique letters. Alpahabetically 'AD AM' precedes 'ADAM' and 'BOBOS'.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Theory:</w:t></w:r><w:r><w:t> Brute force processing appears to be the way. Methodical processing and function usage can minimize code size.</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/6304486/scoreboard#vf=1\"><w:r><w:t>GJam Kickstart solutions(C++,Python)</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

This Challenge is derived from <a href = "http://code.google.com/codejam/contest/6304486/dashboard#s=p0">GJam 2017 Kickstart Leader</a>. This is the first 61 large cases with spaces in some names.<a href = "http://code.google.com/codejam">Google Code Jam 2017 Qualifier</a> is March 7, 2017. Typically four challenges with small and large aspects with 27 hours to complete.The GJam story is to determine the rightful leader. The leader is the person whose name utilizes the most unique letters, spaces do not count, and if two or more people are tied then the leader is the one whom comes first alphabetically, with space preceding A, given a list of 100 or fewer names.Input: [names], a cell array of names using only A thru Z; max 100 namesOutput: [Leader], a string of the name of the leaderExamples: [names] [Leader]; {'ADAM' 'BOBOS' 'AD AM'} ['AD AM']For the example the all have have three unique letters. Alpahabetically 'AD AM' precedes 'ADAM' and 'BOBOS'.Theory: Brute force processing appears to be the way. Methodical processing and function usage can minimize code size. <a href = "http://code.google.com/codejam/contest/6304486/scoreboard#vf=1">GJam Kickstart solutions(C++,Python)</a>.

Solve

Solution Stats

17 Solutions
9 Solvers

Last Solution submitted on Jun 14, 2020

Last 200 Solutions

Problem Recent Solvers9

Problem Tags

Problem 44079. GJam 2017 Kickstart: Leader (Large)

Solution Stats

Last 200 Solutions

Problem Recent Solvers9

Suggested Problems

More from this Author237

Problem Tags

Problem 44079. GJam 2017 Kickstart: Leader (Large)

Solution Stats

Last 200 Solutions

Problem Recent Solvers9

Suggested Problems

More from this Author237

Problem Tags

Players