Infix to Prefix

Hard Stack: Applications PRO
🔒 Login to Unlock

Problem Statement

Write a C program to convert an infix expression to a prefix expression using a stack.

Input Format

A valid infix expression string.

Output Format

Print the converted prefix expression string.

Constraints

1 <= string length <= 100

Sample Input

A+B*C

Sample Output

+A*BC

Explanation

Reverse infix expression, swap parentheses, convert to postfix, and reverse the result to obtain prefix expression.

Starter Code

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

int main() {
    char expr[100];
    if (scanf("%s", expr) == 1) {
        // Write your code here to convert infix to prefix
    }
    return 0;
}

Limits

  • Time Limit: 1s
  • Memory Limit: 256MB

Embedded C Programming

Updated: March 15, 2026
Intermediate

Embedded systems rely on efficient low-level programming to interact directly with hardware. In this course, you will learn how to write practical Embedded C programs used in real microcontroller-based systems. Rather than focusing only on theory, this course follows a practice-driven approach. Each lesson includes hands-on coding exercises that simulate real firmware development tasks used