https://leetcode.com/problems/add-two-numbers-ii/ Add Two Numbers II - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contains a singl..

https://leetcode.com/problems/add-two-numbers/ Add Two Numbers - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 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 dig..

문제 You are given an integer array nums and an integer k. For each index i where 0

문제 https://leetcode.com/problems/next-greater-element-iii/ Next Greater Element III - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com Given a positive integer n, find the smallest integer which has exactly the same digits existing in the integer n and is greater in value than n. If..

문제 https://leetcode.com/problems/k-closest-points-to-origin/submissions/ K Closest Points to Origin - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane and an integer k, return the k closest point..

문제 You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation. 이미지를 나타내는 n x n 2D 매트릭스가 제공되면 이미지를 90도(시계 방향) 회전합니다. 이미지는 제자리에서 회전해야 합니다. 즉, 입력 2D 매트릭스를 직접 수정해야 합니다. 다른 2D 매트릭스를 할당하지 않고 회전을 수행합니다. 예시 Exam..

문제 Given two binary strings a and b, return their sum as a binary string. 두 개의 이진 문자열 a와 b가 주어지면, 합을 이진 문자열로 반환한다. 예시 Example 1: Input: a = "11", b = "1" Output: "100" Example 2: Input: a = "1010", b = "1011" Output: "10101" 제약 조건 Constraints: 1

문제 The array-form of an integer num is an array representing its digits in left to right order. For example, for num = 1321, the array form is [1,3,2,1]. Given num, the array-form of an integer, and an integer k, return the array-form of the integer num + k. 정수 번호의 배열 형식은 왼쪽에서 오른쪽 순서로 숫자를 나타내는 배열이다. 예를 들어, num = 1321의 경우 배열 형식은 [1,3,2,1]입니다. 주어진 num, 정수의 배열 형식 및 정수 k가 주어지면 정수 num + k의 배열 형식을 반환한..