Round 1
Questions:
- Knapsack Problem: Given two arrays corresponding to power and quantity, with a maximum power value provided, the task is to maximize the quantity.
- Minimum Spanning Tree (MST) Problem: The goal is to minimize the cost of connecting points.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.