보안 / 개발 챌린저가 목표

문제 설명 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 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,..

문제 설명 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..

문제 설명 Bob has a strange counter. At the first second, it displays the number 3. Each second, the number displayed by the counter decrements by 1 until it reaches 1. The couner counts down in cycles. In next second, the timer resets to 2 × the initial number for the prior cycle and continues counting down. The diagram below shows the counter values for each time t in the first three cycles: Find ..

문제 설명 You wish to buy video games from the famous online video game store Mist. Usually, all games are sold at the same price, p dollars. However, they are planning to have the seasonal Halloween Sale next month in which you can buy games at a cheaper price. Specifically, the first game you buy during the sale will be sold a p dollars, but every subsequent game you buy will be sold at exactly d ..