⚡ CrackLab/Interview Prep

advancedReal Company Rounds

PayPal SE-3 online screening: solve 'Max Tasks That Can Be Completed in a Given Budget' — a greedy/DP optimization problem.

A real PayPal coding-round question testing whether you can recognize and implement a budget-constrained optimization pattern.

This is a Pro question

Sign in, then upgrade to Pro or Power to unlock this question and the full Interview Prep bank.

PayPal SE-3 online screening: solve 'Max Tasks That Can Be Completed in a Given Budget' — a greedy/DP optimization problem.

Next Step

Continue to Google SDE-2 phone screen: optimize a graph traversal to reduce space complexity from O(N) to O(1) while maintaining time efficiency. →← Back to all Company Round Scenarios questions