Leetcode 1849. Splitting a String Into Descending Consecutive Values
Check if a digit string can be partitioned into two or more contiguous substrings whose integer values (leading zeros allowed) form a strictly descending consecutive sequence where every adjacent pair differs by exactly 1. This is essentially a partitioning/backtracking search to find contiguous segments that parse to consecutive decreasing integers.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.