Get free ebooK with 50 must do coding Question for Product Based Companies solved
Fill the details & get ebook over email
Thank You!
We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

## Building Heap from Array

Problem Statement: You are given an array of N elements. The task is to build a Binary Heap from the given array, either Max Heap or Min Heap. Quick Facts:...

## How to Check Given Number is Armstrong or not

In this article, We shall learn what a Java Armstrong Number is. The method for determining if a number is Armstrong or not will be shown, along with its code....

## Expression Evaluation

Problem Statement You will be given a string representing a mathematical expression. You have to evaluate it and return the result. Some Constraints The input string will be in Infix...

## Prim’s algorithm using priority_queue in STL

Embarking on the journey of understanding Prim's algorithm and its implementation using the priority_queue in the C++ Standard Template Library (STL) opens a gateway to the realm of efficient minimum...

## Conversion Infix notation to Prefix notation

The conversion from infix notation to prefix notation involves reversing the order of the expression, replacing each operator with its corresponding prefix operator, and swapping the positions of each operand....

## Conversion of Postfix expression to Infix expression

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...

## Postfix to Prefix Conversion

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*...

## Conversion of Prefix to Postfix notation

We have been given an arithmetic expression, and we have to write a program that converts prefix to postfix. The expression is given in the form of a string that...

## Conversion of Prefix expression to Infix expression

Conversion of prefix expression to infix expression involves rearranging the operators and operands to follow the rules of infix notation while maintaining the order of operations. This can be achieved...

## Infix to Postfix Conversion using Stack

We have given an Arithmetic Expression and we have to write a program that converts the infix to postfix using stack in C. The Expression will be given in the...