[Inflearn] 3의 개수는?(large)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand the problem 2. Redefine the problem + abstract 3. Create a solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way..
PS/Problem_Solving 2020. 4. 23. 11:26
[Inflearn] 3의 개수는?(small) (Google interview source)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
PS/Algorithm 2020. 4. 23. 09:04
[Inflearn] N1 에서 0의 개수(소인수분해 응용)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
PS/Problem_Solving 2020. 4. 22. 20:24
[Inflearn] N!의 표현법(소인수분해 응용)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand the problem 2. Redefine the problem + abstract - 큰 수를 소수들의 곱으로 표현 - 소수 2, 3, 5, 7, 11 ... 이 있을 때, 825는 (0 1 2 0 1) 로 표현 가능 이는 2는 없고, 3은 1번, 5는 2번, 7 없고, 11 1번의 곱 3. Create a solution plan (select Algorithm, Data structure) 4. Pro..
PS/Problem_Solving 2020. 4. 22. 17:19
[Inflearn] 마라톤

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand the problem 2. Redefine the problem + abstract - 앞으로 자신이 얻을 수 있는 최선의 등수 구하기 - 실력이 같다면 앞에 달리는 선수를 앞지를 수 없음 3. Create a solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5...
PS/Problem_Solving 2020. 4. 22. 15:51
[Inflearn] 석차 구하기(brute force)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
PS/Problem_Solving 2020. 4. 22. 12:42
[Inflearn] Jolly Jumpers

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
PS/Problem_Solving 2020. 4. 22. 12:00
[Inflearn] 연속 부분 증가수열(LIS)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 연속으로 증가하는 부분 수열의 최대 길이 - 값이 같을 때는 증가하는 것으로 간주 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) - 최대 N 은 100,000 5...
PS/Algorithm 2020. 4. 21. 16:42
1 ··· 12 13 14 15 16
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more