Coders Crushby Napplied AI
Back to Arena
HardScheduling Algorithms

Optimal Meeting Scheduler

Given N people with their available time slots across different timezones, find the optimal meeting time that maximizes attendance while minimizing inconvenience (meetings at odd hours).

Constraints
Each person has 0-24 hour availability windows. Inconvenience score: meetings before 8am or after 8pm in local time.
Coders Crushby Napplied AI

The ultimate interview preparation platform. Master System Design, DSA, and tackle community challenges to crush your FAANG interviews.

System Design

  • All Problems
  • Easy
  • Hard

DSA

  • All Problems
  • Dynamic Programming
  • Graphs

More

  • Problems Arena
  • Growth Paths
  • AI Discovery

Coders Crush by Napplied AI - Built for engineers preparing for FAANG/MAANG interviews

Examples & Scenarios
Input: 3 people in NYC, London, Tokyo with various availabilities

This is an Arena challenge - solutions are not shown publicly.

Work on this problem and submit your solution to contribute!

Stats
Views
0
Solutions
0
Submitted By

Coders Crush Team

12/11/2025

Tags
IntervalsOptimizationTimezone