문제 https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-ii/ Longest Unequal Adjacent Groups Subsequence II - LeetCode Can you solve this real interview question? Longest Unequal Adjacent Groups Subsequence II - You are given an integer n, a 0-indexed string array words, and a 0-indexed array groups, both arrays having length n. The hamming distance between two strings of lee..

문제 https://leetcode.com/problems/count-of-sub-multisets-with-bounded-sum/description/ Count of Sub-Multisets With Bounded Sum - LeetCode Can you solve this real interview question? Count of Sub-Multisets With Bounded Sum - You are given a 0-indexed array nums of non-negative integers, and two integers l and r. Return the count of sub-multisets within nums where the sum of elements in each s leet..

문제 https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/ Maximum Number of K-Divisible Components - LeetCode Can you solve this real interview question? Maximum Number of K-Divisible Components - There is an undirected tree with n nodes labeled from 0 to n - 1. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] ind le..

문제 https://leetcode.com/problems/split-array-into-maximum-number-of-subarrays/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 SubArr는 연속이어야 했기때문에 쉬운 문제였다. A subarray is a contiguous part of an ar..

문제 https://leetcode.com/problems/minimum-array-length-after-pair-removals/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 어떤 식으로 쌍을 맞춰줘야 될지 이리저리 해봤지만, 결국에는 간단한 그리디 방식으로 해결된다. 아래 배열에서 쌍을 맞춰보자. 1 1..

문제 https://leetcode.com/problems/maximum-element-sum-of-a-complete-subset-of-indices/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 weekly contest의 최종 보스 문제. https://leetcode.com/contest/weekly-co..

문제 https://leetcode.com/problems/maximum-number-of-alloys/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 주간 Leetcode contest문제를 풀어보자~~ https://leetcode.com/discuss/general-discussion/4053842/wee..

문제 https://leetcode.com/problems/find-median-from-data-stream/description/ Find Median from Data Stream - LeetCode Can you solve this real interview question? 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 exam leetcode.com 풀이 난이도: Hard ..

문제 https://leetcode.com/problems/top-k-frequent-elements/description/ Top K Frequent Elements - LeetCode Can you solve this real interview question? Top K Frequent Elements - Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order. Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] leetcode.com 풀이 난이도: Medium 숫자 배열에서 가장 많..

문제 https://leetcode.com/problems/word-search-ii/description/ Word Search II - LeetCode Can you solve this real interview question? Word Search II - Given an m x n board of characters and a list of strings words, return all words on the board. Each word must be constructed from letters of sequentially adjacent cells, where adjacent cells are leetcode.com 풀이 난이도: Hard 단순한 접근으로는 시간초과가 발생하는 문제이다. DF..