Education + Jobs Hiring Website - 2025

RIPPLING SDE-1/2/SDE-Intern OA Questions | CTC - 80 LPA | Kumar K | July 2026 |Set 5

0 like 0 dislike
71 views

ago in Online Assessments by Expert (139,050 points) | 71 views

1 Answer

0 like 0 dislike
greedy-suffix approach
sort all capacity
assign each task a processor using lower_bound()
then use suffix sum array for these assigned tasks
ans = max(ans,(sum+(m-i)-1/(m-i)) //ceil operation
now return 2*ans-1 //ans-1 for waiting too
ago by (180 points)

Categories

Get best answers to any doubt/query/question related to programming , jobs, gate, internships and tech-companies. Feel free to ask a question and you will receive the best advice/suggestion related to anything you ask about software-engineering , development and programming problems .

Related questions