Question: 
Write a python function to find the largest product of the pair of adjacent elements from a given list of integers.


Model's Code:
def adjacent_num_product(nums):
    if len(nums) < 2:
        return None
    max_product = float('-inf')
    for i in range(len(nums) - 1):
        product = nums[i] * nums[i + 1]
        max_product = max(max_product, product)
    return max_product



Sample Correct Code:
def adjacent_num_product(list_nums):
    return max(a*b for a, b in zip(list_nums, list_nums[1:]))


Asserts:
assert adjacent_num_product([1,2,3,4,5,6]) == 30
assert adjacent_num_product([1,2,3,4,5]) == 20
assert adjacent_num_product([2,3]) == 6


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 366 of 974: 265/366 (72.40437158469946%): success