Given an array of integers, return indices of the two numbers such that they add up to a specific target.

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.

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