Chapter 1.
Coding test

1.1 What is a coding test?
1.2 Why take coding tests?
_1.2.1 Viewing the problem-solving process
_1.2.2 The foundation of everything, developing thinking skills
_1.2.3 Same results quickly and efficiently
1.3 Coding and Debugging
_1.3.1 What is well-written code?
_1.3.2 Common mistakes when writing code
_1.3.3 Debugging and Reducing Trial and Error

Chapter 2.
Time complexity

2.1 What is time complexity?
_2.1.1 Big-O notation
_2.1.2 Time complexity graph
_2.1.3 Things to consider when choosing time complexity
2.2 Calculating Time Complexity
_2.2.1 Guessing
_2.2.2 Reducing time complexity
_2.2.3 Considering time complexity in various situations

Chapter 3.
arrangement

3.1 Understanding Two-Dimensional Arrays
_3.1.1 One-dimensional array + one-dimensional array
_3.1.2 Thinking about arrays in various ways
3.2 Handling two-dimensional arrays
_3.2.1 Two-dimensional array application
[Problem 01] Creating a Star at the Intersection - Level 2
[Problem 02] Rotating the Matrix Border - Level 2
_3.2.2 How to determine direction with dx dy
[Problem 03] Triangular Snail - Level 2
[Problem 04] Checking Social Distancing - Level 2
_3.2.3 Operations (Numbers)
[Problem 05] Matrix Multiplication - Level 2

Chapter 4.
string

4.1 What is a string?
_4.1.1 Characteristics of strings
_4.1.2 Thinking about strings in a different way
[Problem 06] Caesar Cipher - Level 1
[Problem 07] Creating Strange Characters - Level 1
4.2 Handling Strings
_4.2.1 Applying Strings
[Problem 08] Tuples - Level 2
[Problem 09] Pairing and Removing - Level 2
[Problem 10] String Compression - Level 2
_4.2.2 Changing the base
[Problem 11] Ternary Reversal - Level 1
[Problem 12] Repeating Binary Conversion - Level 2
_4.2.3 Find and Replace
[Question 13] New ID Recommendation - Level 1
4.3 Regular Expressions
_4.3.1 What is a regular expression?
[Problem 14] String Handling Basics - Level 1
[Problem 15] Hide Your Phone Number - Level 1

Chapter 5.
recursion

5.1 What is a recursive function?
_5.1.1 Breaking out of the for statement
_5.1.2 Remember the maximum scope and limits of recursion
_5.1.3 Note: Tail recursion
5.2 Defining recursion
_5.2.1 Defining States
_5.2.2 Termination Conditions
_5.2.3 Setting up the ignition system
5.3 Solving various problems
[Problem 16] Collatz Conjecture - Level 1
[Question 17] Tower of Hanoi - Level 3
[Problem 18] Vowel Dictionary - Level 2
[Problem 19] Hotel Room Assignment - Level 4

Chapter 6.
Fully explored

6.1 What is exhaustive search?
_6.1.1 How to understand the problem
_6.1.2 State and State Transition Progress
_6.1.3 Types of exhaustive search and data structures used
_6.1.4 Visit Processing/Backtracking
6.2 Solving various problems
[Question 20] Mock Test - Level 1
[Problem 21] Carpet - Level 2
[Problem 22] Finding Prime Numbers - Level 2
[Problem 23] Bad User - Level 3
[Problem 24] Formula Maximization - Level 2

Chapter 7.
array

7.1 What is alignment?
_7.1.1 Setting the criteria for sorting
_7.1.2 Types of sorting
7.2 Sorting
_7.2.1 Using the default criteria
[Problem 25] Pick Two and Add - Level 1
[Problem 26] H-index - Level 2
_7.2.2 Setting your own criteria
[Problem 27] ​​Arrange Strings Any Way You Want - Level 1
[Problem 28] Largest Number - Level 2

Chapter 8.
binary search

8.1 What is binary search?
_8.1.1 Advantages of Binary Search
_8.1.2 Implementation Method
8.2 Improving Search Efficiency
_8.2.1 Setting sorting criteria
_8.2.2 Parametric Search
8.3 Solving various problems
[Question 29] Immigration - Level 3
[Problem 30] Rank Search - Level 2
[Problem 31] Stepping Stones - Level 4
[Problem 32] Crossing the Stepping Stones - Level 3

Chapter 9.
Hash

