Given two queues with their standard operations (enqueue, dequeue, isempty, size), implement a stack with its standard operations (pop, push, isempty, size).
To solve this problem first we have to declare one queue as working queue then enqueue the first element in to that queue. after that when we have to push another element then we push another element in other queue then dequeue all elements of working queue one by one till it is empty and enqueue all into other queue in same order and set other queue as working queue. this is for pushing elements into stack(implemented in queues). for pop operation we just have to dequeue element from working queue that will be the top element for the stack. isempty = same isempty operation on working queue. size= size of the working queue.
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given "25525511135" , return ["255.255.11.135", "255.255.111.35"] . (Order does not matter)
I want to play a game on a circular table; the rules of which are something like this. (i) I will declare how many people are there initially which is say n. (ii) I will declare the starting position (iiI) I will declare k, which is the person i will keep killing till there is one survival. Eg:: if n =6 and k=3 i will first kill 3rd person then 6th person and so on finally 1st will survive. Now since you are the intelligent among the lot so i want you to come up with a formula which given k and n can help you figuring out a seat for yourself so that you will survive.
This comment has been removed by the author.
ReplyDeleteTo solve this problem first we have to declare one queue as working queue then enqueue the first element in to that queue.
ReplyDeleteafter that when we have to push another element then we push another element in other queue then dequeue all elements of working queue one by one till it is empty and enqueue all into other queue in same order and set other queue as working queue.
this is for pushing elements into stack(implemented in queues).
for pop operation we just have to dequeue element from working queue that will be the top element for the stack.
isempty = same isempty operation on working queue.
size= size of the working queue.
@gaurav yes this will work fine..:)
ReplyDelete