First Step: Preparing for the Coding Test

Before preparing for the coding test in Chapter 00
00-1 Those who really want to pass
__Seeing other people's solutions can broaden your thinking.
__Adding my own test cases
__It helps when thinking of a good algorithm
00-2 Clarify what you know and what you don't know
__First method, write it down
__Second method: Study as if you were taking a test.
__Third method: You can never pass a coding test by studying for a short period of time.
__The fourth method: summarize in your own words

Chapter 1: Preparing for Coding Tests Efficiently
01-1 Select Language
01-2 Practice Problem Analysis
__First, break the problem down into pieces and analyze it.
__Second, identify constraints and add test cases.
__Third, analyze the input values
__Fourth, identify the core keywords.
__Fifth, understand the data flow or structure.
01-3 Practice designing with pseudocode
__First, write with a focus on behavior, not detailed implementation.
__Second, write in problem-solving order
__Third, test enough

Chapter 2: A Complete Guide to Programmers
02-1 What kind of place is Programmers?
02-2 Programmer's Guide
__A Look at Programmers
__Looking at the problem-solving process

Chapter 3: Analysis of Algorithm Efficiency
03-1 What is time complexity?
__Searching a one-dimensional array
__How to measure algorithm execution time
__Big O notation for expressing worst-case time complexity
How to Use Time Complexity in Coding Testing
03-2 Calculating Time Complexity
__Star-picking problem
__Bacterial lifespan problem

Chapter 4: Essential Grammar for Coding Tests
04-1 Built-in data types
__Integer
__floating point type
04-2 Collection Data Type
__Mutable object
__Immutable object
__list
__dictionary
__tuple
__string
04-3 Function
__function definition
__function call
__lambda expression
04-4 Coding Test Code Implementation Know-How
__Early return
__protected syntax
__composite function

Second Yard: Mastering Coding Tests

Chapter 5 Array
05-1 Array Concept
__Array declaration
__Arrays and Dimensions
05-2 Array Efficiency
__Time complexity of array operations
__Things to consider when choosing an array
05-3 Frequently used list techniques
__Add data to the list
__Delete data from list
__Apply specific operations to data with list comprehensions
05-4 Warm-up Problem
__Problem 01 Sorting an Array★
__Problem 02 Array Control★★
05-5 Mock Test to Pass
__Problem 03 Pick two and add them★
__Problem 04 Mock Exam★
__Problem 05 Matrix Multiplication★
__Problem 06 Failure Rate★★
__Problem 07 Visit Length★★

Chapter 6 Stack
06-1 Stack Concept
__Understanding how the stack works
06-2 Definition of Stack
ADT of __stack
06-3 Warm-up Problem
__Problem 08 Matching Parentheses★★
__Problem 09 Converting Decimal to Binary★
06-4 Mock Test to Become a Passer
__Problem 10 Rotating Parentheses★
__Problem 11: Pair and Remove★
__Problem 12 Stock Price★★
__Problem 13 Crane Doll Grabber Game★★
__Problem 14 Edit Table★★★★★

Chapter 7 Q
07-1 The concept of queue
__Looking at how data moves through the queue
Fields that utilize the characteristics of __queue
ADT of __queue
07-2 Warm-up Problem
__Problem 15 Josephus Problem★★
07-3 Mock test to become a successful candidate
__Problem 16 Function Development★★
__Problem 17 Card Deck★★

Chapter 8 Hash
08-1 The concept of hashing
__Learn more about hash
__Fields that utilize the characteristics of hashes
08-2 Hash function
__Things to consider when implementing a hash function
__Learn about frequently used hash functions
08-3 Conflict Handling
__Processing with chaining
__Processing with open address method
08-4 Warm-up Problem
__Problem 18 Creating a Specific Value with Two Numbers★
__Problem 19 Creating a search function using string hashing★★
08-5 Mock Test to Become a Passer
__Question 20 Players who failed to finish★
__Problem 21 Discount Event★★
__Problem 22 Open Chat Room★★
__Problem 23 Best Album★★
__Get the results of Problem 24 report★★
__Problem 25 Menu Renewal★★★

Chapter 9 Tree
09-1 Tree Concept
A tree shaped like an upside-down tree
09-2 Representing a Binary Tree
Expressing as an array
Traversing a binary tree
Expressing with __pointers
09-3 Traversing a Binary Tree
__Building a binary search tree
__Binary search tree exploration
__Comparison of the efficiency of binary search trees and array search
09-4 Warm-up Problem
Problem 26: Tree Traversal★
__Problem 27 Binary Search Tree Implementation★
09-5 Mock Test to Become a Passer
__Problem 28 Predicted Matchup★
__Problem 29 Multi-level Toothbrush Sales★★
__Problem 30 Maze Escape★★
__Problem 31 Sheep and Wolf★★★★★
__Problem 32 Pathfinding Game★★★★