9.1 What is a hash?
_9.1.1 What is a hash table?
_9.1.2 Time Complexity of Hashing
9.2 Solving various problems
[Question 33] Athletes Who Did Not Finish - Level 1
[Problem 34] Phone Number List - Level 2
[Problem 35] Camouflage - Level 2
[Question 36] Open Chat Room - Level 2
[Question 37] Best Album - Level 3

Chapter 10.
dynamic programming

10.1 Reducing Operations
_10.1.1 Problems with Exhaustive Search
[Problem 38] Fibonacci Numbers - Level 2
_10.1.2 Memoization, the core of dynamic programming
_10.1.3 How to implement
10.2 Solving various problems
[Problem 39] Expressing in N - Level 3
[Problem 40] Integer Triangle - Level 3
[Problem 41] School Road - Level 3
[Problem 42] Theft - Level 4

Chapter 11.
Frequently appearing data structures

11.1 Stacks and Queues
_11.1.1 Stack
_11.1.2 Queue and Deck
_11.1.3 Solving various problems
[Problem 43] Stock Prices - Level 2
[Problem 44] Function Development - Level 2
11.2 Graphs and Trees
_11.2.1 What is a graph?
_11.2.2 Treeran
_11.2.3 Solving various problems
[Problem 45] The furthest node - Level 3
[Question 46] Ranking - Level 3
[Problem 47] Pathfinding Game - Level 3
11.3 Data structures that appear when you forget them
_11.3.1 Priority Queue 467
[Problem 48] Disk Controller - Level 3
_11.3.2 Two Pointers 473
[Problem 49] Jewelry Shopping - Level 3
_11.3.3 Union Find
[Problem 50] Connecting Islands - Level 3
_11.3.4 Try
[Problem 51] Lyrics Search - Level 4

Chapter 12.
avatar

12.1 Things to watch out for
_12.1.1 Why is this a difficult problem to implement?
_12.1.2 Thinking about the problem in detail: modularization
_12.1.3 Responding to Errors Quickly
12.2 Make it as discussed in the problem
_12.2.1 Finding Rules
_12.2.2 Solving various problems
[Problem 52] Keypad Pressing - Level 1
[Problem 53] Two or fewer different bits - Level 2
[Question 54] Skill Tree - Level 2
[Problem 55] How to Stand in Line - Level 2
12.3 Solving based on exhaustive search
_12.3.1 Depth-First Search (DFS)
[Problem 56] Target Number - Level 2
[Problem 57] Travel Route - Level 3
[Problem 58] Network - Level 3
[Problem 59] Parentheses Conversion - Level 2
_12.3.2 Breadth-First Search (BFS)
[Problem 60] Word Conversion - Level 3
[Question 61] Game Map Shortest Distance - Level 3
[Problem 62] Building a Racetrack - Level 3
12.4 Greedy Algorithm
_12.4.1 Best in the current situation
_12.4.2 When and When Not to Use the Greedy Algorithm
_12.4.3 Solving various problems
[Problem 63] Joystick - Level 2
[Problem 64] Creating Large Numbers - Level 2
[Problem 65] Lifeboat - Level 2
[Problem 66] Speed ​​Camera - Level 3

Chapter 13.
Challenge: Kakao 2022 Blind Test

[Problem 67] Receiving Report Results - Level 1
[Problem 68] Finding the Number of Prime Numbers in Base K - Level 2
[Problem 69] Parking Fee Calculation - Level 2
[Question 70] Archery Competition - Level 2
[Problem 71] Sheep and Wolf - Level 3
[Question 72] Undestructed Building - Level 3
[Problem 73] Disappearing Platform - Level 3

Chapter 14.
Coding Proficiency Certification Exam, PCCP Mock Exam

14.1 PCCP Mock Exam 1 time
[Problem 74] The Lonely Alphabet - Level 1
[Problem 75] Sports Competition - Level 2
[Problem 76] The Laws of Heredity - Level 2
[Problem 77] Operating System - Level 3
14.2 PCCP Mock Exam 2 times
[Problem 78] Robotics for Practice - Level 1
[Problem 79] New Employee Training - Level 2
[Question 80] Cafe Expansion - Level 2
[Question 81] Treasure Map - Level 3

Analyze the problem, check the requirements,
Implementing the design using various approaches
Complete the flow of thought that solves the problem!

1.
A selection of past questions from programmers who have completed numerous coding tests!

We've selected 81 problems from among those that reflect the know-how of programmers with a cumulative 770,000 test takers, 20,000 cumulative tests, and over 1,500 corporate clients.

2.
Learn through 'Problem Analysis → Requirements Identification → Approach Selection → Step-by-Step Implementation'!

It is designed to allow you to experience the process of solving actual coding test problems, and helps you complete the thought process for solving problems.

3.
Approach with various solutions!

There is not one solution to the problem, but many.
In addition to solving basic problems, the book also covers key concepts and various solutions, allowing you to make the problems you just solved 100% your own.

4.
Pythonic problem solving and solution techniques!

We explain problem solving and solutions using the Python language.
Furthermore, you can gain a deeper understanding of Python and explore the direction and process of programming.

5.
Includes two Kakao Blind Tests and PCCP Mock Exams!

You can develop a practical sense of the exam by solving problems from the Kakao 2022 blind test and two PCCP mock exams using what you learned in the book.

[Beta Review]

If you've gotten past the beginner level of Python, there's a problem that everyone struggles with.
"Can I pass the coding test? And if so, how should I prepare?"
There are already many books out there that cover coding tests.
While it certainly contains good content, it's difficult to choose the right book to prepare for coding tests by applying it right after learning grammar.
I recommend this book to those people.
While typical coding test books assume a basic understanding and only provide a reasonable level of explanation, this book provides detailed information on the best or optimal algorithm design method, taking into account various factors such as time complexity.
It's also great for those just starting to learn algorithms, as it uses diagrams and tables to make the process easy to understand.
I'm currently teaching Python to students, and I'd like to use this book to teach students who have passed the introductory level and have completed the "COS PRO Python" certification how to design algorithms for coding tests.
I've read a lot of coding test books, but I don't think I've ever seen one that explains everything step by step in a way that's so beginner-friendly.
I recommend this book to anyone who wants to improve their skills beyond the beginner level and take coding tests, and to anyone who wants to access a variety of cases using the Programmers OJ website.

Kim Tae-woong | Clark Square, Robotics Facilitator

"Finish your Python coding test in one book!" It's rare to find a book on Python-based coding tests, so I'm delighted to have a new one published. It covers programming problems frequently used by domestic companies (especially Kakao), so it's incredibly useful for Python users like me who are about to take a coding test.
With its vast number and variety of problem-solving solutions, this book alone will help you solve almost any type of coding test problem.
Moreover, because it covers the characteristics of the Python language in depth, I was able to realize why I, who was the most frequently failed coding test during the job application process while preparing for employment and changing jobs, failed the coding test while reading this book.
Moreover, since it not only contains tips for solving problems and an introduction to algorithms, but also covers the characteristics of the Python language, I would recommend it not only to job seekers preparing for coding tests, but also to current professionals (practitioners) who use Python in the field.
Choi Min-ju | Job Seeker (Wecode Bootcamp 41st Session)

The book explains many practical and helpful know-hows.
We provide various techniques and know-how, such as how to get good results in coding tests and what methods to use when writing code.
The beginning of the book clearly explains the important points needed to write Python code so that even beginners can learn without difficulty.
Additionally, you can practice by selecting carefully selected problems from programmers, and naturally become familiar with coding tests while practicing theories and core problems for each major algorithmic item.
While solving various problems, the author provides friendly explanations as if he were right next to you, rather than simply solving the problems.
Additionally, Chapter 13 will help you experience the latest algorithm problems by solving Kakao 2022 blind test problems, and Chapter 14 will help you solve various problems while solving the PCCP mock test for the Coding Proficiency Certification, which is structured to help you easily identify your shortcomings.
Park Chan-woong | IT Developer

This book will help you learn from basic to advanced algorithms by solving various problems for programmers.
In addition to simple problem solving by topic, it also provides helpful explanations of the prior knowledge required to solve the problems.
You can also become familiar with the Programmers Environment, which many companies use as a coding testing platform.
I recommend this book to anyone who wants to start coding tests in Python or to anyone who wants to improve their skills through programmer tests.
Park Hyun-woo | Tmax Waffle Front-End Developer

To pass a coding test, you need to solve as many problems as possible and develop your perspective on the problem.
I think this book is perfect for job seekers preparing for coding tests, as it contains real-world problems and various problem-solving methods from Programmers, which is widely used as a coding test platform by famous IT companies.
Heo Heon | Freelance Developer