HASH2 [Hashing] 2260. Minimum Consecutive Cards to Pick Up https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/ Minimum Consecutive Cards to Pick Up - LeetCode Can you solve this real interview question? Minimum Consecutive Cards to Pick Up - You are given an integer array cards where cards[i] represents the value of the ith card. A pair of cards are matching if the cards have the same value. Return the minimum n leetcode.com 난이도: medium .. 2023. 3. 17. [Hashing] Maximum Number of Balloons 출처 : leetcode - DS course 문제: Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible. You can use each character in text at most once. Return the maximum number of instances that can be formed. Input: text = "nlaebolko" Output: 1 Input: text = "loonbalxballpoon" Output: 2 Input: text = "leetcode" Output: 0 Constraints: 1 2023. 1. 3. 이전 1 다음
