본문 바로가기

problem solving

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를 피할 가능성이 없다. 각 쿼리에.. 더보기
ProjectEuler Problem 6 - Sum square difference The sum of the squares of the first ten natural numbers is,12 + 22 + ... + 102 = 385The square of the sum of the first ten natural numbers is,(1 + 2 + ... + 10)2 = 552 = 3025Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.Find the difference between the sum of the squares of the first one hundred natural numbers .. 더보기
ProjectEuler Problem 5 - Smallest multiple 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20? This problem is asking what the LCM(least common multiple) of [1..20] is.Haskell provide lcm function in builtin though it is easy to implement.We can compute LCM of more than two numbers by rec.. 더보기
ProjectEuler Problem 4 - Largest palindrome product A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two 3-digit numbers. List of numbers each of which is product of two 3-digit numbers: [x * y | x 더보기
ProjectEuler Problem 3 - Largest prime factor The prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 600851475143 ? A function that returns list of factors:factors n = factors' n 2 where factors' n p | n == 1 = [] | mod n p == 0 = p:factors' (div n p) p | otherwise = factors' n (p + 1) The largest prime factor of 600851475143 is:maximum $ factors 600851475143 in Python 더보기
ProjectEuler Problem 2 - Even Fibonacci numbers Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. The sequence of fibonacci numbers is defined as follow: Writing it in Haskell is not th.. 더보기

티스토리툴바