akashchouhan16 / data-structures-and-algorithms Goto Github PK

Statement:
A k-booking happens when k events have some non-empty intersection (i.e., there is some time that is common to all k events.)
You are given some events [start, end), and after each given event, return an integer k representing the maximum k-booking between all the previous events.

//Implement the Calendar class:
class Calendar{
 public:
  Calendar() {} /* Initializes the object.*/
  int book(int startDate, int endDate);
  /* Returns an integer k representing the largest integer
      such that there exists a k-booking in the calendar*/
};

You are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a triple booking.

A triple booking happens when three events have some non-empty intersection (i.e., some moment is common to all the three events).
The event can be represented as a pair of integers start and end that represents a booking on the half-open interval [start, end), the range of real numbers x such that start <= x < end.

Implement the Calendar class:

class Calendar{
   Calendar() {} /*Initializes the calendar object.*/
   bool book(int startDate, int endDate); 
    /*Returns true if the event can be added to the calendar successfully
       without causing a triple booking. Otherwise, return false and do not
       add the event to the calendar.*/
};

• Problems on Stack, inside a sub-folder called "Stack" to be added.
• Update README.md, to include "Stack" in the Topics list.

• Language accepted: C++
• Refer this 2min read before making a PR: Contributing guidelines
• Problem Statement: You have n flower seeds. Every seed must be planted first before it can begin to grow, then bloom. Planting a seed takes time and so does the growth of a seed. You are given two 0-indexed integer arrays plantTime and growTime, of length n each.
  - plantTime[i] is the number of full days it takes you to plant the ith seed. Every day, you can work on planting exactly one seed.
  - You do not have to work on planting the same seed on consecutive days, but the planting of a seed is not complete until you have worked plantTime[i] days on planting it in total.
  • growTime[i] is the number of full days it takes the ith seed to grow after being completely planted. After the last day of its growth, the flower blooms and stays bloomed forever.
  • From the beginning of day 0, you can plant the seeds in any order.
  • Return the earliest possible day where all seeds are blooming.
• Link: Earliest Possible Day of Full Bloom