How to automatically assign a reviewer?
Need to Retry
-> $O(N log_2 N)$가 아닌 $O(N)$ 방법으로 다시 풀어보자.
Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.
It is very easy to come up with a solution with a runtime of O(n log n). Can you do it in linear time O(n) and possibly in a single pass?
You are given a string s.
We want to partition the string into as many parts as possible so that each letter appears in at most one part.
Return a list of integers representing the size of these parts.
LINE Biz+에서 카카오뱅크로 경력 이직을 하였다.
이 글은 카카오뱅크에 지원하고자 하는 하는 분들에게
조금이나마 도움이 되었으면 하는 바람으로 작성하였다.