보안 / 개발 챌린저가 목표

문제 설명 Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Notice that the solution set must not contain duplicate triplets. 제한 사항 ☞ 0 ≤ nums.length ≤ 3000 ☞ -100000 ≤ nums[i] ≤ 100000 입출력 예 Input Output [-1, 0, 1, 2, -1, -4] [-1, -1, 2] [-1, 0, 1] [ ] [ ] [0] [ ] 입출력 예 설명 #예제1 -1 + 0 + 1..

문제 설명 Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. 제한 사항 ☞ The length of both num1 and num2 is < 110. ☞ Both num1 and num2 contain only digits 0-9. ☞ Both num1 and num2 do not contain any leading zero, except the number 0 itself. ☞ You must not use any built-in BigInteger library or convert the inputs to ..

문제 설명 Given a non-empty array of integers nums, every element appers twice except for one. Find that single one. Follow up : Could you implement a solution with a linear runtime domplecity and without using extra memory? 제한 사항 ☞ 1 ≤ nums.length ≤ 3 * 10⁴ ☞ -3 * 10⁴ ≤ nums[i] ≤ 3 * 10⁴ ☞ Each element in the array appears twice except for one element which appears only once. 입출력 예 Input Output [2,..

문제 설명 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. 입출력 예 Input Output nums target [2, 7, 11, 15] 9 [0, 1] [3, 2, 4] 6 [1, 2] [3, 3] 6 [0, 1] 입출력 예 설명 #예제1 Because nums[0] + ..

문제 설명 Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] inclusive that do not appear in this array. Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space. 입출력 예 Input Output [4, 3, 2, 7, 8, 2, 3, 1] [5, 6] 입출력 예 설명 #예제 n=8일 때, 위의 In..

문제 설명 Merge two sorted linked lists and return it as a new sorted list. The new list should be made by splicing together the nodes of the first two lists. 입출력 예 Input Output l1 l2 1 → 1→ 2 → 3 → 4 → 4 1 → 2 → 4 1 → 3 →4 입출력 예 설명 # 예제 l1의 node에 1 → 2 → 4가 저장되어 있고, l2의 node에 1 →3 → 4 가 저장되어 있다. 이 노드를 합쳐 나온 결과는 1 → 1 → 2 → 3 → 4 → 4 이다. leetcode.com/problems/merge-two-sorted-lists/ Merge Two Sorted..