Practice Delete Columns to Make Sorted II
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an array of n strings strs, all of the same length. We may choose any deletion indices, and we delete all the characters in those indices for each string. For example, if we have strs = ["abcdef","uvwxyz"] and deletion indices {0, 2, 3}, then the final array after deletions is ["bef", "vyz"]. Suppose we chose a set of deletion indices answer such that after deletions, the final array has its elements in lexicographic order (i.e., strs[0] <= strs[1] <= strs[2] <= ... <= strs[n - 1]). Return the minimum possible value of answer.length.
Source: Delete Columns to Make Sorted II on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
strs = ["ca","bb","ac"]
1
# Example 2
strs = ["xc","yb","za"]
0
# Example 3
strs = ["zyx","wvu","tsr"]
3
Constraints
Related LeetCode Problems
Practice more problems similar to Delete Columns to Make Sorted II.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.