Prioritize Earliest Project Deadlines

Problem

Given a list of projects where each project is represented as [duration, deadline], return the maximum number of projects that can be completed without missing any deadline. A project takes duration units of time and must be finished on or before deadline. Implement a function that returns an integer.

Constraints

• 1 <= len(projects) <= 10^4
• 1 <= duration, deadline <= 10^4
• Each project is a list of exactly two integers