**Attending Workshops C++**

### Problem Statement :

A student signed up for n workshops and wants to attend the maximum number of workshops where no two workshops overlap. You must do the following: Implement 2 structures: 1. struct Workshop having the following members: The workshop's start time. The workshop's duration. The workshop's end time. 2 . struct Available_Workshops having the following members: An integer, n (the number of workshops the student signed up for). An array of type Workshop array having size n. Implement 2 functions: 1. Available_Workshops* initialize (int start_time[], int duration[], int n) Creates an Available_Workshops object and initializes its elements using the elements in the start_time[] and duration[] parameters (both are of size n ). Here, start_time[i] and duration[i] are the respective start time and duration for the ith workshop. This function must return a pointer to an Available_Workshops object. 2 . int CalculateMaxWorkshops(Available_Workshops* ptr) Returns the maximum number of workshops the student can attend—without overlap. The next workshop cannot be attended until the previous workshop ends. Note: An array of unknown size (n) should be declared as follows: DataType* arrayName = new DataType[n]; Input Format Input from stdin is handled by the locked code in the editor; you simply need to write your functions to meet the specifications of the problem statement above. Constraints 1 <= N <= 10^5 0 <= start_time(i) <= 10^3 0 <= duration(i) <= 10^3 Output Format Output to stdout is handled for you. Your initialize function must return a pointer to an Available_Workshops object. Your CalculateMaxWorkshops function must return maximum number of non-overlapping workshops the student can attend.

### Solution :

` ````
Solution in C :
struct Workshop {
int start_time, duration, end_time;
bool operator<(const Workshop& another) const {
return end_time < another.end_time;
}
};
struct Available_Workshops {
int N;
vector<Workshop> arr;
};
Available_Workshops* initialize(int start_time[], int duration[], int N) {
Available_Workshops* workshop = new Available_Workshops;
workshop->N = N;
for (int i = 0; i < N; i++) {
Workshop temp;
temp.start_time = start_time[i];
temp.duration = duration[i];
temp.end_time = start_time[i] + duration[i];
workshop->arr.push_back(temp);
}
return workshop;
}
int CalculateMaxWorkshops(Available_Workshops* ptr) {
int res = 0;
sort(ptr->arr.begin(), ptr->arr.end());
int end_time = -1;
for (int i = 0; i < ptr->N; i++) {
if (ptr->arr[i].start_time >= end_time) {
res++;
end_time = ptr->arr[i].end_time;
}
}
return res;
}
```

## View More Similar Problems

## Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →## Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func

View Solution →## Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →## Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

View Solution →## Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →## Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →