Wildlife Sanctuary Tour Management

Problem Statement

Wildlife Sanctuary Tour Management Problem Description You manage a wildlife sanctuary whose habitats are numbered along a single trail. Tour group i walks the trail from habitat entryHabitat[i] to habitat exitHabitat[i] , so it occupies every habitat from its entry to its exit, both ends included. A habitat can hold only one tour group at a time. Report the smallest number of habitats that must be free at the same moment for every group to walk its route, which is the largest number of groups that share any single habitat. Function Description Complete the minimumHabitats(entryHabitat, exitHabitat, n) function. It takes the two arrays and their length, and returns the required number of habitats. Input Format The first line contains the integer n , the number of tour groups. The second line contains n integers, the values of entryHabitat . The third line contains n integers, the values of exitHabitat . Output Format Print a single integer: the largest number of groups occupying one ha