10-chapter set
10-1 Concept of sets and mutually exclusive sets
__The concept of a set
__A field that utilizes the characteristics of mutually exclusive sets
10-2 Set operations
Representing a set as a tree using arrays
__Union-Find Algorithm
10-3 Warm-up Problem
Problem 33: Implementing a Simple Union-Find Algorithm★★
10-4 Mock Test to Pass
__Problem 34 Phone Pokemon★
__Problem 35 English Word Chain★
__Problem 36 Phone Number List★★
__Problem 37 Connecting Islands★★★

Chapter 11 Graph
11-1 Graph Concept
__Graph Terminology Summary
__Characteristics and types of graphs
__Graph implementation
11-2 Graph Exploration
__Depth-first search
__Breadth-first search
__Comparison of Depth-First and Breadth-First Searches
11-3 Finding the shortest path on a graph
Dijkstra's algorithm
__Bellman-Ford algorithm
11-4 Warm-up Problem
__Problem 38 Depth-First Search Traversal★
__Problem 39 Breadth-First Search Traversal★
Problem 40: Dijkstra's Algorithm★★★
Problem 41: Bellman-Ford Algorithm ★★★
11-5 Mock Test to Pass
__Problem 42 Game Map Shortest Distance★★
__Problem 43 Network★★
__Problem 44 Delivery★★★
__Problem 45: Building a Racecourse★★★★★
__Problem 46 Dividing the Power Grid in Two★★

Chapter 12 Backtracking
12-1 Backtracking and Backtracking Algorithms
__What is backtracking?
__What is the backtracking algorithm?
__What is a promising function?
__Applying the backtracking algorithm to the problem
__N-Queen problem
12-2 Warm-up Problem
__Problem 47 Find the combination of numbers from 1 to N that sums to 10★
__Problem 48 Sudoku Puzzle★★★
12-3 Mock Test to Pass
__Problem 49 Fatigue★
__Problem 50 N-Queen★
__Problem 51 Archery Competition★★
__Problem 52 Exterior Wall Inspection★★★★★
__Problem 53 Disappearing Foothold★★★★★

Chapter 13 Sorting
13-1 Learn about alignment
__Why Sorting Is Necessary
__Insertion sort
__Merge sort
__Heap sort
__priority queue
__Topological sort
__coefficient sort
13-2 Warm-up Problem
__Problem 54 Implementing Counting Sort★
__Problem 55 Merging two sorted arrays
13-3 Mock Test to Pass
__Problem 56: Arrange strings as you wish★
__Problem 57 Arrange integers in descending order★
Problem 58 Kth number★
__Problem 59 Largest Number★★★
__Problem 60 Tuple★★
__Problem 61 Terrain Movement★★★★

Chapter 14 Simulation
14-1 Simulation Problem Solving Know-How
__How to solve simulation problems
__Matrix operations
__coordinate operations
__Symmetry, rotation operations
14-2 Warm-up Problem
__Problem 62 Rotating an Array★★
__Problem 63: Multiplying two matrices and creating the transpose matrix★
__Problem 64 Creating a Snail Sequence
14-3 Mock Test to Pass
Problem 65 Binary Conversion★★
__Problem 66 Cutting a Roll Cake★★
__Problem 67 Carpet★★
__Problem 68 Jumping and Teleportation★★
__Problem 69 Character Coordinates

Chapter 15 Dynamic Programming
15-1 What is dynamic programming?
__Ignition system setup and dynamic programming
__Memoization to reduce the number of recursive calls
__longest increasing subsequence
__longest common subsequence
15-2 Warm-up Problem
__Problem 70 Calculating LCS Length★★★
__Problem 71 Calculating LIS Length★★★
__Problem 72 Pebble Problem★★★
15-3 Mock Test to Pass
__Problem 73 Fibonacci Numbers★
__Problem 74 2 xn Tiling★
__Problem 75 Integer Triangle★★
__Problem 76 Land Grabbing★★
__Problem 77 Theft★★★★★
__Problem 78 Finding the Largest Square★★★
__Problem 79 Word Puzzle★★★★

Chapter 16 Greedy
16-1 Greedy Concept
__Greedy algorithm for giving change
__How can a greedy algorithm guarantee an optimal solution?
16-2 Minimum spanning tree
__What is a kidney tree?
__What is a minimum spanning tree?
16-3 Backpack Problem
__Partially split backpack problem
__The 0/1 backpack problem that cannot be split
16-4 Warm-up Problem
__Problem 80: Giving Change★★
__Problem 81 Part Backpack Problem★★
16-5 Mock Test to Pass
__Problem 82 Budget★
__Problem 83 Lifeboat★
Problem 84: Choosing Tangerines★★
__Problem 85 Base Station Installation★★

