package com.fishercoder.solutions;

import java.util.List;

/**
 * 1291. Sequential Digits
 *
 * An integer has sequential digits if and only if each digit in the number is one more than the previous digit.
 * Return a sorted list of all the integers in the range [low, high] inclusive that have sequential digits.
 *
 * Example 1:
 * Input: low = 100, high = 300
 * Output: [123,234]
 *
 * Example 2:
 * Input: low = 1000, high = 13000
 * Output: [1234,2345,3456,4567,5678,6789,12345]
 *
 * Constraints:
 * 10 <= low <= high <= 10^9
 * */
public class _1291 {
    public static class Solution1 {
        public List<Integer> sequentialDigits(int low, int high) {
            //TODO: implement it
            return null;
        }
    }
}

@@ -57,488 +57,8 @@
 t;%0A%0A
-/**%0A * 1291. Sequential Digits%0A *%0A * An integer has sequential digits if and only if each digit in the number is one more than the previous digit.%0A * Return a sorted list of all the integers in the range %5Blow, high%5D inclusive that have sequential digits.%0A *%0A * Example 1:%0A * Input: low = 100, high = 300%0A * Output: %5B123,234%5D%0A *%0A * Example 2:%0A * Input: low = 1000, high = 13000%0A * Output: %5B1234,2345,3456,4567,5678,6789,12345%5D%0A *%0A * Constraints:%0A * 10 %3C= low %3C= high %3C= 10%5E9%0A * */%0A
 publ

refactor 1291