## LeetCode #1 : Two Sum

$O(n)$ solution in python3: 44 ms, faster than 97,63%

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

Random Ramblings about Life, the Universe, and Everything

$O(n)$ solution in python3: 44 ms, faster than 97,63%

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

$O(n)$ solution in python3: 64 ms, faster than 93,77%

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.

$O(n)$ solution in python3: 44 ms, faster than 99.09%

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