전체 글 썸네일형 리스트형 Leetcode 1835. Find XOR Sum of All Pairs Bitwise AND Problem leetcode.com/contest/weekly-contest-237/problems/find-xor-sum-of-all-pairs-bitwise-and/ Account Login - LeetCode 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 Solving 1 Constraints를 보면, 1 더보기 LeetCode 1808. Maximize Number of Nice Divisors Problem leetcode.com/problems/maximize-number-of-nice-divisors/ Maximize Number of Nice Divisors - LeetCode 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 Solving The recurrence relation is: f(k) = k when k 1, 1 | 2 | 3 | 4 => n, 5 => 6, 6 => 9, 7 => 12, 8 => 18, _ => { let d = (n - 2) / 6.. 더보기 LeetCode 1819. Number of Different Subsequences GCDs Problem leetcode.com/contest/weekly-contest-235/problems/number-of-different-subsequences-gcds/ Solving The maximum size of the input is 10^5(n). Elements of input are less than or equal to 2*10^5(m). My first approache was to apply dynamic programming, but I was not able to figure out a way to divide the proglem into smaller ones. Brute forth came up in my mind secondly. The main idea is to ite.. 더보기 LeetCode 1697. Checking Existence of Edge Length Limited Paths 문제 leetcode.com/problems/checking-existence-of-edge-length-limited-paths/ Checking Existence of Edge Length Limited Paths - LeetCode 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 풀이과정 그래프의 정점 수 |V| 더보기 LeetCode 1707. Maximum XOR With an Element From Array 문제 leetcode.com/problems/maximum-xor-with-an-element-from-array/ Maximum XOR With an Element From Array - LeetCode 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 풀이과정 주어진 숫자의 개수가 10^5 이고, 쿼리의 개수도 10^5 이므로, 각 쿼리에 대해서 주어진 수를 일일이 검사하여 최적의 해를 구하는 방법은 O(|N||Q|) = 10^10 으로 TLE를 피할 가능성이 없다. 각 쿼리에.. 더보기 이전 1 2 3 4 5 6 7 8 ··· 36 다음 목록 더보기