LIC Claim Priority Processing Queue
LIC Claim Priority Processing Queue
HardArrays0% accepted
A Pune LIC insurance branch processes claims daily. Each claim has urgency level (1-5), claim amount, and investigation hours. Process claims optimally by prioritizing urgent claims while minimizing total investigation time. Find the ideal processing sequence.
Approach
Given claims [[urgency, amount, complexity_hours]], arrange optimal processing order prioritizing urgency and resolution speed.
Input
[[5,100000,2],[1,50000,1],[3,75000,5],[5,60000,1]]
Output
[[5,60000,1],[5,100000,2],[3,75000,5],[1,50000,1]]
More Arrays problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards