• Duration 10 weeks
  • Lectures 4
  • Skill level beginner
  • Quizzes 0
  • Pass parcentages 80
  • Certificate No
  • User Avatar

    Innoskrit

  • Category:

    Data Structures and Algorithms

Free
  • 22 enrolled students
  • english

Topological Sort is used to find a linear ordering of elements that have dependencies on each other. For example, if […]

Topological Sorting – Graph

Target audiences

Topological Sort is used to find a linear ordering of elements that have dependencies on each other. For example, if task ‘B’ is dependent on task ‘A’, ‘A’ comes before ‘B’ in topological ordering.

This course will walk you through the technique for performing topological sorting on a set of elements and then solve a few problems using it. We will be using a pattern to solve multiple problems.

Let’s see this pattern in action.

Aakash Verma

Aakash Verma

Co-founder & Instructor

Aakash is a passionate teacher and a great problem-solver. Currently, he is working with ShareChat as a Software Engineer. He is an expert in Data Structures and Algorithms and is known for his amazing teaching style that makes everyone fall in love with coding. He mainly prepares students for coding interviews and CSF rounds.

0 Reviews

Write a Review

Main Content