728x90 Algorithm & SQL182 LeetCode 13. Roman to Integer (Easy) - Kotlin 문제 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D 500M 1000For example, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II.. 2025. 3. 13. LeetCode 9.Palindrome Number (Easy) - Kotlin 문제Given an integer x, return true if x is a palindrome, and false otherwise. Example 1:Input: x = 121Output: trueExplanation: 121 reads as 121 from left to right and from right to left.Example 2:Input: x = -121Output: falseExplanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.Example 3:Input: x = 10Output: falseExplanation: Reads 01.. 2025. 3. 2. LeetCode 1.Two Sum (Easy) - Kotlin 문제 Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.You may assume that each input would have exactly one solution, and you may not use the same element twice.You can return the answer in any order. Example 1:Input: nums = [2,7,11,15], target = 9Output: [0,1]Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].Examp.. 2025. 2. 28. [solvesql] SQL 문제 풀이 (5) 1. 첫 주문과 마지막 주문 select date(min(order_purchase_timestamp)) as first_order_date, date(max(order_purchase_timestamp)) as last_order_date from olist_orders_dataset; 2. 많이 주문한 테이블 찾기 select * from tips where total_bill > ( select avg(total_bill) from tips ); 2023. 2. 3. [solvesql] SQL 문제 풀이 (4) 1. 쇼핑몰의 일일 매출액과 ARPPU select date(ood.order_purchase_timestamp) as dt, count(distinct (ood.customer_id)) as pu, round(sum(oopd.payment_value), 2) as revenue_daily, round( sum(oopd.payment_value) / count(distinct (ood.customer_id)), 2 ) as arppu from olist_orders_dataset ood join olist_order_payments_dataset oopd on ood.order_id = oopd.order_id where ood.order_purchase_timestamp >= '2018-01-01' g.. 2023. 2. 1. [solvesql] SQL 문제 풀이 (3) 1. 최고의 근무일을 찾아라 select day, sum(tip) as tip_daily from tips group by day order by tip_daily desc limit 1; 2. 버뮤다 삼각지대에 들어가버린 택배 select date(order_delivered_carrier_date) as delivered_carrier_date, count(*) as orders from olist_orders_dataset where date(order_delivered_carrier_date) between '2017-01-01' and '2017-01-31' and order_delivered_carrier_date is not null and order_delivered_customer_dat.. 2023. 1. 31. [solvesql] SQL 문제 풀이 (2) 1. 레스토랑 웨이터의 팁 분석 select day, time, round(avg(tip),2) as avg_tip, round(avg(size),2) as avg_size from tips group by day, time; 2. 최근 올림픽이 개최된 도시 select year, upper(substring(city,0,4)) as city from games where year >= 2000 order by year desc; 3.우리 플랫폼에 정착한 판매자 1 select seller_id, count(distinct(order_id)) as orders from olist_order_items_dataset group by seller_id having orders >= 100; 2023. 1. 30. [solvesql] SQL 문제 풀이 1. 모든 데이터 조회하기 https://solvesql.com/problems/select-all/ select * from points; 2. 일부 데이터 조회하기 https://solvesql.com/problems/select-where/ select * from points where quartet = 'I'; 3. 데이터 정렬하기 https://solvesql.com/problems/order-by/ select * from points where quartet = 'I' order by y; 4. 데이터 그룹으로 묶기 https://solvesql.com/problems/group-by/ select quartet, round(avg(x),2) as x_mean, round(variance(.. 2023. 1. 29. 최대공약수(gcd) , 최소공배수(lcm) https://school.programmers.co.kr/learn/courses/30/lessons/12953 프로그래머스 코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요. programmers.co.kr 위의 문제 풀이를 위해 최대공약수와 최소공배수의 로직을 작성 static int gcd(int a, int b) { if (a % b == 0) { return b; } return gcd(b, a % b); } static int lcm(int a, int b) { return a*b / gcd(a,b); } 2022. 12. 27. 이전 1 2 3 4 ··· 21 다음 728x90
