| Felix Halim .NET | ||
|
University Experience
IOI 2002 Yong In, Korea
ACM ICPC Regional Manila 2003
ACM ICPC Regional Manila 2004
ACM ICPC Regional Manila 2005
ACM ICPC Regional Kaohsiung 2006
ACM ICPC Regional Singapore 2007
ACM ICPC World Final Tokyo 2007
Google India Code Jam 2005
Google India Code Jam 2006
Indonesia National Contest 2007
Indonesia National Contest 2008
|
||
Problem StatementA palindrome is a string that reads the same forward and backward. The PalMeasure of a string is the sum of the lengths of its substrings that are palindromes. Return the PalMeasure of the concatenation of all the strings in the String[] text. DefinitionClass: PalindromesAnalyzer Method: summaryLength Parameters: String[] Returns: long Method signature: long summaryLength(String[] text) (be sure your method is public) Notes
Constraints
Examples
0)
{"AAA"}
Returns: 10
1)
{"AB"}
Returns: 2
2)
{"AB", "BA"}
Returns: 10
3)
{"AB", "AAA"}
Returns: 15
4)
{"AZ", "ZZ", "A"}
Returns: 17
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved. Google India Code Jam 2006 - Table of Contents
|
||