Quick Overview

A graph and topological-sorting interview problem about inferring an alphabet from sorted password hints. Candidates must detect invalid prefixes and cycles, include every observed character, and return the lexicographically smallest valid order.

Infer the Smallest Valid Character Order from Sorted Password Hints

Company: Rogo

Role: Machine Learning Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: A graph and topological-sorting interview problem about inferring an alphabet from sorted password hints. Candidates must detect invalid prefixes and cycles, include every observed character, and return the lexicographically smallest valid order.

Loading…