**Round 1 :-
**✅ Problem Statement

You are given a list of meetings, where each meeting is represented as:

[start_time, end_time, priority]

Example:

meetings = [
[1, 5, 2], # (start=1, end=5, priority=2)
[2, 6, 1],
[7, 9, 3]
]

Your task is to select the maximum number of non-overlapping meetings such that higher-priority meetings are preferred when there's a conflict.

✅ Expected Output (for the above example):
[[1, 5, 2], [7, 9, 3]]

These two meetings do not overlap, and they respect the priority constraint.

Then a query question :-
employees(id, name)
•projects(id, employee_id, hours_logged, name)

All employees who have logged the maximum number of hours . Sort all employees based on the ones who have put in maximum hours

**Round 2:-
**

To rearrange an array so that positives stay on the left and negatives on the right while preserving the original order, and doing it in O(1) extra space, you need an in-place stable partition.

Design URL shortener

Implement LRU cache