Topological Sort - Alien Dictionary (Infer Character Order)
What is the worst-case time complexity of building the graph and performing a DFS-based topological sort in the Alien Dictionary problem, given N words with total length C, U unique characters, and E edges?
