전체 글 422

[HashMap/Set][Easy] 1207. Unique Number of Occurrences

https://leetcode.com/problems/unique-number-of-occurrences/description Unique Number of Occurrences - LeetCode Can you solve this real interview question? Unique Number of Occurrences - Given an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise. Example 1: Input: arr = [1,2,2,1,1,3] Output: tr leetcode.com Q. 주어진 정수배열 arr에서 각 ..

Leetcode/LeetCode75 2023.12.09

[PrefixSum][Easy] 724. Find Pivot Index

https://leetcode.com/problems/find-pivot-index/description Find Pivot Index - LeetCode Can you solve this real interview question? Find Pivot Index - Given an array of integers nums, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of leetcode.com Q. 특정 index를 기준으로, 우측과 좌측의 합이 같다면, 이 index..

Leetcode/LeetCode75 2023.12.08

[PrefixSum][Easy] 1732. Find the Highest Altitude

https://leetcode.com/problems/find-the-highest-altitude/solutions Find the Highest Altitude - LeetCode Can you solve this real interview question? Find the Highest Altitude - There is a biker going on a road trip. The road trip consists of n + 1 points at different altitudes. The biker starts his trip on point 0 with altitude equal 0. You are given an integ leetcode.com Q. 입력된 배열은 해당 위치에서 이전 위치까..

Leetcode/LeetCode75 2023.12.07

[Sliding Window][Medium] 1493. Longest Subarray of 1's After Deleting One Element

https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/description Longest Subarray of 1's After Deleting One Element - LeetCode Can you solve this real interview question? Longest Subarray of 1's After Deleting One Element - Given a binary array nums, you should delete one element from it. Return the size of the longest non-empty subarray containing only 1's in the resu..

Leetcode/LeetCode75 2023.12.05

[Sliding Window][Medium] 1004. Max Consecutive Ones III

https://leetcode.com/problems/max-consecutive-ones-iii/description Max Consecutive Ones III - LeetCode Can you solve this real interview question? Max Consecutive Ones III - Given a binary array nums and an integer k, return the maximum number of consecutive 1's in the array if you can flip at most k 0's. Example 1: Input: nums = [1,1,1,0,0,0,1,1,1,1,0], leetcode.com Q. 0과 1로 구성된 주어진 배열 nums와 정수..

Leetcode/LeetCode75 2023.12.05

[Sliding Window][Medium] 1456. Maximum Number of Vowels in a Substring of Given Length

https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/description Maximum Number of Vowels in a Substring of Given Length - LeetCode Can you solve this real interview question? Maximum Number of Vowels in a Substring of Given Length - Given a string s and an integer k, return the maximum number of vowel letters in any substring of s with length k. Vowel letters in..

Leetcode/LeetCode75 2023.12.05

[Sliding Window][Easy] 643. Maximum Average Subarray I

https://leetcode.com/problems/maximum-average-subarray-i/description Maximum Average Subarray I - LeetCode Can you solve this real interview question? Maximum Average Subarray I - You are given an integer array nums consisting of n elements, and an integer k. Find a contiguous subarray whose length is equal to k that has the maximum average value and return thi leetcode.com Q. 연속된 sub array의 길이가..

Leetcode/LeetCode75 2023.12.03

[Two Pointers][Medium] 1679. Max Number of K-Sum Pairs

https://leetcode.com/problems/max-number-of-k-sum-pairs/description Max Number of K-Sum Pairs - LeetCode Can you solve this real interview question? Max Number of K-Sum Pairs - You are given an integer array nums and an integer k. In one operation, you can pick two numbers from the array whose sum equals k and remove them from the array. Return the maximum nu leetcode.com Q. 배열에서 두 수의 합이 sum이 되면..

Leetcode/LeetCode75 2023.12.02

[Two Pointers][Medium] 11. Container With Most Water

https://leetcode.com/problems/container-with-most-water/description Container With Most Water - LeetCode Can you solve this real interview question? Container With Most Water - You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that toget leetcode.com Q. height 배열이 각 벽의 높이를 ..

Leetcode/LeetCode75 2023.12.01