💡 오늘의 학습 키워드더보기📌 문자열 문제 설명문제 링크 : https://leetcode.com/problems/reordered-power-of-2/You are given an integer n. We reorder the digits in any order (including the original order) such that the leading digit is not zero.Return true if and only if we can do this so that the resulting number is a power of two.제한 사항1. 1 문제 회고💡 어떤 문제가 있었고, 나는 어떤 시도를 했는지 그리고 새롭게 안 사실은 무엇인지n 값의 범위가 최대 10억인 점을 고려하..
🧩 Algorithm
💡 오늘의 학습 키워드더보기📌 문자열 문제 설명문제 링크 : https://leetcode.com/problems/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.제한 사항1. 1 2. -10^4 3. k is in the range [1, the number of unique elements in the array].4. It is guaranteed that the answer is unique. 문제 회고💡 어떤 문제가 있었고, 나는 어떤 시도를 했는지 그리고 새롭게 안 사실은 무엇인..
💡 오늘의 학습 키워드더보기📌 문자열 문제 설명문제 링크 : https://leetcode.com/problems/sort-characters-by-frequency/Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.Return the sorted string. If there are multiple answers, return any of them.제한 사항1. 1 2. s consists of uppercase and lowercase English le..
💡 오늘의 학습 키워드더보기📌 배열 문제 설명문제 링크 : https://leetcode.com/problems/minimum-suffix-flips/You are given a 0-indexed binary string target of length n. You have another binary string s of length n that is initially set to all zeros. You want to make s equal to target.In one operation, you can pick an index i where 0 and flip all bits in the inclusive range [i, n - 1]. Flip means changing '0' to '1' a..
💡 오늘의 학습 키워드더보기📌 조합📌 백트래킹 문제 설명문제 링크 : https://leetcode.com/problems/iterator-for-combination/Design the CombinationIterator class:- CombinationIterator(string characters, int combinationLength) Initializes the object with a string characters of sorted distinct lowercase English letters and a number combinationLength as arguments.- next() Returns the next combination of length combinationL..
