10-Week C++ Coding Test | Algorithm Coding Test
The best coding test course that gets you accepted into coding tests at Naver, Kakao, and Samsung in just 10 weeks!
･
Edited
A matching lecture has been added.
I've created a few lectures on the right way to give you some great tips. Even if you've done this week perfectly, you should definitely listen to these lectures! They're packed with really great tips.
Correct answer: Output | 1 - K supplementary explanation
Tips for using global variables | 3 - Q Supplementary explanation
Counterexample Tips: How to Think of Counterexamples | 2 - C Supplementary Explanation
Tips for the match: How to reduce mistakes | Hidden Quest
also,
The following additional explanation has been added to the time complexity Q5 description section. :)
Additional explanation: Since a typical recursive function has a structure like go(n - 1) or go(idx + 1), if it is called twice, it is 2^n, and if it is called three times, it is 3^n. However, functions that do not have that structure may have different time complexities. Please note.
thank you