Available question text
Given a string of 'I' and 'D' of length n-1 that specifies whether each adjacent pair in a permutation of 1..n should be increasing or decreasing, construct the lexicographically smallest permutation that satisfies those relational constraints.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 484. Find Permutation
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source