
Already know some of this? A 2-minute test skips the lessons you know.
Take the placement testA free 16-lesson course built from GateWay Classes's 3h 39m of YouTube video. 3 days at 90 minutes a day, with study notes and a quiz in every lesson. A 2-minute placement test skips what you already know.
Taught by GateWay Classes on YouTube. Videos play in YouTube's own player, so the creator keeps every view.
Understand the greedy choice property, optimization problems, and the standard pseudocode for greedy algorithms.
Solve the fractional knapsack problem by selecting items based on maximum profit-to-weight ratio to maximize total profit.
Construct a Minimum Spanning Tree using Prim's vertex-based approach with a min-heap, including pseudocode and O(E log V) complexity analysis.
Build an MST using Kruskal's edge-based greedy approach with Union-Find, including pseudocode, cycle detection, and O(E log E) complexity.
Differentiate Prim's (dense graphs) and Kruskal's (sparse graphs) algorithms, handle non-distinct edge weights, and list MST applications.
Compute shortest paths from a single source in graphs with non-negative weights using greedy vertex extraction and edge relaxation.
Solve single-source shortest paths with negative weights using dynamic programming, and detect negative weight cycles.
Reduce multiplication count from 8 to 7 for 2x2 matrices using Strassen's formulas, achieving ~O(n^2.81) complexity.
Find the smallest convex polygon enclosing all points using divide-and-conquer (QuickHull) and Graham Scan (O(n log n)) algorithms.
Compare linear search O(n) with binary search O(log n) on sorted arrays, including iterative/recursive implementations and recurrence relations.