**Notice**

**Recent Posts**

**Recent Comments**

**Link**

**관리 메뉴**

## 목록coding test/leetCode (55)

## .Zzumbong

**[leetCode/JS] 1360. Number of Days Between Two Dates**

문제 설명 Write a program to count the number of days between two dates. The two dates are given as strings, their format is YYYY-MM-DD as shown in the examples. 입출력 예 Example 1: Input: date1 = "2019-06-29", date2 = "2019-06-30" Output: 1 Example 2: Input: date1 = "2020-01-15", date2 = "2019-12-31" Output: 15 Constraints The given dates are valid dates between the years 1971 and 2100. 내 솔루션 차이 나는 일자..

**[leetCode/JS] 263. Ugly Number**

문제 설명 An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5. Given an integer n, return true if n is an ugly number. 입출력 예 Example 1: Input: n = 6 Output: true Explanation: 6 = 2 × 3 Example 2: Input: n = 1 Output: true Explanation: 1 has no prime factors, therefore all of its prime factors are limited to 2, 3, and 5. Example 3: Input: n = 14 Output: false Explanati..

**[leetCode/JS] 223. Rectangle Area**

문제 설명 Given the coordinates of two rectilinear rectangles in a 2D plane, return the total area covered by the two rectangles. The first rectangle is defined by its bottom-left corner (ax1, ay1) and its top-right corner (ax2, ay2). The second rectangle is defined by its bottom-left corner (bx1, by1) and its top-right corner (bx2, by2). 입출력 예 Example 1: Input: ax1 = -3, ay1 = 0, ax2 = 3, ay2 = 4, ..

**[leetCode/JS] 1975. Maximum Matrix Sum**

문제 설명 You are given an n x n integer matrix. You can do the following operation any number of times: Choose any two adjacent elements of matrix and multiply each of them by -1. Two elements are considered adjacent if and only if they share a border. Your goal is to maximize the summation of the matrix's elements. Return the maximum sum of the matrix's elements using the operation mentioned above..

**[leetCode/JS] 374. Guess Number Higher or Lower**

문제 설명 We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess. You call a pre-defined API int guess(int num), which returns three possible results: -1: Your guess is higher than the number I picked (i.e. num > pick). 1: Yo..

**[leetCode/JS] 1721. Swapping Nodes in a Linked List**

문제 설명 You are given the head of a linked list, and an integer k. Return the head of the linked list after swapping the values of the k^th node from the beginning and the k^th node from the end (the list is 1-indexed). 입출력 예 Example 1: Input: head = [1,2,3,4,5], k = 2 Output: [1,4,3,2,5] Example 2: Input: head = [7,9,6,6,7,8,3,0,9,5], k = 5 Output: [7,9,6,6,8,7,3,0,9,5] Constraints The number of ..

**[leetCode/JS] 1700. Number of Students Unable to Eat Lunch**

문제 설명 The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers 0 and 1 respectively. All students stand in a queue. Each student either prefers square or circular sandwiches. The number of sandwiches in the cafeteria is equal to the number of students. The sandwiches are placed in a stack. At each step: If the student at the front of the queue prefers the..

**[leetCode/JS] 3. Longest Substring Without Repeating Characters**

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

**[leetCode/JS] 222. Count Complete Tree Nodes**

문제 설명 Given the root of a complete binary tree, return the number of the nodes in the tree. According to Wikipedia, every level, except possibly the last, is completely filled in a complete binary tree, and all nodes in the last level are as far left as possible. It can have between 1 and 2h nodes inclusive at the last level h. Design an algorithm that runs in less than O(n) time complexity. 입출력..

**[leetCode/JS] 2. Add Two Numbers**

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

**[leetCode/JS] 1. Two Sum**

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

**[leetCode/JS] 151. Reverse Words in a String**

문제 설명 Given an input string s, reverse the order of the words. A word is defined as a sequence of non-space characters. The words in s will be separated by at least one space. Return a string of the words in reverse order concatenated by a single space. Note that s may contain leading or trailing spaces or multiple spaces between two words. The returned string should only have a single space sep..

**[leetCode/JS] 295. Find Median from Data Stream**

문제 설명 The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values. For example, for arr = [2,3,4], the median is 3. For example, for arr = [2,3], the median is (2 + 3) / 2 = 2.5. Implement the MedianFinder class: MedianFinder() initializes the MedianFinder object. void addNum(int num) ad..

**[leetCode/JS] 901. Online Stock Span**

문제 설명 Design an algorithm that collects daily price quotes for some stock and returns the span of that stock's price for the current day. The span of the stock's price in one day is the maximum number of consecutive days (starting from that day and going backward) for which the stock price was less than or equal to the price of that day. For example, if the prices of the stock in the last four d..

**[leetCode/JS] 1047. Remove All Adjacent Duplicates In String**

문제 설명 You are given a string s consisting of lowercase English letters. A duplicate removal consists of choosing two adjacent and equal letters and removing them. We repeatedly make duplicate removals on s until we no longer can. Return the final string after all such duplicate removals have been made. It can be proven that the answer is unique. 입출력 예 Example 1: Input: s = "abbaca" Output: "ca" ..