Conquer coding tests now with a proven 10-week curriculum!😎
* Attaching some of the KakaoTalk messages left by actual students who passed.
[Kakao Acceptance]
[Samsung Electronics Acceptance]
✈️ [Go to see more course reviews]
* These are the minimum and maximum amounts of time it took for students who didn't know C++ to learn it, based on three years of teaching experience.
We explain the basics of C++ step-by-step based on examples.
It kindly teaches you all the data structures "perfectly" required for coding tests and the overall usage of C++ STL.
We explain the easiest and most efficient "killer codes" that can execute the core logic frequently found in coding tests.
It contains know-how on how to resolve frequently encountered and frustrating situations, such as "Why is this wrong when it should be right?"
In addition to this, we provide a 200-page teaching manual packed with C++ basics and various coding test know-how, so that even those who don't know C++ can perform algorithms using C++ with just this single guide.
We provide a total of 440 pages of PDF files, combining the algorithm concept manual, C++ manual, and explanation manual. Through this, you can learn algorithms perfectly.
Each problem is bound to have multiple answers, and among them, a best answer. I have continuously contemplated "What makes a better code?" while building these explanatory codes.
* For problem 1911, this shows achieving 6th place in the overall code rankings among all submitted solutions
You no longer have to waste time scouring the internet to find better or more understandable code. You only need to study the "explanation code" in this lecture. We have prepared and refined the highest quality code for our students.
It doesn't just teach you to solve a problem because "this is the code"; it passes on the expertise perfected over three years of teaching students, including the perspectives and ideas behind why a problem should be solved in a certain way.
* Baekjoon 3986 Good Word Problem Solving
This problem is solved simply by using a stack. However, it explains in detail why you should think of a stack, how to come up with the idea of using a stack, and how to approach the problem to generate such ideas. Rather than just showing the final code, it focuses on the problem-solving process to help you refine your "thought process for solving problems."
This course not only equips you with the algorithmic skills needed for coding tests but also allows you to build a solid foundation in overall data structures. In this course, you can learn a wide range of data structures, including vector, array, map, unordered_map, set, multiset, stack, and queue.
Sometimes, there are cases where you must take a coding test using only Java or JavaScript. To prepare for such situations, I have even created a video explaining what to watch out for when converting knowledge learned in C++ to other languages, as well as the core logic that needs to be focused on specifically in Java and JavaScript.
There are so many problems in the world. For example, in implementation, there are representative problems like the Robot Vacuum. For three years, while teaching students directly, I experimented over and over to find which problems should be solved in what order and how many to pass the coding test. As a result, I am revealing 160 carefully selected problems to you.
There are many courses in the world that solve easy problems or only a small number of problems. However, you can never pass a coding test by solving easy problems and a small number of questions. Based on a curriculum verified over three years, this is the only course in Korea that solves as many as 160 problems. This course contains the time I spent agonizing over and over so that you can pass the coding test just by solving the problems provided in this lecture.
I hope you no longer study algorithms in an inefficient way.
I hope you will no longer have to scour the internet in search of better, more understandable code.
Don't waste your time and
I hope you can finish your "coding test" preparation with this single lecture.
First, you should study by following the process of completely mastering the C++ algorithm textbook > conceptual lectures > solving problems on your own > watching the corresponding problem-solving lectures. You will focus on concepts frequently appearing in coding tests, such as implementation, DFS, BFS, tree traversal, brute force, backtracking, and bitmasking, with recommended problems (160 in total) provided for each week.
Complexity, Recursive Functions,
Prefix Sum, Implementation
Graph Theory, DFS, BFS,
Tree Traversal
Brute Force, Backtracking
Bitmasking
Greedy, Line Sweeping,
Two Pointers
Binary Search and
LIS (Longest Increasing Subsequence)
DP (Dynamic Programming)
Fenwick Tree and
Shortest Path Algorithms
Ready for the coding test!
I believe that a course that is continuously updated is the best kind of course. As if to prove this, it was selected as the course with the most updates among all courses on Inflearn in 2022. I will always strive to provide the best learning experience by quickly incorporating student feedback and other areas for improvement.
My course is also well-known for providing fast and sincere answers when students ask "Why is this wrong?" (WA). As if recognizing this, I was selected as the instructor who provided the most answers this year at the 2024 Inflearn Awards. I will always strive to provide the best possible answers to my students' questions. :)
Notice regarding response to the termination of Baekjoon services on April 28th
Hello, I am the instructor Kundol. Despite the shutdown of the Baekjoon service, I have created the "Coding Apricot Club" exclusively for my students so that there are no issues with taking my course.
What Coding Apricot Club looks like
You can solve weekly practice problems as well as modified past exam questions from actual major corporations. :)
There's even a cute animation when you get it right ^_^
Q. The coding test language for the company I am applying to is not C++. Will that be okay?
Yes, it is fine. I have seen many students study with this course, port the code to Java or JavaScript, and pass their coding tests. In fact, converting to another language is not very difficult. For example, to add an element to a vector in C++, you use the push_back() function, right? In Java, you use append(), and in JavaScript, you use push(). Since there are only these minor differences, I recommend studying with this course using C++, which is an easy language for learning algorithms, and then if you must use a different language for the coding test, porting it to that language.
thoughtful You will need some practice on this part before taking the coding test, but it doesn't take that long. If you have to use Java for a coding test after learning with C++, it usually takes an average student about one day to complete the preparation for that transition.
For your reference, I have even created a video to help you prepare for that part. Please check it out. :)
Q. Can I take this course for the purpose of studying algorithms rather than specifically for coding tests?
Yes, that's fine. In fact, while the title of this lecture is "10-Week C++ Coding Test" for keyword optimization, it could just as easily be called "10-Week C++ Algorithms." Since I explain a vast number of problems—160 in total—covering general algorithm concepts and including difficult problems up to Platinum difficulty, it will be helpful for studying overall algorithm topics.
Q. Isn't C++ difficult?
C++ is difficult, but C++ for algorithms is not. Through the C++ for algorithms syllabus I have prepared specifically for this purpose, you can learn to implement algorithms in as little as 3 days or as long as 2 weeks.
Q. I am a non-major; will I be okay?
Yes, it's fine. However, you must know how to program, and it's fine as long as you can implement logic based on at least one language.
Q. Can I pass a coding test just by solving the problems provided here?
Yes, I am confident that you will pass the coding tests of most companies. I can say this with certainty because I have experience helping students who knew nothing about algorithms pass coding tests for companies like Naver, Kakao, and Samsung using only this curriculum.
Q. Even if I solved the problem, should I still watch the lecture or look at the answer?
Yes, that's correct. For example, if a student's code is 10 lines long but the answer I created is only 1 line, you should transcribe my answer. To write better code, a review process is necessary where you look through my code and study it once more.
Q. Within how many days will I receive a response after asking a question?
You can receive an answer as quickly as within an hour, but you should generally expect it within 1 to 3 days. (Excluding weekends and public holidays)
I've taken a few other coding test lectures, but there's no lecture as energetic as Bigdol's lecture. When I don't feel like studying, I feel energized when I watch the explanation lecture. I can see that you put a lot of effort into the algorithm textbook. When you first start learning algorithms in C++, you often don't know how much you should study, but this textbook contains all the content you need for algorithms, so it's good. I like that the lectures only explain the key points without long explanations. And they also select good problems, so I don't have to solve useless problems.!
I was often exposed to the C language in college, but I was worried that I wouldn't be able to solve the algorithm because I wasn't familiar with it. However, my worries disappeared after I solved the problems by looking at the textbook that only included the key usage methods. First of all, it's good that there are many fun parts in the middle of the concept lecture, so it doesn't get boring. I think the characteristic of Teacher Bigdol's lecture is that the explanation is not complicated and only tells the key points. However, in the end, I think the most important thing for coding tests is that you solve them consistently. I think that's also an advantage because you can solve high-quality problems that Teacher Bigdol has carefully selected.
Pros ㆍ Quick answers to questions, quality communication and constant updates ㆍ Detailed explanations when teaching concepts every n weeks ㆍ Techniques for problem solving and efficient codes Cons ㆍ Lectures that feel like review ㆍ Lectures focused on algorithms (C++ basic concepts omitted) Personally, I think most of the cons are covered by the lecture materials.
The explanation of the problem solution is very disappointing.
<1st inquiry> I can't listen at all, so I'm requesting a refund. This lecture is said to be based on the basics, but like other people's reviews, it seems like a lecture that someone who is already familiar with algorithms takes to review. For example, let's look at what the instructor said at 23:40 in the BFS lecture. "BFS is only possible with the same distance (weight). For example, the distance from (1) to (5) in this graph is 3 or 101. So the correct answer is 3~ So it's impossible if the weights are different." Does this explanation sufficiently explain why BFS is only possible with graphs with different weights? From the student's perspective, it seems like they just deciphered the graph... I felt this way in every lecture, so even though I was listening to the concept lecture part, I learned the concept from somewhere else. Do I have to pay for this? I can't listen to it anymore. I'm requesting a refund. ㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡ <2nd Inquiry> I think you don't understand the point of what I said after seeing your reply, so I'll say it again. First, I wrote Q1 wrong. 'Do you think it's sufficiently explained why BFS is only possible in graphs with the same weights?'. The dialogue in double quotation marks below is written exactly as it is in the BFS lecture. "It only takes 2 spaces in a graph with the same weights. But let's think about it as if the weights are different. From '1' to '2', the weight is 1, and from '1' to '3', the weight is 100. Then, if we search with BFS, it will be 101 squares. Right? But the correct answer is 3. So, BFS uses the characteristic of searching by level to be used as a shortest path algorithm in graphs with the same weights, but it doesn't work in graphs with different weights." Here, 'If we search with BFS, it will be 101 squares' -> It seems to the students that the conclusion was suddenly reached. I saw the lecture that explained the two BFS pseudocodes above. Assuming that you are using the capital code 2 (1) When visiting from 1 to 2 '1'.visited = 1 In the while loop, '2'.visited = '1'.visited + 1 = 1+1 = 2 (2) When visiting from 1 to 3 '1'.visited = 1 In the while loop, '3'.visited = '1'.visited + 1 = 1+1 = 2 I think it is interpreted as the same distance whether there is weight or not? Why do I think this way? There must be a logical leap in the lecture. Oh, did you explain the difference between weight and distance (from 'shortest distance' to 'distance')? There's a logical hole here too. There's another one. In the BFS lecture, there was no explanation as to why there could be two pseudo codes, or why the second pseudo code should be used, and the conclusion was simply that 'pseudo code 1 is more theoretical and should be solved like pseudo code 2 when solving problems' (and it felt like I just read the blog post), and there was no convincing reason. Let's look at it more. In the explanation of 'connected components' at 6:50 in the same lecture, 'connected components' = explained as a 'set' of vertices and edges, but then, in the diagram, does 'set' of vertices and edges mean 1 / 1 / 1? If we consider 'set' = lump. But the instructor says, 'There are 2, 3, and 2 connected components.', and there is no explanation as to why there are 2, 3, and 2. The instructor just states the conclusion as if it were obvious and moves on from a concept that he takes for granted. Don't you usually think that 'set' = 'lump'? Then, the 'connected components' in the picture are not '2, 3, 2' as the instructor said, but when viewed as a lump (set), they are '1, 1, 1'. That means there are many leaps between logic and logic, making it difficult to understand. I keep saying that if it is a basic lecture, additional explanations, reasons, and backgrounds are needed to fill in the leaps between logic and logic. Can you fully listen to the lecture when there are such logical leaps in just 10 seconds? I am confused because there are so many logical leaps even without listening to a single lecture. I kept feeling that it was difficult to find backgrounds or reasons for the lecture, which is supposed to be a lecture that even beginners can listen to, and for basic algorithms. Just like other people say. Do you think the instructor sufficiently explained the 'logical leaps' that I mentioned above in the lecture? If so, please tell me where they are. But then I wouldn't have asked this... ㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡ [3rd inquiry] 1. I apologize for making it sound sarcastic when you said that you never did that to my first question (it doesn't seem like it's for beginners, but the lecture introduction says it's for beginners). But why do you say that you never did that when other students say that it doesn't feel like it's for beginners? 2. Regarding the second answer. I didn't ask about the shortest distance taking fewer cells. I asked about the difference between weights and the shortest distance because the lecture mentioned that weights are related to calculating the shortest distance. If you don't understand it as a student, you should give an answer. Please answer. 3. Also, regarding the second answer You said that the lecture explained it like this: 'BFS explanation: Search by level: Graph with different weights'. => I don't understand why the result is not the correct answer based on this content. Please explain that part in detail again. 4. This is also related to the second answer. 'You said that you didn't listen to a single lecture, but in your previous statement, you said that you felt that way even though you listened to all the lectures. It doesn't make sense' => Instructor, I feel like you are picking on all my answers. I told you that I felt that the lectures I've taken so far (recursive functions, time complexity, dfs bfs) were logically insufficient, and you used the bfs lecture as an example and said, "I didn't listen to the bfs lecture, but I made this logical leap in 10 seconds"..... I think you are picking on what I said. 5. This time, it's related to the second question. I haven't heard an answer yet regarding the connection component. Please answer so that the student can understand. Overall, it seems that you did not understand the main point of all my questions. Please explain from the perspective of a beginner. Let me say it again. If you are asking about something that you do not understand, and you repeat your lecture saying, “I have never done that before,” will the student understand? Please try to understand the question from the perspective of the student, and I am asking you to answer the part that I do not understand. Please do not deny it and just repeat the content of your lecture. Since you said that the instructor was being sarcastic, I explained only the parts that I did not understand this time. So please answer. It is the responsibility of the instructor who refused the refund and received the money to answer the student’s question. I earnestly ask you to answer from the perspective of the student. If there is no answer to the question, I will post it again on the community or Q&A board. If that does not work, I will request a refund through Infraon for not answering the question. So this time, I would appreciate it if you could explain in detail the parts that "I" "don't understand" so that I can fully understand them.
![[IT Master Class] Let's Code the C++ WayCourse Thumbnail](https://cdn.inflearn.com/public/files/courses/338107/cover/01jztht7hqhyhbe5cc09q7f1qh?w=420)
![[MMORPG Game Development with C++ and Unreal Series] Part 1: Introduction to C++ ProgrammingCourse Thumbnail](https://cdn.inflearn.com/public/courses/326162/cover/fe5368b1-e25b-4f7c-a670-b775f9e429c6?w=420)
 (1).png?w=420)
![AI-based Customized College Admission Strategy Design Project [AI-SPARS Program Provided | User Manual Provided | Continuous Updates]Course Thumbnail](https://cdn.inflearn.com/public/files/courses/343715/cover/ai/0/9764277e-310f-4bc7-8c63-ee453addbf66.png?w=420)
![Senior Data Analyst's SQL Coding Test Know-how Revealed [Monthly Datalian Seminar Replay | December 2023]Course Thumbnail](https://cdn.inflearn.com/public/courses/332774/cover/a9900f25-50a4-46f1-930d-e6ef03ea88f1/332774.png?w=420)
![[Qt/QML Practical Part 2] 6 Practical Projects for C++ Developers (REST API)Course Thumbnail](https://cdn.inflearn.com/public/courses/333527/cover/eb60879b-b2d9-4194-bbb0-9291102ceda3/333527.png?w=420)
![[Qt/QML Basics Part 1] Cross-platform App Development Learning through C++ Integration and Signals-SlotsCourse Thumbnail](https://cdn.inflearn.com/public/courses/331907/cover/d506b3da-e9ed-4683-97ba-4f01c51e3c4c/331907.png?w=420)