Description Given a string s, find the length of the longest substring without repeating characters. 반복되는 문자가 없는 가장 긴 문자열의 길이를 구하라. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1. Example 3: Input: s = "pwwkew" Output: 3 Explanation: The answer is "wke"..

Description 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 contains a single digit. Add the two numbers and return the sum as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself. 음수가 아닌 한 자리 정수로 구성된 리스트가 두 개 주어진다. 리스트가 나타내는 는 거꾸로 들어있다. 두 수를 더해라. ..

Description Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. --- 정수의 array와 정수로 된 목표 숫자가 주어지고 목표 숫자로 더해지는 두 숫자를 반환해라. 같은 요소를 두 번 사용하면 안된다. Example 1. Input: nums = [2,7,11,15], ..