From 745d4c443d381df54cb0d218de93945fe1a694c5 Mon Sep 17 00:00:00 2001 From: Rajesh Rathore Date: Sun, 4 Aug 2024 20:41:38 +0530 Subject: [PATCH] Update DSA-problem-solving-techniques.md --- DSA-problem-solving-techniques.md | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/DSA-problem-solving-techniques.md b/DSA-problem-solving-techniques.md index 6477d50..94c1ce6 100644 --- a/DSA-problem-solving-techniques.md +++ b/DSA-problem-solving-techniques.md @@ -830,3 +830,27 @@ function addTwoNumbers(l1, l2) { ``` These approaches provide a robust framework for solving a wide range of linked list problems. By understanding these techniques, you can tackle most linked list-related challenges efficiently. + + // Function to find the maximum number of meetings that can + // be performed in a meeting room. + maxMeetings(n, start, end) { + let count = 1; + let meetings = []; + + for (let i = 0; i < n; i++) { + meetings.push([end[i], start[i]]); + } + + meetings.sort((a, b) => a[0] - b[0]); + + let last = meetings[0][0]; + + for (let i = 1; i < n; i++) { + if (meetings[i][1] > last) { + count++; + last = meetings[i][0]; + } + } + + return count; + }