Generate all initial n numbers formed from 3 and 4

Given a size N, which indicates number of elements which is combination of 2 and 3. Our target is to print positive N number which is make by using of 2 and 3 digit values.

Important that generate number should be ascending order. For example.

 
Input N : 50
OutPut  : 
 3  4  33  34  43  44  333  334  343  344  433  434  443  444 
 3333  3334  3343  3344  3433  3434  3443  3444  4333  4334  
 4343  4344  4433  4434  4443 4444  33333  33334  33343  33344  
 33433  33434  33443  33444  34333  34334  34343  34344 
 34433  34434  34443  34444  43333  43334  43343  43344

Here given code implementation process.

1) Generate N serial number formed by the combination of 3 and 4 in java

2) Generate N serial number formed by the combination of 3 and 4 in c++

3) Generate N serial number formed by the combination of 3 and 4 in golang

4) Generate N serial number formed by the combination of 3 and 4 in c#

5) Generate N serial number formed by the combination of 3 and 4 in vb.net

6) Generate N serial number formed by the combination of 3 and 4 in php

7) Generate N serial number formed by the combination of 3 and 4 in node js

8) Generate N serial number formed by the combination of 3 and 4 in typescript

9) Generate N serial number formed by the combination of 3 and 4 in python

10) Generate N serial number formed by the combination of 3 and 4 in ruby

11) Generate N serial number formed by the combination of 3 and 4 in scala

12) Generate N serial number formed by the combination of 3 and 4 in swift

13) Generate N serial number formed by the combination of 3 and 4 in kotlin

« Previous Next »

Queue

Implement queue using linked list

Implement queue using doubly linked list

Level order Tree Traversal

Flatten binary tree nodes in level order from

Print Levels of all nodes in a Binary Tree

Find average of levels in binary tree

Print binary tree level in sorted order

Print the nodes at odd levels of a tree

Print the nodes at even levels of a tree

Print all palindromic levels of a binary tree

Print all prime levels of a binary tree

Print all nodes between the given two levels of a binary tree

Print alternate nodes in level order of a binary tree

Print all K-sum levels in a Binary Tree

Reverse alternate levels of a binary tree

Check if all levels of two trees are anagrams or not

Invert the levels of binary tree

Delete entire nodes of a binary tree

Check whether a given binary tree is complete or not

Efficiently implement n queues in a single array

Print top view of a binary tree using level order traversal

Priority queue using doubly linked list

Deque implementation using doubly linked list

Reverse first k elements of queue

Huffman coding using priority queue

Hamming decoding example

Canonical Huffman Coding

Construct Diamond Tree

Append the elements of queue in mirror-inverse order

Sum of nodes in top view of binary tree

Print leftmost and rightmost nodes of a binary tree

Print the middle nodes of each level of a binary tree

Print node at corresponding level in binary tree

Level sum of bitwise and operation in binary tree

Generate all initial n numbers formed from 3 and 4

Generate all initial n numbers formed from 0 1 and 2

Iterative diagonal traversal of binary tree

Find kth node in diagonal traversal of binary tree

Print all diagonal path of binary tree with intervals

Print all jumping numbers in ascending order by given limits

Print the boundary nodes in each level of the binary tree using queue

Implement circular queue using linked list

Implement priority queue with pair

Implement queue using stack

Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment

Name