Home Problem Set Companies Projects Contribute Requests

Loading Question...

Subsidised Trail Permits Inmobi - IIT Bombay Online Assessment | Codinzhub

CodinzHub

Home Problem Set Companies Projects Contribute Requests

Subsidised Trail Permits Inmobi - IIT Bombay

Mode: On-Campus Exam Pattern: 3 Coding OA Date: 2026-10-23

A trekking region has N mountain huts, numbered from 1 to N, connected

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

Return the minimum possible total amount paid for permits across all Q treks.

solution.cpp

Loading code editor...

Run code to see test results

00:00 / 69:42

Subsidised Trail Permits Inmobi - IIT Bombay

MediumMed•101 views•SDE•55LPA

Mode: On-Campus Exam Pattern: 3 Coding OA Date: 2026-10-23

A trekking region has N mountain huts, numbered from 1 to N, connected

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

Return the minimum possible total amount paid for permits across all Q treks.

MediumMed•101 viewsOn-CampusSDE55LPA

Asked at

Inmobi

Subsidised Trail Permits Inmobi - IIT Bombay

Access the full question

Subsidised Trail Permits Inmobi - IIT Bombay

Access the full question

Published by Codinzhub

More from Inmobi

Widest-crate-through-a-belt-network-within-k-transfers Inmobi - IIT Bombay

Minimum-badges-on-the-packing-line Inmobi - IIT Bombay

Advertiser - Publishing Ad Campaign pbm Inmobi - IIT, Kharagpur

Inmobi SDE1 interview experience 2026

Inmobi SDE 1 Interview Experience - 2026