ko ko ko ko ko ko ko ko ko en en ko ko ko ko ko pt ko ko ko en fr it en pt ko en it ko ko ko ko ko ko ca ko ko en ko ko en fr en en en en ko en hbs_lat fr ko ko ko ko ko ko ko en en en en en en en sv fr de de fr fr fr sv en fr en ja fr de fr es nb fr de en en sv de de fr en fr it fr de en en en en en az it it ko ko ko ko ko pt en es ja da es ko en en de fr en en ko en en ko fr vo en ko en en en en ceb de en en en en de en en ko ko ko pt ko ko ko en en ko en en ko en en ko en en ko ko
#3. Longest Substring Without Repeating Characters [Medium] [Javascript]
문제 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", with the length of 3. Notice that the ..
#2. Add Two Numbers [Medium][Javascript]
문제 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. Example 1: Input: l1 = [2,4,3], l2 = [5,6,4] Output: [7,0,8] Explanation: 34..
개발 및 관련 자료/LeetCode 2022. 4. 3. 14:36
#1. Two Sum [Easy] [javascript]
문제 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. Example 1: Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explanation: Because nums[0] + nums[1] == 9, we return [0, 1]...
개발 및 관련 자료/LeetCode 2022. 3. 31. 19:35
Prev 1 2 3 4 ··· 68 Next
Blog is powered by kakao / Designed by Tistory