# What an efficient way to construct a n by n matrix with all entries -1?

you could write create an empty list and then, create a column of -1 and augment it to the previous columns, do this n times but is there a faster way?