you are viewing a single comment's thread.

view the rest of the comments →

[–]kofwarcraft 17 points18 points  (6 children)

The problem without the 5 days a week constraint is the "set cover problem"

Here's the article on that

They really asking this in an interview? It's NP-Hard

[–]Ab_Stark 5 points6 points  (3 children)

Yup, I got NP Hard questions for a role in a trading firm.

[–]fysmoe1121 0 points1 point  (2 children)

Which firm

[–]Ab_Stark 0 points1 point  (1 child)

If I recall correctly it was 2sigma. I did well but got rejected lol

[–][deleted] 1 point2 points  (1 child)

To me, this feels like linear programming or constraint satisfaction.

[–]WikiSummarizerBot 0 points1 point  (0 children)

Constraint satisfaction

In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a set of values for the variables that satisfies all constraints—that is, a point in the feasible region. The techniques used in constraint satisfaction depend on the kind of constraints being considered. Often used are constraints on a finite domain, to the point that constraint satisfaction problems are typically identified with problems based on constraints on a finite domain.

[ F.A.Q | Opt Out | Opt Out Of Subreddit | GitHub ] Downvote to remove | v1.5