Given a sequence of words and a line width, format the text to fit within the specified width. You must justify the text, distributing extra spaces evenly between words.

Determine if every row and every column in a given square matrix contains all the numbers from 1 to n, where n is the size of the matrix. Effectively, check if it's a valid Sudoku (without subgrids).

You're given employee names, key-card access times, and need to identify employees who used the same key-card three or more times within a one-hour period. Return these employees in sorted order.