---
title: "Discussion on \"Day 18 – Greedy Algorithms\" | Hashnode"
description: "Discussion on \"Day 18 – Greedy Algorithms\". 1. N Meetings in One Room\nProblem: Given start[] and end[] times of meetings, find the maximum number of meetings that can be held in one room where only one meeting can happen at a time.\nIntuition: Sort meetings by end time. Always pick the meeting ..."
url: "https://hashnode.com/posts/day-18-greedy-algorithms/687f072a61be54e0bb0fcfc4"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Day 18 – Greedy Algorithms](https://sids-dsa-journal.hashnode.dev/day-18-greedy-algorithms?utm_source=hashnode&utm_medium=feed)

1\. N Meetings in One Room Problem: Given start\[\] and end\[\] times of meetings, find the maximum number of meetings that can be held in one room where only one meeting can happen at a time. Intuition: Sort meetings by end time. Always pick the meeting ...

Jul 22, 2025 · 4 min read · sids-dsa-journal.hashnode.dev  
Read the article

-   [#cpp](https://hashnode.com/tag/cpp)
-   [#dsa](https://hashnode.com/tag/dsa)

## Written by

[Siddharth Gandhi](https://hashnode.com/@SidGandhiCodes)

@SidGandhiCodes

  
[View profile](https://hashnode.com/@SidGandhiCodes)

Learning. Building. Blogging. Repeat.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
