Essential Algorithm Concepts for Coding Tests in 2020 + Practice Test Problem Solving

Name: Essential Algorithm Concepts for Coding Tests in 2020 + Practice Test Problem Solving
Price: 79200 KRW
Rating: 2.3 (3 reviews)

This is the one and only final concept collection that anyone taking the 2020 SW competency test or coding test must read.

(2.3) 3 reviews

33 learners

Level Basic

Course period 1 months

algorithmjobs

Coding Test

What you will gain after the course

Final check for final preparation for coding test
Complete 6 areas and 99 sub-concepts in 12 hours!

Recommended for
these people

Who is this course right for?

Job seekers preparing for SW competency tests and coding tests
Students who want to learn the concepts of key algorithms

Hello
This is

Hello! We are Algorithm Jobs, the only educational institution in Korea specializing in algorithms.

Algorithm Jobs, led by CEO Jinho Son, a former Samsung Electronics SW algorithm interviewer,

In the past year alone, we have produced 46 successful candidates for the Samsung SW Competency Test and 99 successful candidates for coding tests.

We will be launching a course featuring Algorithm Jobs' unique expertise, so please stay tuned. Thank you.

Curriculum

All

101 lectures ∙ (13hr 22min)

Section 1. INTRO - Overall Algorithm Knowledge Map for SW Competency Test

1 lectures ∙ (6min)

1. Overall Algorithm Knowledge Map for SW Competency Test
06:47

Section 2. Lesson 1: Simulation (Exhaustive Search) Basics

12 lectures ∙ (1hr 21min)

2. Concept of conditional statement
01:16
3. Conditional statement grammar (if)
12:22
4. Concept of loop
01:05
5. Grammar of loop statement: while
11:01
6. Grammar of loop statement: for
08:27
7. Understanding Multiple Loops
07:43
8. The concept of arrays
05:46
9. Concept of two-dimensional array
02:22
10. Enter values into an array and print them out
07:40
11. Find the maximum value
11:00
12. Array Summary
00:54
13. Understanding full search
11:27

Section 3. Lecture 2 Time Complexity and Exhaustive Search of Recursive Functions

12 lectures ∙ (1hr 44min)

14. Concept of time complexity
04:16
15. Example 1 of time complexity
07:42
16. Example 2 of time complexity
13:37
17. Execution time based on input size
05:24
18. Actual execution time of O(n)
04:46
19. Actual execution time of O(n^2)
04:39
20. Estimate the execution time
05:29
21. Time complexity of sorting
11:11
22. Basics of exhaustive search using recursive calls
05:20
23. Operation of exhaustive search using recursive calls
16:00
24. Code for exhaustive search using recursive calls
13:26
25. Example of exhaustive search using recursive calls
12:40

Section 4. Lesson 3: Basic Data Structures and Stack & Queue

31 lectures ∙ (3hr 53min)

Section 5. Lesson 4 Basic Graph (BFS & DFS)

30 lectures ∙ (3hr 45min)

Section 6. Lesson 5 Advanced Graph (Dijkstra & Kruskal)

15 lectures ∙ (2hr 32min)

Published:

Last updated:

Reviews

All

3 reviews

2.3