Objective: Given a graph represented by the adjacency List, write a Depth-First Search(DFS) algorithm to check whether the graph is … Read more
Earlier we had discussed how to evaluate prefix expression where operands are of single-digit. In this article, we will discuss … Read more
Prefix notation is a notation for writing arithmetic expressions in which the operands appear after their operators. There are no … Read more
Objective: Given a Prefix expression, write an algorithm to convert it into Postfix expression. Example: Input: Prefix expression: + A … Read more
Objective: Given a Postfix expression, write an algorithm to convert it into prefix expression. Example: Input: Postfix expression: A B … Read more
Objective: Given a Postfix expression, write an algorithm to convert it into Infix expression. Example: Input: Postfix expression: A B … Read more
Objective: Given a Prefix expression, write an algorithm to convert it into Infix expression. Example: Input: Prefix expression: + A … Read more
Objective: Given an Infix expression, write an algorithm to convert it into Prefix expression. Example: Input: Infix expression – A … Read more
Objective: Given a directed graph that represents a flow network involving source(S) vertex and Sink (T) vertex. Each edge in … Read more
Objective: Given an Infix expression, write an algorithm to convert it into Postfix expression. Example: Input: Infix expression – A … Read more
Infix notation is commonly used in arithmetic formula or statements, the operators are written in-between their operands. Let’s assume the … Read more
Objective: Given an array of integer write an algorithm to find the majority element in it (if exist). Majority Element: If … Read more
Objective: Given a linked list and integer ‘k’, write an algorithm to reverse the linked list in groups of size … Read more
Objective: Given a string, find a longest palindromic subsequence in it. What is Longest Palindromic Subsequence: A longest palindromic subsequence … Read more
Objective: – Given a binary tree, Do the reverse level order traversal. In our earlier post, we have seen normal Level Order Traversal. In reverse level order traversal we first need to print the last level followed by the second last level up to the root, which is the first level.
Example:
Approach: Use Stack