Coding Interview Questions 2019- Graph Algorithms

Practice complex Coding Interview problems on Graph Algorithms, Graph Theory, Dynamic Programming and more

What you'll learn

Be absolutely prepared for a white board coding interview- Focusing on complex graph algorithms related question
Develop a strong intuition when approaching to solve new graph algorithm problems
Acquire some powerful tools and sophisticated tricks solving graph algorithm related problems
Practice how to use common graph algorithms - DFS, BFS, MST, Dijkstra and more

Requirements

The Concept of Dynamic Programming
knowledge of algorithms such as: BFS, DFS, Dijkstra, SCC, Minimal Spanning Trees

Description


We, in the ALGOLICIOUS team, offer you years of combined experience in the tech industry and together we created one of the leading graph algorithms coding interview courses out there.

Our goal is to make sure that you are absolutely prepared for a white board coding interview- Focusing on complex graph algorithm related questions (including dynamic programming), which require deep thinking and well understanding of problem solving concepts.

We will help you develop a strong intuition when approaching to solve new graph algorithm related problems and supply you powerful tools which will help you solve other problems you encounter and ace your coding interview.

We’re going to achieve that goal by solving complex graph algorithm interview questions.

The algorithmic problems we’ll solve together were handpicked by our team after combing through hundreds of interview questions from a variety of tech companies, varying from massive corporate empires to fresh new startups.

The questions in this course are considered hard and this is because they hide beneath them deep concepts.

By solving them you will develop a strong intuition when approaching to solve new problems and you will acquire some powerful tools and sophisticated tricks by doing so.

How the course is built?

For each subject you will be getting a series of comprehensive video tutorials showing you step by step how to approach and solve the problems you encounter, making sure that you understand everything:

Starting from introducing the question, making sure you understand what you need to solve, then vividly explaining the intuition (including graphic examples), moving on to describe the concepts and tricks hiding behind the problem, solving it and discussing the complexity analysis and at the end finishing off with a summary of what we’ve learned.

The algorithms subjects which are going to be covered in this course are:

Dynamic Programming Algorithms

Shortest Paths Algorithms

Lightest Paths Algorithms

Minimum Spanning Trees Algorithms

Strongly Connected Components Algorithms

And more…

This course is made for advanced learners who are preparing for their software engineer programming interviews,
so we are assuming that you are already familiarised to concepts listed above.

So, if your goal is to rock your algorithm coding then sign up today and get the job you you’ve always dreamed of.

Who this course is for:

Advanced learners who are preparing for their software engineer programming interviews
College students studying Computer Science
Programmers who want develop intuition solving graph algorithms related problems