Verify Ordering Under a Scrambled Alphabet

Company: Truefoundry

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Given a sequence of words and an alphabet string that lists every allowed character from smallest to largest, determine whether the words are sorted in nondecreasing lexicographic order under that alphabet. Work through the function contract, boundary cases, correctness argument, and time and space complexity expected in a production-quality solution.

Read the full Truefoundry Software Engineer interview experience this question came from