Question 29

[komalvhanmane]

You are given a 2D integer array intervals where intervals[i] = [lefti, righti] represents the inclusive interval [lefti, righti].

You have to divide the intervals into one or more groups such that each interval is in exactly one group, and no two intervals that are in the same group intersect each other.

Return the minimum number of groups you need to make.

Two intervals intersect if there is at least one common number between them. For example, the intervals [1, 5] and [5, 8] intersect.

Example 1:

Input: intervals = [[5,10],[6,8],[1,5],[2,3],[1,10]] Output: 3 Explanation: We can divide the intervals into the following groups:

• Group 1: [1, 5], [6, 8].
• Group 2: [2, 3], [5, 10].
• Group 3: [1, 10]. It can be proven that it is not possible to divide the intervals into fewer than 3 groups.

[niteshjeganathan]

Hi, I would like to take this up. Please assign this to me. @komalvhanmane

[komalvhanmane]

@niteshjeganathan Please mention your college , name , year , branch .

[niteshjeganathan]

Vellore Institute of Technology, Vellore. Nitesh Jeganathan. 2nd year. Btech CSE Core. @komalvhanmane

[kasturimandlik]

Kasturi Mandlik Cummins college of engineering for women,pune Dept: electronics and telecommunication I would like to work on this issue. Can you please assign me?

[komalvhanmane]

@niteshjeganathan I have assigned you this issue . work on it :)

[NikitaMiraje]

Nikita Miraje CCOEW ENTC I would like to work on this issue....can you assign me??

[komalvhanmane]

@niteshjeganathan update?

[ManasiGDeshmukh]

Manasi Deshmukh CCOEW SY Computer Department can you assign this issue to me?

[ManasiGDeshmukh]

@komalvhanmane

[sharwaritijare]

@komalvhanmane Hey could you please assign me this issue. UEC2023260 FY Sharwari