"Take coding tests with Python."

I always advise many people who ask me for consultation like this: Python has concise syntax. Even with the same logic, the code is shorter. In a coding test environment where every second counts, Python is definitely an 'overwhelmingly advantageous weapon'. I also passed the Kakao coding test using Python.

But why did I create this challenging 'Java Coding Test Course'? And why are you looking at this page right now instead of a Python grammar book?

The reason is that we don't just end with 'passing the coding test'. Our real goal is to become 'a skilled backend developer who handles Java and Spring'.

I have met backend developers at numerous online and offline lecture venues and asked them this question.

"I'm already struggling to study Spring, do I really have to learn Python syntax from scratch just for coding tests?"

"There are companies that require you to take tests only in Java"

"I'm familiar with Java syntax, but when I see coding test problems, my code gets too long and I feel overwhelmed."

I deeply resonated with this as well, but I hesitated because creating courses in Java required a lot of effort. However, I eventually made up my mind.

"Alright, let me compete with my most confident language (JAVA)."

"Instead, let's give them a 'cheat code' that can completely offset Java's weaknesses (lengthy code, complexity)."

This is how this course was created. The time I poured into making this course is not simply to show problem-solving.

First, I obsessed over 'showing' rather than 'explaining'. An explanation that could be finished in 10 seconds by simply saying "A stack is a LIFO structure," I spent 10 hours turning into an animation. This is so you can see with your own eyes how data stacks up in memory and where the pointer moves. When you can visualize it in your mind, you won't panic even when faced with application problems.

Second, we prepared 'tools' to prevent you from starting from scratch. Is Java code long? Yes, it is. That's why we prepared 'code templates' that you can copy and use as soon as you enter the exam room. We organized patterns that should come out mechanically as soon as you see a problem, like formulas.

Third, we changed the 'order of thinking'. Do you just start typing on the keyboard and repeatedly delete? Successful candidates don't solve problems that way. They read the problem's hints (Step 1), select an algorithm (Step 2), complete the design (Step 3), and only then write the code (Step 4). We will help you make this 4-Step thinking process your habit.

This course is designed to help you on your journey to becoming a backend developer by removing the biggest obstacle of 'coding tests' in the most efficient way possible.

If you look at the content below in detail, check the preview, and see how other coding test lectures explain things, you'll definitely realize: there's no other lecture that makes you understand this clearly!

Let's quickly knock out the coding test together and move on to the next step 😊😊

- From Dev Nam-no

A course already taken by over 3,000 students online and offline

I understand the algorithm concepts, but when I actually look at the problems, I don't know what to do.

BFS, DFS, stacks, queues... You've studied them somewhere before, but when it comes to actually solving problems, you don't know where to start, right?

I'll tell you straight.That's... not understanding the concept!

If you don't understand the internal workings of data structures, you'll fall apart when faced with even slightly modified problems.

Coding Test All-in-One [JAVA], Here's What Makes It Different.

🎉 Exclusive Benefits for Students

Curriculum Introduction

[Part 1] Introduction to Coding Tests

• 1-1. Making the Most of Coding Test All-in-One 100%

• 1-2. Introduction to Coding Tests

[Part 2] Building the Fundamentals

• 2-1. Data Structures

• 2-2. Algorithm

• 2-3. Time Complexity

• 2-4. Time Complexity Code Examples

• # 2-5. Quiz #1

• 2-6. Quiz 2

• 2-7. Quiz #3

• 2-8. Quiz #4

• 2-9. Quiz #5

• 2-10. Quiz 6

  
  

[Part 3] Essential Data Structures

• 3-1. Brute Force Iteration

• 3-2. Array, ArrayList

• 3-3. Linked List

• 3-4. Queue

• 3-5. Stack

• 3-6. Hash Table

• 3-7. HashSet

• 3-8. [Problem Solving] Problem-solving Procedure, Lecture Structure

• 3-9. [Problem Solving] Free Event

• 3-10. [Problem Solving] Valid Parentheses Pairs

• 3-11. [Problem Solving] Valid Parentheses Pairs

• 3-12. [Problem Solving] Progressive Overload

  
  

[Part 4] Exhaustive Search and Permutations & Combinations

• 4-1. Complete Search [Recursion] Basics

• 4-2. Exhaustive Search[Recursion] Execution

• # 4-3. State Space Tree

• 4-4. Permutation

• # 4-5. Combinations

• 4-6. Subsets

• 4-7. [Problem Solving] Born to Travel the World 1

  
  

[Part 5] Graph

• 5-1. Graph Definition

• 5-2. traversal

• 5-3. Breadth-First Search BFS

• 5-4. Depth-First Search DFS

• 5-5. DFS, BFS Time Complexity

• 5-6. [Coding Test TIP] Practical Use of Graphs

• 5-7. [Coding Test TIP] Question Types

• 5-8. [Problem Solving] Locked Locker

• 5-9. [Problem Solving] Red Team Blue Team

• 5-10. [Problem Solving] Coin Change 2

[Part 6] Building the Fundamentals

• # 6-1. Grid, Implicit Graph Definition

• 6-2. Implicit Graph Traversal

• # 6-3. Implicit Graph BFS

• 6-4. Implicit Graph DFS

• 6-5. [Coding Test TIP] Question Types

• 6-6. [Problem Solving] Number of Clouds 1

• 6-7. [Problem Solving] Ambulance Shortest Distance 2

  
  

[Part 7] Tree

• 7-1. Tree Concepts

• 7-2. Tree Implementation

• 7-3. Tree Traversal

• 7-4. Tree BFS

• 7-5. Tree DFS

• # 7-6. pre-order, in-order, post-order

• 7-7. [Problem Solving] Infected Folder