<p>Given two integers n and k, return <em>an array of all the integers of length </em><code>n</code><em> where the difference between every two consecutive digits is </em><code>k</code>. You may return the answer in <strong>any order</strong>.</p>

<p>Note that the integers should not have leading zeros. Integers as <code>02</code> and <code>043</code> are not allowed.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 3, k = 7
<strong>Output:</strong> [181,292,707,818,929]
<strong>Explanation:</strong> Note that 070 is not a valid number, because it has leading zeroes.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 2, k = 1
<strong>Output:</strong> [10,12,21,23,32,34,43,45,54,56,65,67,76,78,87,89,98]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= n &lt;= 9</code></li>
	<li><code>0 &lt;= k &lt;= 9</code></li>
</ul>

class Solution {
public:
    int n;
    int k;
    vector<int> numsSameConsecDiff(int n, int k) {
        this->n = n;
        this->k = k;
        
        string curr = "";
        vector<int> ans;
        backtrack(curr, ans,-1);
        
        return ans;
        
    }
    
    void backtrack(string& curr, vector<int>& ans, int pos){
        if(pos >= 1){
            int prev = curr[pos-1] -'0';
            int now = curr[pos] - '0';
            
            int diff = abs(prev - now);
    
            if(diff != k) return;
        }
        
        if(curr.size() == n){
            ans.push_back(stoi(curr));
            return;
        }
        
        int start = 0;
        if(pos == -1) start = 1;
        
        for(int i = start; i <= 9; i++){
            curr.push_back(i + '0');
            backtrack(curr, ans, pos+1);
            curr.pop_back();
            
        }
    }
    
};
10500