Appendix 1: Coding Test Mock Exam
Problem 86: Maze Escape Command
__Problem 87 Delivery and collection of parcels
__Problem 88 Personal information collection validity period
Problem 2: Moving 89 to 110
__Problem 90 Counting after quad compression
__Problem 91 Adding Numbers Without Numbers
Problem 92 of the 3rd session: Bad Users
Problem 93: Finding the number of prime numbers in base k
__Problem 94 Checking Social Distancing
Study for the coding test, question 95, for the 4th session.
__Problem 96 Making the sum of two queues equal
__Problem 97 Number Game
Problem 98 of Lesson 5: Jewelry Shopping
__Problem 99 Undestructed Building
__Problem 100 Lotto's Highest and Lowest Ranks

Appendix 2: Hand Summary Notes

You can pass the coding test with just 100 frequently asked questions!
Prepare for interviews with this book that covers data structure and algorithm theory concepts!

Coding tests are a must-pass hurdle for anyone looking to get into an IT company.
Can you pass a coding test simply by solving a ton of problems? The author says no.
Most coding tests are structured to meet the standards that companies expect from their candidates.
So, it is much more advantageous to pass the exam by strategically preparing for the coding test with frequently asked questions that fit the criteria.
《Becoming a Coding Test Passer》(Python Edition) categorizes 100 questions from corporate coding tests by Programmers and arranges them in order of frequency.
In short, this book is filled with questions in order of importance and type to help you pass the coding test.
We've also packed it full of everything you need to know before the coding test, from the mindset you need to study for the coding test to a review of Python grammar and data structure and algorithm theory.
It doesn't just solve problems; it helps you understand the principles.
It will definitely help you a lot in your interview.

Write pseudocode, draw pictures, and analyze time complexity!
Code is important, but problem-solving thinking is more important!

The author says that while code is important, the process of thinking about how to solve a problem is more important.
They tell us to write pseudocode centered on problem-solving units to reduce wasted time, draw pictures to more easily grasp the core of the problem, and think about time complexity in advance to eliminate unnecessary algorithms and select appropriate algorithms.
However, it is not easy for you to do this from the beginning.
So, the main text is written in the following structure: View pseudocode → Think with pictures → Consider time complexity.
This is not a book that simply solves problems.
This book will help you develop good coding test habits to increase your passing rate.

We 1000% support your learning!

Study together through the author-run Naver Cafe, open KakaoTalk chatroom, GitHub, and Myogongdan!
〈Support 1〉 Naver Cafe (Daily Algorithm) ______ cafe.naver.com/dremdeveloper
〈Support 2〉 Open KakaoTalk chat room (operating 24 hours a day, 365 days a year) ______ open.kakao.com/o/gX0WnTCf
〈Support 3〉 GitHub (Additional study materials + 100% correct code) github.com/dremdeveloper/codingtest_python
〈Support 4〉 Golden Rabbit Study Support! Myogongdan (Study with your own money and earn Carrot Miles!) ______ goldenrabbit.co.kr/myogongdan

Introducing a learning structure that delivers 200% effectiveness!

Each chapter in this book consists of theory, practice problems, and practice test questions.
Start by taking a leisurely walk through the theory, then do some warm-up problems to test what you've learned, and then finish with a practice test.
Then, you will find yourself passing the coding test before you know it.

[Step 1] Solidifying the Theory__The beginning of each chapter covers the theory with friendly explanations and abundant illustrations.
[Step 2] Warm-up with practice problems__Then, apply what you have learned to the warm-up problems created by the author himself.
[Step 3] Conclude with a mock test. Solve the actual coding test! Finally, get a feel for the real thing with a mock test and learn the know-how.
[Bonus Step] Summary of Mom's Notes__Take only the Mom's Notes and carry them around lightly to organize what you've studied.
It's especially useful when you're in a hurry.

Don't be nervous during the actual exam. Prepare for the actual exam with the "Mock Exam"!

Have you ever felt disappointed when you couldn't perform well on problems you normally solved? The author says, "You need to practice for tests, too."
This book contains five mock exams at the level of new employees.
Each test consists of three questions that can be solved within three hours to ensure proper practice.
Take the test with a watch next to you.
Thorough exam practice will greatly increase your chances of passing.

A tear-off book of “Mother’s Day Hand Notes” that is great to take out when you want to remind yourself!

Exams are always nerve-wracking.
So, you need something good to look at before the exam. You can bring a book, but it's difficult to read a thick book before the exam.
So, I've prepared a summary book that's perfect for when you need a reminder.
The key contents of the book are tightly packed into the summary of “Eomchinah’s Hand Notes” provided by Tteotbook.
I think it will be a great help in reminding yourself before the exam.