**Notice**

**Recent Posts**

**Recent Comments**

**Link**

일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|

1 | 2 | 3 | 4 | 5 | 6 | |

7 | 8 | 9 | 10 | 11 | 12 | 13 |

14 | 15 | 16 | 17 | 18 | 19 | 20 |

21 | 22 | 23 | 24 | 25 | 26 | 27 |

28 | 29 | 30 |

**Tags**

- 밥먹고
- 뜨아거
- 발더스게이트
- 송리단
- 버즈2프로
- 취미
- 알고리즘테스트
- 토이프로젝트
- 메탈퍼즐
- javascript
- 눈알빠지겠네
- 서울제빵소
- DIY
- 노노그램
- 맛집
- 코테
- 게임
- 메일우유
- 누룽지소금빵
- 천등
- 코딩테스트
- 발더스3
- 나쫌
- 잠실새내
- 바질토마토뭐시기
- 하스스톤
- 미앤아이
- LeetCode
- 3d퍼즐
- 발더스모드

**Archives**

- Today

- Total

**관리 메뉴**

## 목록coding test/leetCode (65)

## .Zzumbong

**[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" ..