We can use the 37% rule as suggested by the Optimal Stopping algorithm, I suppose this is very similar to the Secretary problem. So, in a pool of 100 applicants, talk to the first 37 people, stop there, and choose among the 37. This is the first chapter of "Algorithms to Live by" (B. Christian and T. Griffiths)
I have that book but did not complete read yet. Looks like I need to give it a shot. :)
Thanks for pointing that out.
We’re a place where coders share, stay up-to-date and grow their careers.
We strive for transparency and don't collect excess data.