목록다시볼문제 (33)
넘치게 채우기
https://leetcode.com/problems/first-missing-positive/description/ Leetcode - First Missing Positive 문제 유형 : 배열, 정렬 문제 난이도 : Hard 문제 Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums. You must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space. 정렬되지 않은 정수 배열 nums가 주어집니다. nums에 없는 가장 작은 자연수를 반환하시오. 알고리즘을 O(n)의 시간과 O(1)의 ..
[LeetCode] 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons
https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/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 three integers n,..
[LeetCode] 42. Trapping Rain Water
https://leetcode.com/problems/trapping-rain-water/description/?envType=study-plan-v2&envId=top-interview-150 Trapping Rain Water - LeetCode Can you solve this real interview question? Trapping Rain Water - Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: [https://assets.leetcode.com/upl leet..