Your question is Second Largest String. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
How would you write a program to find the second largest string? Treat strings as distinct by their casefold() values and compare them lexicographically without regard to case; preserve the first spelling encountered for the returned value. Implement second_largest_string(strings), which accepts a list of strings and returns the second-largest distinct string, or None when fewer than two case-insensitive values exist.
def second_largest_string(strings):