Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Given a string, find the length of the longest substring without repeating characters.

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.