Aman Kumar

Problem statement Given a stack of integers , delete the middle element of the stack using only standard stack operations like push , pop , size , empty . If...

Problem statement Given an array of integers of size N , sort it in increasing order using a stack. Example : Sample input : 4 2 3 1 5 Sample...

Problem statement Given a queue having N numbers . Numbers in the queue is a permutation of first N natural numbers (1 to N) . You have to find out...

Problem statement Given an Infix arithmetic expression , convert it into an equivalent prefix expression. Expression will be given in the form of string , where alphabetic characters i.e a-z...

Problem statement Given an arithmetic expression in postfix notation , convert it into the equivalent infix notation. Sample example : Postfix Input : abc/-ad/e-* Infix output : ((a-(b/c))*((a/d)-e)) Postfix input...

Problem statement Given an arithmetic expression in postfix notation , convert it into the equivalent prefix notation. Sample example : Postfix input: abc/-ad/e-* Prefix output: *-a/bc-/ade Postfix input : ab*...

Problem statement Given an arithmetic expression in prefix notation , convert it into the equivalent postfix notation. Sample example : Prefix Input : *-a/bc-/ade Postfix output : abc/-ad/e-* Prefix input:...

Problem statement Given an arithmetic expression in prefix notation , convert it into the equivalent infix notation. Sample example : Prefix Input : *-a/bc-/ade Infix output : ((a-(b/c))*((a/d)-e)) Prefix input...

Given an Infix arithmetic expression , convert it into an equivalent postfix expression . Expression will be given in the form of string , where alphabetic characters i.e a-z or...