Algorithms for Job Interviews and Competitive Programming

Algorithms for Job Interviews and Competitive Programming, available at $34.99, has an average rating of 4.5, with 15 lectures, 5 quizzes, based on 282 reviews, and has 15409 subscribers.

You will learn about Find efficient solutions to algorithmic programming problems. Analyse why code runs slowly and significantly improve run time. Apply most important algorithms to solve real problems. This course is ideal for individuals who are Programmers who want to step up their coding game. or Coders preparing for a job interview. or Beginners in the competitive programming world. It is particularly useful for Programmers who want to step up their coding game. or Coders preparing for a job interview. or Beginners in the competitive programming world.

Enroll now: Algorithms for Job Interviews and Competitive Programming

Summary

Title: Algorithms for Job Interviews and Competitive Programming

Price: $34.99

Average Rating: 4.5

Number of Lectures: 15

Number of Quizzes: 5

Number of Published Lectures: 15

Number of Published Quizzes: 5

Number of Curriculum Items: 20

Number of Published Curriculum Objects: 20

Original Price: $49.99

Quality Status: approved

Status: Live

What You Will Learn

Find efficient solutions to algorithmic programming problems.

Analyse why code runs slowly and significantly improve run time.

Apply most important algorithms to solve real problems.

Who Should Attend

Programmers who want to step up their coding game.

Coders preparing for a job interview.

Beginners in the competitive programming world.

Target Audiences

Programmers who want to step up their coding game.

Coders preparing for a job interview.

Beginners in the competitive programming world.

You have some programming experience and now want to take your skills to a new level? Learning algorithms and mastering algorithmic thinking is by far the most effective way of rapidly improving as a developer and problems solver.
That’s why I will teach you the most interesting and useful algorithms in this course. (I intentionally skipped sorting algorithms as they are so over-discussed and rarely need to be implemented by yourself).
For each algorithm or topic, I give a concise explanation, example and implementation outline. Then it’s your turn to apply the new learned algorithm to solve real problems. For that, I hand-picked tasks from programming websites. When you struggle with an issue and need help, I answer every questionand provide personal feedback for your problems.
Sign up now and begin a new chapter in your programming world.

Course Curriculum

Chapter 1: Setup and Introduction

Lecture 1: Course Introduction

Lecture 2: Quick Introduction to Runtime Analysis and big-O notation

Lecture 3: Quick Introduction to C++ for Competitive Programmers

Chapter 2: Graphs I: Searching on Graphs

Lecture 1: Introduction to Graphs (Terms and Representation)

Lecture 2: The Depth-First-Search

Lecture 3: The Breadth-First-Search

Lecture 4: Topological Sorting

Chapter 3: Graphs II: Shortest Paths

Lecture 1: Dijkstras Algorithm – Part 1: Understand

Lecture 2: Dijkstras Algorithm – Part 2: Analyse

Lecture 3: Dijkstras Algorithm – Part 3: Implement

Lecture 4: Negative Edges: Bellman-Ford Algorithm

Lecture 5: All Distances: Floyd-Warshall Algorithm

Chapter 4: Writing Faster Algorithms with Dynamic Programming

Lecture 1: From Recursion to Memorization to Dynamic Programming

Lecture 2: The Knapsack Problem

Lecture 3: Dynamic Programming on Trees

Instructors

Florian Juengermann
Competitive Programmer, Harvard Student

Rating Distribution

1 stars: 8 votes

2 stars: 8 votes

3 stars: 48 votes

4 stars: 97 votes

5 stars: 121 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!