Greedy Algorithms Courses and Certifications

Back To Back SWE

Graphs, Greedy Algorithms, and Other Computer Science Fundamentals

Master graph algorithms, asymptotic analysis, and greedy techniques through hands-on problem solving and algorithmic fundamentals.

• YouTube
• 2 hours 50 minutes
• On-Demand
• Free Video

Algorithmic Toolbox

23 reviews

Master algorithmic techniques for efficient problem-solving: sorting, searching, divide-and-conquer, greedy algorithms, and dynamic programming. Gain practical skills in designing and implementing fast, effective solutions.

• Coursera
• 1 day 16 hours 3 minutes
• On-Demand
• Paid Course

Advanced Algorithms - COMPSCI 224

41 reviews

Explore cutting-edge algorithmic techniques through comprehensive lectures, enhancing problem-solving skills and deepening understanding of complex computational challenges.

• YouTube
• 1 day 11 hours
• On-Demand
• Free Video

CodeHelp - by Babbar

Greedy Algorithms in 1 Video

Comprehensive video on greedy algorithms, covering multiple problems with code examples. Ideal for placement preparation, offering practical insights and problem-solving techniques.

• YouTube
• 1 hour 30 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Greedy Method in Design and Analysis of Algorithms - Lecture 1

Master the Greedy Method in algorithm design through practical examples. Enhance problem-solving skills and optimize solutions for efficient computational processes.

• YouTube
• 2 hours 12 minutes
• On-Demand
• Free Video

Pragmatic AI Labs

Greedy Random Start Algorithms: From TSP to Daily Life

Explore greedy random start algorithms and their applications, from solving the Traveling Salesman Problem to practical uses in navigation, economic decisions, and everyday optimization challenges.

• YouTube
• 16 minutes
• On-Demand
• Free Video

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

1276 ratings at Coursera

The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

• Coursera
• 14 hours 41 minutes
• On-Demand
• Paid Course

Dynamic Programming, Greedy Algorithms

248 ratings at Coursera

Explore algorithm design techniques like divide-and-conquer, dynamic programming, and greedy algorithms. Learn about intractability and optimization problem-solving using linear/integer programming solvers.

• Coursera
• 1 day 14 hours 15 minutes
• On-Demand
• Paid Course

Greedy Algorithms Tutorial – Solve Coding Challenges

Master greedy algorithms to solve coding challenges in tech interviews. Learn through practical examples and tackle common problems to improve your problem-solving skills and interview performance.

• freeCodeCamp
• 1-2 hours
• On-Demand
• Free Video

Kunal Kushwaha

Huffman Coding Greedy Algorithm for Text Compression

Explore Huffman Coding for efficient text compression. Learn theory, implementation, and practical coding demonstration to optimize data storage and transmission.

• YouTube
• 49 minutes
• On-Demand
• Free Video

ICTP Mathematics

Symbolic Dynamics for Orbits with 0 Lyapunov Exponents - ICTP 2021

Explore symbolic dynamics for orbits with zero Lyapunov exponents, covering key concepts like spacing reduction, temperability, and the greedy algorithm.

• YouTube
• 1 hour 4 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Job Sequencing with Deadlines Using Greedy Method - Algorithm and Time Complexity

Explore job sequencing with deadlines using the greedy method, including examples, algorithm, and time complexity analysis in Design and Analysis of Algorithms.

• YouTube
• 20 minutes
• On-Demand
• Free Video

Microcredential

Algorithms

5985 ratings at Coursera

Comprehensive introduction to algorithms, covering key concepts and practical applications. Emphasizes conceptual understanding for technical interviews and professional discussions.

• Coursera
• 4 weeks, 10 hours a week
• On-Demand
• Paid Course
• 4 courses

Sundeep Saradhi Kanthety

Knapsack Problem Using Greedy Method - Optimization Problems in Design and Analysis of Algorithms

Master the Knapsack Problem using the Greedy Method algorithm, understanding its optimization approach and implementation for efficient problem-solving in Design and Analysis of Algorithms.

• YouTube
• 18 minutes
• On-Demand
• Free Video

Java Data Structures and Algorithms Masterclass

7779 ratings at Udemy

100+ DSA Interview Questions for Cracking FAANG with Animated Examples for Deeper Understanding and Faster Learning

• Udemy
• 1 day 22 hours 39 minutes
• On-Demand
• Paid Course