Given an array of meetings: struct meeting { start_time; end_time; bool conflict; }
Set conflict = True for all meetings that conflict with some other meeting. Can anyone give a solution of O(NlogN) or less? -- Shuaib -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.