Zig-Zag World of Algorithm and Data Structures
Home
Home
Basic Data Structures
Advance Data Structures
Algorithms
Exercises
Interview Questions
Puzzles
Design Questions
Conferences and Papers
About The Blog
Tuesday, May 26, 2015
Microsoft Question: Given a list of events with start time and end time, find the events which have conflict with any other.
Problem:
Given a list of events with start time and end time, find the events which have conflict with any other.
Solution:
Problem can be solved using
interval overlapping
.
Complexity:
O(n)
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)

## No comments:

## Post a Comment