Seat Reservation Manager | LeetCode 1845 | Design | DropBox | TreeSet | MinHeap

[@mdzeeshan1237]

@Naresh Gupta sir your explanation is superb. Sir, please make a video on Longest Happy String using priorityqueue

[@ankitmishra399]

class SeatManager { int arr[]; int d=0; public SeatManager(int n) { arr=new int[n+1]; } public int reserve() { arr[d]=1; d++; return d; } public void unreserve(int s) { int e=d; for(int i=s;i

[@ankitmishra399]

sir why this brute force show wrong ans instead of Time limit exceed