Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 942. DI String Match
Given a string s of 'I' and 'D' of length n, construct any permutation of [0..n] such that perm[i] < perm[i+1] when s[i]=='I' and perm[i] > perm[i+1] when s[i]=='D'. This is solved greedily by assigning the smallest or largest remaining numbers to satisfy each local inequality.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.