Available question text
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.
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 1849. Splitting a String Into Descending Consecutive Values
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source