How to convert prefix expression to postfix expression? Any sample code in C would be helpful?
Can we evaluate the infix expression with stack in one pass? Sample C/C++ code would be helpful...
convert a number m to n with minimum operations. The operations allowed were -1 and *2.
For Eg : 4 and 6. Answer is 2. 1st operation : -1 -> 4-1 = 3. 2nd operation : * -> 3 * 2 =6.
Considering a server that should ignore requests older than 1 second, create a structure to handle this behavior and give its complexity.
