🎤 Recruitment for the 4th NerdCon

"Everyone knows how to make AI write code, but who's going to direct my career?"

If you've ever asked yourself this question even once, clear your calendar for Saturday, June 27th.

The 4th NerdCon: Job Concert for Local Youth Developers Theme: "What I Need to Do Right Now"

📍 Near Cheonan-Asan Station 🗓 2026. 06. 27 (Sat) 14:00 – 18:00 💸 Participation Fee 0 KRW · Local youth aged 18-34 🎁 Sponsored by Ministry of Employment and Labor · Baekseok University · Abyss · Gilbut · Hanbit Media

🔥 The lineup is quite strong this time

Hongcheol JuCEO of Abyss · Formerly at Naver · Author of the #1 IT bestseller "CS Major Knowledge Notes for Interviews"

Haesun ParkAuthor/Translator of 40+ AI books · Google GDE · MS MVP

Jihoon KimToss Payments Server Developer

Hong Seong-minAI Agent Developer (2nd Year)

In just 4 hours, your direction for the next 6 months will be set.

20-minute presentation × 4 sessions + Q&A + 2 hours of networking (16:00 – 18:00)

A place where you can ask speakers questions directly and where the person sitting next to you becomes your next colleague. These are things you can never get from YouTube.

https://nerd.aviss.kr/archive/4

Many students ask about the method or cycle of solving wrong problems.

I created this explanation video.

And I will share an Excel file of review notes related to incorrect questions.

Explanation video: https://youtu.be/kFyz6tEhwAw

File sharing link: https://blog.naver.com/jhc9639/223954711463

If you systematically review by printing or managing it in Excel, you will be able to completely master the wrong problems 😊😊

thank you

Hello 😊😊

If you look at the codes these days, it doesn't come up often, but when it does come up, if you don't know the concept, you'll have a hard time.

LCS, I've prepared a special lecture on the concept of Union Find. 😊😊

The algorithm concept textbook has also been updated to the latest version, so please download it.

I hope you will complete the course by the 8th week -> and take the All Solve special lecture to make sure you pass the coding test.

thank you

Hello 😊😊

This time, there was a problem with partial disconnection in lecture 6-F, and Sae-am reported the issue, so I quickly fixed it and uploaded it.

If you experience any inconvenience while listening to the lecture in the future, please let me know at any time and I will correct it as quickly as possible.

And this July, there is a special lecture update for ALL SOLVE.

Thank you very much for your interest.^_^

Other modified images

• 8-2 Dijkstra Concept Lecture

We will do our best to help you pass the coding test.

Instructor lifts a big stone.

Announcement of lesson plan update

Some typos corrected and

1.16 Added attitude towards studying algorithms - a way to think.

Hello, the lesson plan has been updated to version 25.03.05.

The following parts have been revised as key points. Please take note. 😃

• Rotate a 2D array

• &* Add description

• Added explanation of implicit type conversion of vector size()

• Added caution regarding vector size() infinite loop

• Added sizeof description

• Partial typo correction

thank you

Hello students, haha

What should I do if the coding test is only possible with Java and JavaScript?

Whenever this question comes up, I tell my lectures - you can study with C++ and then port it.

I made a video explaining this in more detail. It explains how to port Java and JavaScript like this.

Please note that when viewing the code in other languages,

https://youtu.be/-zGFtwIiJ4s

We will do our best to help you pass the coding test.

Instructor lifts a big stone.

Hello 🙂

This course is constantly being updated and we will notify you of the contents of this section. 🙂

C++ Lecture Notes: 24.07.18

• Things to be careful of when initializing char

• Things to be careful of when using memcpy()

• Q. I get an error message saying "can't open file for writing."

• getline

• cout prints real number type

• stable_sort()

• Difference between sort() and stable_sort()

• vector initialization

• string :: push_back()

• TrivallyCopyable

• copy()

• const keyword

• The principle of sort()

• operator()

• substr()

• memset()

• Why should the base case be placed first?

• Q. Why are insertion and deletion in a linked list O(1)?

• Q. Why is insertion and deletion in an array O(N)?

• The entire lesson plan has been revised to include neat illustrations.

• Week 1: Added explanation of the main logic part of the recursive function

• Added explanation of type conversion part

• Added m2macbook bits/stdc++.h setting method

• &b[0][0] + 10 * 10 Additional explanation

• Variable initialization order issue

• Why should priority queues be set in the opposite direction?

• vector related picture modification

• s[i] - '0'

• Find() time complexity explanation supplemented

• combi() description and code enhancements

Problem Solving Instructions: 24.06.08

• 4 - M

• 6 - L

• 7 - E

• 1 - Added L recursive solution and added lecture

Problem solving lecture

This commentary lecture has been updated with more details.

• 6 - O

• 6 - L