Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5646 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4716 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@skj7 | 671 |

@gurshehzadsingh | 418 |

@swastik8750 | 411 |

@nishunishuraj18 | 405 |

@vedantvalsangkar | 390 |

@deepakchowdary | 380 |

@akashverma4 | 369 |

@satyamannsm | 353 |

@2018uec1603 | 341 |

@rkrupeshkumar345 | 335 |

@surajmamgai | 330 |

Complete Leaderboard |

Given an integer **N**, print all the **N** digit numbers in increasing order, such that their digits are in strictly increasing order(from left to right).

**Example 1:**

Input:N = 1Output:0 1 2 3 4 5 6 7 8 9Explanation:Single digit numbers are considered to be strictly increasing order.

**Example 2:**

Input:N = 2Output:12 13 14 15 16 17 18 19 23....79 89Explanation:For N = 2, the correct sequence is 12 13 14 15 16 17 18 19 23 and so on up to 89.

**Your Task: **

You don't need to read input or print anything. Your task is to complete the function **increasingNumbers**() which takes an integer N as an input parameter and return the list of numbers such that their digits are in strictly increasing order.

**Expected Time Complexity:** O(N)

**Expected Auxiliary Space:** O(N)

**Constraints:**

1 <= N <= 9

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
N Digit numbers with digits in increasing order

...