Largest Set of Compatible Jobs

Image for post
Image for post

Problem:

[(0, 6), (1, 4), (3, 5), (3, 8), (4, 7), (5, 9), (6, 10), (8, 11)]
[(1, 4), (4, 7), (8, 11)]

Solution:

using Job = std::pair<int, int>;

Complexity:

Testing:

Solutions to programming interview questions at some of the top companies in the world: cppcodingzen.com

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store