Compute Optimal Dependency Upgrade Path | Dataford Interview Questions

Given a list of software dependencies and their known vulnerabilities, write an algorithm to determine the optimal upgrade path to resolve all critical security issues.

Input includes critical issue IDs and upgrade actions. Each action has an ID, dependency, cost, issues it resolves, and prerequisite action IDs. Return the minimum-cost sequence of action IDs, or [] if no valid sequence resolves every issue.

Use def optimal_upgrade_path(critical_issues, upgrades):; critical_issues is a list of strings and upgrades is a list of dictionaries. Assume action IDs are unique and there are at most 20 actions.

Constraints

1 <= len(critical_issues) <= 20
1 <= len(upgrades) <= 20
Each action ID is unique
Each action cost is a non-negative integer
Every prerequisite references another action ID
An action may resolve zero or more critical issues
Return the minimum-cost path; return [] when no complete path exists

Function Signature

def optimal_upgrade_path(critical_issues, upgrades):

Your question is Compute Optimal Dependency Upgrade Path. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given a list of software dependencies and their known vulnerabilities, write an algorithm to determine the optimal upgrade path to resolve all critical security issues.

Constraints

1 <= len(critical_issues) <= 20
1 <= len(upgrades) <= 20
Each action ID is unique
Each action cost is a non-negative integer
Every prerequisite references another action ID
An action may resolve zero or more critical issues
Return the minimum-cost path; return [] when no complete path exists

Function Signature

def optimal_upgrade_path(critical_issues, upgrades):

Your question is Compute Optimal Dependency Upgrade Path. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.