1003. Prefix to Postfix Conversion

You are given a valid prefix expression consisting of binary operators and single-character operands. Your task is to convert it into a valid postfix expression.

Prefix (Polish) notation places the operator before operands.

Postfix (Reverse Polish) notation places the operator after operands.

Example 1:

Input: expression = "+ab"

Output: "ab+"

Example 2:

Input: expression = "*+ab-cd"

Output: "ab+cd-*"

Now Your Turn!

Pick the correct output for the given input

Input: expression = "^a*bc"

Still unsure what the problem is asking ?

Let’s go through a few more examples, step by step, to make it clearer.

Constraints:

  • 1 <= expression.length <= 104
  • Expression contains only valid prefix characters (a-z, 0-9, +, -, *, /, ^)
  • Expression is guaranteed to be a valid prefix expression

Fun Facts

0
class Solution {
public:
string prefixToPostfix(const string& s) {
// Your code goes here
}
};
Test Case

Input:

Expression
to save your code