목록릿코드 (85)
넘치게 채우기
https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous/description/ LeetCode - The World's Leading Online Programming Learning PlatformLevel 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문제 유형 : 배열 / 정렬 / 슬라이딩 윈도우문제 난이도 : Hard 문제You are given an integer array nums. In..
https://leetcode.com/problems/max-dot-product-of-two-subsequences/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 문제 유형 : 다이나믹 프로그래밍 문제 난이도 : Hard 문제 Given two arrays nums1 and nums2. Return the maximum dot pro..
https://leetcode.com/problems/majority-element-ii/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 문제 유형 : 해시, 배열 문제 난이도 : Medium 문제 Given an integer array of size n, find all elements that appear more than ⌊ n/..
https://leetcode.com/problems/number-of-good-pairs/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 문제 유형 : 배열 / 구현 문제 난이도 : Easy 문제 Given an array of integers nums, return the number of good pairs. A pair (i, j..
https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 문제 유형 : 그리디, 배열 문제 난이도 : Medium 문제 There are n pieces arranged in a line,..
https://leetcode.com/problems/monotonic-array/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 문제 유형 : 배열 문제 난이도 : Easy 문제 An array is monotonic if it is either monotone increasing or monotone decreasing. An arr..
https://leetcode.com/problems/unique-paths/description/ Unique Paths - LeetCode Can you solve this real interview question? Unique Paths - There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot leetcode.com 문제 유형 : 다이나믹 프로그래밍 문제 난이도 : Medium 문제 There is a..
https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/description/ Minimum Number of Taps to Open to Water a Garden - LeetCode Can you solve this real interview question? Minimum Number of Taps to Open to Water a Garden - There is a one-dimensional garden on the x-axis. The garden starts at the point 0 and ends at the point n. (i.e The length of the garden is n). There a..
https://leetcode.com/problems/excel-sheet-column-title/description/ Excel Sheet Column Title - LeetCode Can you solve this real interview question? Excel Sheet Column Title - Given an integer columnNumber, return its corresponding column title as it appears in an Excel sheet. For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 ... Example 1: I leetcode.com 문제 유형 : 문자열 처리 문제 난이도 : Eas..
https://leetcode.com/problems/01-matrix/description/ 01 Matrix - LeetCode Can you solve this real interview question? 01 Matrix - Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell. The distance between two adjacent cells is 1. Example 1: [https://assets.leetcode.com/uploads/2021/04/24/01-1-g leetcode.com 문제 유형 : BFS / DFS (+Multi-Source BFS, 다중 출발점 BFS) 문제 난이도 ..