Given a string s， return the lexicographically smallest subsequence of s that contains all the disti

You are given an integer array nums.，Your task is to find the number of pairs of non-empty subsequen

90

An integer has sequential digits if and only if each digit in the number is one more than the previo