<filename>leetcode/interview/mintent/Others/TD_X_01.py<gh_stars>1-10
'''
7. Sorted Search
Implement function count_numbers that accepts a sorted list of unique integers and, efficiently with respect to time used, counts the number of list elements that are less than the parameter less_than.

For example, count_numbers([1, 3, 5, 7], 4) should return 2 because there are two list elements less than 4.

'''

def unique_names(names1, names2):
    return list(set(names1 + names2))

if __name__ == "__main__":
    names1 = ["Ava", "Emma", "Olivia"]
    names2 = ["Olivia", "Sophia", "Emma"]
    print(unique_names(names1, names2)) # should print Ava, Emma, Olivia, Sophia
<filename>leetcode/interview/mintent/Others/TD_X_01.py<gh_stars>1-10
'''
7. Sorted Search
Implement function count_numbers that accepts a sorted list of unique integers and, efficiently with respect to time used, counts the number of list elements that are less than the parameter less_than.

For example, count_numbers([1, 3, 5, 7], 4) should return 2 because there are two list elements less than 4.

'''

def unique_names(names1, names2):
    return list(set(names1 + names2))

if __name__ == "__main__":
    names1 = ["Ava", "Emma", "Olivia"]
    names2 = ["Olivia", "Sophia", "Emma"]
    print(unique_names(names1, names2)) # should print Ava, Emma, Olivia, Sophia
7. Sorted Search Implement function count_numbers that accepts a sorted list of unique integers and, efficiently with respect to time used, counts the number of list elements that are less than the parameter less_than.  For example, count_numbers([1, 3, 5, 7], 4) should return 2 because there are two list elements less than 4. # should print Ava, Emma, Olivia, Sophia