NETFLIX SWE OA (2022) | Graph-Based Language Ordering and Dynamic Pattern Validation Problems

Q1. Derive Character Ordering from an Unknown Language Problem Statement You are given a list of words sorted according to the lexicographical rules of an unknown language. Your task is to determine the order of characters in that language's alphabet. Return: Any valid character ordering if one exists. An empty string "" if the ordering is invalid. Example Input words = ["wrt","wrf","er","ett","rftt"] Output wertf Explanation Comparing adjacent words: wrt → wrf gives: t → f Comparing: wrf → er gives: ...