Coding Test

https://leetcode.com/problems/orderly-queue/ Orderly Queue - 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 1. 문제와 예제, 그리고 제약사항 You are given a string s and an integer k. You can choose one of the first k letters of s and append it at the end of the string.. Return the lexicograph..

https://leetcode.com/problems/container-with-most-water/ Container With Most Water - 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 1. 문제와 예제, 그리고 제약사항 You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line a..

https://leetcode.com/problems/product-of-the-last-k-numbers/ Product of the Last K Numbers - 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 1. 문제와 예제, 그리고 제약사항 Design an algorithm that accepts a stream of integers and retrieves the product of the last k integers of the stream. Imp..

https://leetcode.com/problems/reverse-linked-list-ii/ Reverse Linked List II - 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 1. 문제와 예제, 그리고 제약사항 Given the head of a singly linked list and two integers left and right where left

https://leetcode.com/problems/number-of-matching-subsequences/ Number of Matching Subsequences - 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 1. 문제와 예제, 그리고 제약사항 Given a string s and an array of strings words, return the number of words[i] that is a subsequence of s. A subsequen..

문제출처 : https://www.acmicpc.net/problem/2109 문제설명 한 저명한 학자에게 n(0 ≤ n ≤ 10,000)개의 대학에서 강연 요청을 해 왔다. 각 대학에서는 d(1 ≤ d ≤ 10,000)일 안에 와서 강연을 해 주면 p(1 ≤ p ≤ 10,000)만큼의 강연료를 지불하겠다고 알려왔다. 각 대학에서 제시하는 d와 p값은 서로 다를 수도 있다. 이 학자는 이를 바탕으로, 가장 많은 돈을 벌 수 있도록 순회강연을 하려 한다. 강연의 특성상, 이 학자는 하루에 최대 한 곳에서만 강연을 할 수 있다. 예를 들어 네 대학에서 제시한 p값이 각각 50, 10, 20, 30이고, d값이 차례로 2, 1, 2, 1 이라고 하자. 이럴 때에는 첫째 날에 4번 대학에서 강연을 하고, 둘째 ..