목록코딩 테스트/leetcode (33)
미소를뿌리는감자의 코딩
https://leetcode.com/problems/kth-largest-element-in-an-array/description/ LeetCode - The World's Leading Online Programming Learning Platform 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. 접근 방법 이번 문제는 nums array에서 k 번째로 큰 array를 출력하는 것이 목표이다. 그냥 sort하고, index [k-1] 을 이용해서 출력하면 간단하지만, ..
https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/description/ LeetCode - The World's Leading Online Programming Learning Platform 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. 접근 방법 input 으로 다음과 같이 mat, k 가 주어진다. mat = [[1,1,0,0,0], #2 index = 0 [1,1,1,1,0], #4 index = 1 [1..
https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/description/ LeetCode - The World's Leading Online Programming Learning Platform 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. 접근 방법 이번 문제는 list에서 가장 큰 값 2개 (x, y 라고 하자) 를 구한 후 (x-1)*(y-1)을 return 하는 것이다. 문제 접근 방..
https://leetcode.com/problems/top-k-frequent-elements/description/ LeetCode - The World's Leading Online Programming Learning Platform 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. 접근 방법 리스트가 주어졌을 때, 문자들의 개수를 count 해주고, k에 따라서 가장 많이 있는 문자 k개를 출력해주는 문제이다. 즉, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3..