Expression Conversion

Medium Algorithmic Challenges

Solve in Playground →

Problem Statement

Write a C program to convert an infix expression into its corresponding postfix notation.

Input Format

An infix expression string S.

Output Format

Print the converted postfix expression string.

Constraints

1 <= Length <= 50

Sample Input

a+b*c

Sample Output

abc*+

Explanation

Converts infix notation a+b*c to postfix abc*+ respecting operator precedence.

Starter Code

#include <stdio.h>
#include <string.h>

int precedence(char c) {
    if (c == '^') return 3;
    if (c == '*' || c == '/') return 2;
    if (c == '+' || c == '-') return 1;
    return -1;
}

int main() {
    char s[51];
    if (scanf("%50s", s) == 1) {
        // Write your code here
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →