This is a solution to leetcode 3 problem. For a given input string s, return the length of the longest substring in s, without repeating cha

Consider you given an array of integers and a target sum, return indices of two numbers in the array such that they add up to target.