Lessons

10 lessons • 1h 48m
Invalid Date

NaN

Introduction and Applications of Greedy Approach (in Hindi)

14m 09s

Invalid Date

NaN

Knapsack Problem and Huffman Coding (in Hindi)

11m 03s

Invalid Date

NaN

Optical Merge Pattern and Minimum Cost Spanning Tree (in Hindi)

13m 36s

Invalid Date

NaN

Dijsktra's Algorithm and Bellman Ford Algorithm (in Hindi)

11m 53s

Invalid Date

NaN

Graph Based Algorithms (DFS and BFS) (in Hindi)

11m 02s

Invalid Date

NaN

Breadth First Search (in Hindi)

7m 07s

Invalid Date

NaN

Directed Acyclic Graph (DAG) and Topological Sorting (in Hindi)

9m 45s

Invalid Date

NaN

Previous Year Questions: Part 1 (in Hindi)

9m 55s

Invalid Date

NaN

Previous Years Question: Part 2 (in Hindi)

9m 58s

Invalid Date

NaN

Previous Year Questions: Part 3 (in Hindi)

9m 50s

Unacademy is India’s largest online learning platform. Download our apps to start learning


Starting your preparation?

Call us and we will answer all your questions about learning on Unacademy

Call +91 8585858585
Company
About usShikshodayaCareersBlogsPrivacy PolicyTerms and Conditions
Products
Learner appLearner appEducator appEducator appParent appParent app

© 2026 Sorting Hat Technologies Pvt Ltd