← 💻 Coding & Engineering CraftNEXT IN CODING & ENGINEERING CRAFTInterval Problems→
Core
Greedy Algorithms
Greedy algorithms build a solution by always taking the locally best choice and never reconsidering. They are fast and simple, but only correct when a greedy choice is provably globally optimal, which you justify with an exchange argument. Applied-AI interviews probe greedy because the screen is whether you can tell when it works (interval scheduling, Huffman) from when it silently returns a wrong answer, and whether you reach for DP instead.
a free account unlocks the core curriculum tier · no card
RELATED CONCEPTS
PRACTICE THIS IN REAL QUESTIONS
MLOps & ML EngineeringYour model's p99 inference latency is too high. How do you bring it down without retraining?→Machine Learning & Data ScienceCompare SGD, momentum, RMSProp, Adam, and AdamW. Why does AdamW decouple weight decay?→Coding & DSAHow do you recognize and solve a dynamic-programming problem? Walk through one end to end.→System Design for AI in ProductionDesign a dynamic pricing engine (e.g. ride-sharing, e-commerce, travel).→ML Infrastructure & GPUsWhat consumes GPU memory during training/inference, and how do you fit a model that doesn't?→Machine Learning & Data ScienceWhat are multi-armed bandits, and when do you use them instead of A/B testing?→
COMPANIES THAT ASSUME THIS