Coding Test

157 posts
members

Leetcode - 597. Friend Requests I: Overall Acceptance Rate

Indo Yoon
문제 Loading...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 정답…
members

Leetcode - 602. Friend Requests II: Who Has the Most Friends

Indo Yoon
문제 Loading...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 정답…
members

Leetcode - 578. Get Highest Answer Rate Question

Indo Yoon
문제 Loading...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 정답…
members

Leetcode - 577. Employee Bonus

Indo Yoon
문제 Loading...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 정답…
members

Leetcode - 586. Customer Placing the Largest Number of Orders

Indo Yoon
문제 Loading...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 정답…
members

Leetcode - 585. Investments in 2016

Indo Yoon
문제 Loading...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 정답…
members

Leetcode - 580. Count Student Number in Departments

Indo Yoon
문제 Loading...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 정답…
Coding Test
members

프로그래머스 - 코딩테스트 연습 - 스택/큐 - 프린터

Indo Yoon
문제 https://school.programmers.co.kr/learn/courses/30/lessons/42587 정답 공간 복잡도 낮은 방법 def solution(priorities, location): order = 1 max_p = max(priorities) while priorities: priority = priorities.…
Coding Test
members

프로그래머스 - 코딩테스트 연습 - 스택/큐 - 같은 숫자는 싫어

Indo Yoon
문제 https://school.programmers.co.kr/learn/courses/30/lessons/12906 정답 def solution(arr): stack = [] result = [arr[0]] for num in arr: if stack: curr = stack.pop() if curr…
members

Leetcode - 574. Winning Candidate

Indo Yoon
문제 Loading...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 정답…