def HiringProblem(score, n):
    sample_size = int(round((n / e)))
    print(f'''
Rejecting first {sample_size} candidates as sample''')
    best_candidate = 0
    for i in range(1, sample_size):
        if (score[i] > score[best_candidate]):
            best_candidate = i
    for i in range(sample_size, n):
        if (score[i] >= score[best_candidate]):
            best_candidate = i
            break
    if (best_candidate >= int(sample_size)):
        print(f'''
The best Candidate found is {(best_candidate + 1)} with score {score[best_candidate]}''')
    else:
        print("Couldn't find a best candidate")
def HiringProblem(score, n):
    sample_size = int(round((n / e)))
    print(f'
Rejecting first {sample_size} candidates as sample')
    best_candidate = 0
    for i in range(1, sample_size):
        if (score[i] > score[best_candidate]):
            best_candidate = i
    for i in range(sample_size, n):
        if (score[i] >= score[best_candidate]):
            best_candidate = i
            break
    if (best_candidate >= int(sample_size)):
        print(f'
The best Candidate found is {(best_candidate + 1)} with score {score[best_candidate]}')
    else:
        print("Couldn't find a best candidate")