This is a verified interview question from Inmobi. Candidates reporting seeing this problem in recent Online Assessments (OAs) and onsite rounds. Mastering "projects from cses sheet Inmobi - Indian Institute of Technology, Guwahati" covers key patterns like Other.
"**Mode:** On-Campus **Exam Pattern:** 2 coding question **OA Date:** 2025-08-08 ## projects from cses sheet There are n projects you can attend. For each project, you know its starting and ending days and the amount of money you would get as reward. You can only attend one project during a day. What is the maximum amount of money you can earn? Input The first input line contains an integer n: the number of projects. After this, there are n lines. Each such line has three integers a_i, b_i, and p_i: the starting day, the ending day, and the reward. Output Print one integer: the maximum amount of money you can earn. Constraints 1 <=n <= 2 *10^5 1 <=a_i <= b_i <= 10^9 1 <=p_i<=10^9 Example Input: 4 2 4 4 3 6 6 6 8 2 5 7 3 Output: 7"
Join thousands of developers practicing for Inmobi.