Write a java program to print 1 to 100 numbers without using loop. This problem is very interesting and tricky for beginners. You have to think how you can print numbers from 1 to 100 without using for and while loop in your code.
We can easily solved this problem using loop (for and while loop). But suppose you don’t have to use loop to print the numbers.
How to implement a queue using two stacks. In this tutorial, I am going to discuss how to implement a first in first out (FIFO) queue using only two stacks.
In this problem, we are going to implement following methods of QueueUsingStack class:
void push(int x) – Insert an element x.
int pop() – Removes the element (In FIFO order).
int peek() – Returns the element which is present at the front of the queue.
boolean empty() – Returns true if no element is present else false.
For example –
|
1 2 3 4 5 6 |
QueueUsingStack qu = new QueueUsingStack(); qu.push(5); // Element in queue is : [5] qu.push(4); // elements are : [5, 4] qu.peek(); // return 5 qu.pop(); // return 5, queue is [4] qu.empty(); // return false |
Write a php program to print prime numbers between 1 to N. In this tutorial, we are going to use Sieve of Eratosthenes algorithm to print prime numbers between 1 to N.