NetApp

Check if Graph is Bipartite – Adjacency List using Depth-First Search(DFS)

by

Objective: Given a graph represented by the adjacency List, write a Depth-First Search(DFS) algorithm to check whether the graph is … Read more

Evaluation of Prefix Expressions (Polish Notation) | Set 2

by

Earlier we had discussed how to evaluate prefix expression where operands are of single-digit. In this article, we will discuss … Read more

Evaluation of Prefix Expressions (Polish Notation) | Set 1

by

Prefix notation is a notation for writing arithmetic expressions in which the operands appear after their operators. There are no … Read more

Convert Prefix to Postfix Expression

by

Objective: Given a Prefix expression, write an algorithm to convert it into Postfix expression. Example: Input: Prefix expression:  + A … Read more

Convert Postfix to Prefix Expression

by

Objective: Given a Postfix expression, write an algorithm to convert it into prefix expression. Example: Input: Postfix expression:  A B … Read more

Convert Postfix to Infix Expression

by

Objective: Given a Postfix expression, write an algorithm to convert it into Infix expression. Example: Input: Postfix expression:  A B … Read more

Convert Prefix to Infix Expression

by

Objective: Given a Prefix expression, write an algorithm to convert it into Infix expression. Example: Input: Prefix expression: + A … Read more

Convert Infix to Prefix Expression

by

Objective: Given an Infix expression, write an algorithm to convert it into Prefix expression. Example: Input: Infix expression – A … Read more

Max Flow Problem – Ford-Fulkerson Algorithm

by

Objective: Given a directed graph that represents a flow network involving source(S) vertex and Sink (T) vertex.  Each edge in … Read more

Convert Infix to Postfix Expression

by

Objective: Given an Infix expression, write an algorithm to convert it into Postfix expression. Example: Input: Infix expression – A … Read more

Evaluation of Infix expressions

by

Infix notation is commonly used in arithmetic formula or statements, the operators are written in-between their operands. Let’s assume the … Read more

Merge K sorted Linked List – Using Priority Queue

by

Objective: Given, K sorted linked list, Write an algorithm to merge all the linked list into one linked list which … Read more

Valid Brackets – Part 2 | Stack Method

by

Objective: Given a string containing just the characters ( , ) determine if the input string is valid. Example: ()()(()(()))() valid: true … Read more

Find duplicates in an given array in O(n) time and O(1) extra space.

by

Objective: Given an array of integers, find out duplicates in it. Example: int [] a = {4, 6, 2, 1, … Read more