The Big Programming Thread - Page 859

def palin(s):
    longest_n = 0
    longest_start = 0
    start = 0
    end = 0
    for i in range(len(s)):
        start = i
        end = i
        while (s >= 0 and end < len(s)):
            if (s[start] == s[end]):
                n = end - start + 1
                if (n > longest_n):
                    longest_n = n
                    longest_start = start
            else:
                break
            start -= 1
            end += 1
        
    print longest_n, s[longest_start:longest_start + longest_n]


palin("carracecar")
palin("aabbaa")
palin("aabbbabab")

7 racecar
3 
5 abbba

 
let is_palindrome s = rev s = s

    public static int find(ArrayList<String> words) {
       int size = 1;
       int total = 0;
       for(String w : words) {

           for(int i = 0; i < w.length() - 1; i++) {
               int front = 1, back = 1;
               while(((i - back >= 0) && (i + front <= w.length() - 1) && (w.charAt(i + front) == w.charAt(i - back)))) {
                    size += 2;
                    back++;
                    front++;
               }
               if (size > total) {
                   total = size;
               }
               size = 1;
           }
       }
       return total;
    }

func (u *User) getNextTask(date time.Time) (Task, error) {
	task := Task{}
	query := bson.M{
		"id":        bson.M{"$in": u.Tasks},
		"timestamp": bson.M{"$gte": date},
	}
	err := Tasks.Find(query).Sort("timestamp").Limit(1).One(&task)
	if err != nil {
		return task, err
	}
	return task, nil
}

int palindromeLength(string s)
{
    for (int i=0; i<s.length()/2; ++i)
    {
        if (s[i] != s[s.length()-1-i])
        {
            return 0;
        }
    }
    return s.length();
}

int getLongestPalindrome(string s)
{
    int maxLen = 0;
    for (string::iterator ita=s.begin(); ita<s.end()-maxLen-1; ++ita)
    {
        for (string::iterator itb=ita+maxLen+1; itb<s.end(); ++itb)
        {
            maxLen = max(maxLen, palindromeLength(string(ita,itb)));
        }
    }
    return maxLen;
}