HP Coding Questions and Answers

#include <stdio.h>

void displaySteppingNumbers(int n, int m) {
    int queue[10000];
    int front = 0, rear = -1;

    for (int i = 1; i <= 9; i++) {
        queue[++rear] = i;
    }

    while (front <= rear) { int stepNum = queue[front++]; if (stepNum >= n && stepNum <= m) { printf("%d ", stepNum); } if (stepNum == 0 || stepNum > m) {
            continue;
        }

        int lastDigit = stepNum % 10;

        int stepNumA = stepNum * 10 + (lastDigit - 1);
        int stepNumB = stepNum * 10 + (lastDigit + 1);

        if (lastDigit == 0) {
            queue[++rear] = stepNumB;
        } else if (lastDigit == 9) {
            queue[++rear] = stepNumA;
        } else {
            queue[++rear] = stepNumA;
            queue[++rear] = stepNumB;
        }
    }
}

int main() {
    int n, m;
    printf("Enter the range [n, m]: ");
    scanf("%d %d", &n, &m);

    printf("Stepping Numbers between %d and %d: ", n, m);
    displaySteppingNumbers(n, m);

    return 0;
}

#include <iostream>
#include <queue>
using namespace std;

void displaySteppingNumbers(int n, int m) {
    queue<int> q; 
    for (int i = 1; i <= 9; i++) {
        q.push(i);
    }
    while (!q.empty()) {
        int stepNum = q.front();
        q.pop();
        if (stepNum >= n && stepNum <= m) {
            cout << stepNum << " ";
        }
        if (stepNum == 0 || stepNum > m) {
            continue;
        }
        int lastDigit = stepNum % 10;
        int stepNumA = stepNum * 10 + (lastDigit - 1);
        int stepNumB = stepNum * 10 + (lastDigit + 1);
        if (lastDigit == 0) {
            q.push(stepNumB);
        } else if (lastDigit == 9) {
            q.push(stepNumA);
        } else {
            q.push(stepNumA);
            q.push(stepNumB);
        }
    }
}

int main() {
    int n, m;
    cout << "Enter the range [n, m]: ";
    cin >> n >> m;
    cout << "Stepping Numbers between " << n << " and " << m << ": ";
    displaySteppingNumbers(n, m);
    return 0;
}

import java.util.LinkedList;
import java.util.Queue;

public class Main {
    public static void displaySteppingNumbers(int n, int m) {
        Queue<Integer> queue = new LinkedList<>();
        for (int i = 1; i <= 9; i++) {
            queue.add(i);
        }
        while (!queue.isEmpty()) {
            int stepNum = queue.poll();
            if (stepNum >= n && stepNum <= m) {
                System.out.print(stepNum + " ");
            }
            if (stepNum == 0 || stepNum > m) {
                continue;
            }
            int lastDigit = stepNum % 10;
            int stepNumA = stepNum * 10 + (lastDigit - 1);
            int stepNumB = stepNum * 10 + (lastDigit + 1);
            if (lastDigit == 0) {
                queue.add(stepNumB);
            } else if (lastDigit == 9) {
                queue.add(stepNumA);
            } else {
                queue.add(stepNumA);
                queue.add(stepNumB);
            }
        }
    }

    public static void main(String[] args) {
        int n = 0, m = 100;
        System.out.print("Stepping Numbers between " + n + " and " + m + ": ");
        displaySteppingNumbers(n, m);
    }
}

def displaySteppingNumbers(n, m):
    queue = []
    for i in range(1, 10):
        queue.append(i)
    while queue:
        stepNum = queue.pop(0)
        if stepNum >= n and stepNum <= m:
            print(stepNum, end=' ')
        if stepNum == 0 or stepNum > m:
            continue
        lastDigit = stepNum % 10
        stepNumA = stepNum * 10 + (lastDigit - 1)
        stepNumB = stepNum * 10 + (lastDigit + 1)
        if lastDigit == 0:
            queue.append(stepNumB)
        elif lastDigit == 9:
            queue.append(stepNumA)
        else:
            queue.append(stepNumA)
            queue.append(stepNumB)
n = 0
m = 100
print("Stepping Numbers between", n, "and", m, ": ", end='')
displaySteppingNumbers(n, m)