Skills › Algorithms & Data Structures

Advanced Algorithms

Apply greedy algorithms, backtracking, and understand NP-completeness.

advanced ⚡ Algorithms & Data Structures
0%
Confidence · no data yet
Sign in to track

After this skill you can…

  • Implement backtracking for constraint problems
  • Apply greedy proofs for correctness
  • Explain P vs NP and common NP-hard problems

Prerequisites

Dynamic Programming

Watch (9 videos)

N-th Tribonacci Number - Leetcode 1137
NeetCodeIO · intermediate hands-on
→ Optimize algorithm performance→ Apply dynamic programming to real-world problems
Day 5 | Pushing the limits | Leveling Up In Competitve Programming | Geek-O-Lympics 2023
GeeksforGeeks · advanced hands-on
→ Implement efficient algorithms→ Analyze problem complexity→ Optimize code performance
Greedy Algorithms - Algorithms & Data Structures #8
NeuralNine · intermediate hands-on
→ Optimize Algorithmic Solutions→ Apply Greedy Algorithms to Real-World Problems→ Evaluate Algorithmic Trade-Offs
Solving Titanic Kaggle Competition in Azure ML | Part 2
Data Science Dojo · beginner
Sieve of Eratosthenes | Competitive Programming Live Course
GeeksforGeeks · beginner
P vs. NP by Sammy Mehra
CS50 · beginner
Problem 8 Solution-Anagram Check Analysis Using Python - Competitive Programming
Krish Naik · intermediate
Various Components Of CTC Salaries. Important To Understand Your In Hand Salary
Krish Naik · intermediate
Is Simulating Wet Papers Possible? 📃💧
Two Minute Papers · advanced
→ Simulate complex physics-based phenomena→ Implement a reproducing kernel particle method