def populateCounts(end) :
    """
    Given the maximum number through which the table needs to be populated, we form the table.

    Parameters
    ----------
    end - the extent of continuous missing letters in string (or the length of the table needed)

    Return
    ------
    table - with i'th index pointing to the number of possible combinations possible for 'i' missing letters
    """

    # Initialize a table
    # Element at index i : (edge_same[i], edge_different[i])
    table = [(None, None), (25, 24)]

    # Populate the table till the given number
    for i in range(2, end + 1) :
        table.append((
            (25 * table[i-1][1]),
            ((24 * table[i-1][1]) +  (1 * table[i-1][0]))
        ))
    
    # Return the populated table
    return table