We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Dynamic Programming
  4. Interval Selection
  5. Discussions

Interval Selection

Sort 32 Discussions, By:

  • HotDogTax
     + 0 comments

    I understand the question after a good 15 minutes of reading. Not Google interview worthy problem solving skills yet, but I'm proud of myself for getting this far.

  • manjulamitti1239
     + 0 comments

    yes plz any one explain me problem statment

  • TChalla
     + 1 comment

    Solution for my fellow Pythoners

    def intervalSelection(intervals):
    intervals.sort(key = lambda x : x[1])
    noOfSelections = 0
    busy = [[0, 0], [0, 0]]
    for interval in intervals:
        if interval[0] > busy[1][1]:
            noOfSelections += 1
            busy[1] = interval
        else: 
            if interval[0] > busy[0][1]:
                noOfSelections += 1
                busy[0] = interval
                if interval[1] > busy[1][1]:
                    (busy[0], busy[1]) = (busy[1], busy[0])
    return noOfSelections

  • dev_m_i
     + 0 comments

    Why does Greedy approach gives correct answer?

  • nbcanhkhoa
     + 0 comments

    let approach this problem with greedy, may be you will find solution

Load more conversations