InterviewBit Problems
Meeting rooms : Solved
About the Meeting rooms : Solved category
(1)
OP solution by CRAZYCAT
(4)
Java easy O(N) solution
(2)
Easy C++ solution || O(nlog(n)) TC || O(1) SC
(1)
Minimum number of rooms will be equal to maximum number of meetings taking place during an interval, so we only need to find that
(1)
Simple and concise solution
(1)
Solution using coordinate mapping
(1)
C++ meeting khatam meeting suru solution
(3)
Multiset C++ Solution(Easy To Understand)
(1)
Minimum platform Approach C++
(1)
C++ Easy solution ( Min Platforms Approach )
(1)
Minheap(intuitive solution) c++
(1)
A solution with a simple and easy idea in Python
(2)
Could it be any simpler man!
(1)
Small and precise cpp
(4)
Easy to understand solution C++
(2)
Order N solution.. No sorting needed
(4)
Solution c++ easy to understand
(1)
Easy to understand 0(2*n) time and 0(2*n)
(1)
C++ Solution Explained with Comments
(1)
C++ Used Maps. Simple
(1)
Easy and Short C++
(1)
[C++] with comments
(1)
Help me to improve this solution giving TLE (Python 3) using two pointer
(1)
Simple using Sorting and Count
(1)
Python solution using heapq
(1)
Solution using priority_queue(minHeap) in c++
(1)
My Soln using custom sort
(1)
next page →