Number of Islands
Objective: Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is … Read more
Minimum No of operations required to convert a given number to 1 – Integer Replacement Problem.
Objective: Given a number N, write an algorithm to convert that number to 1. Below are the allowed operations. If … Read more
Determine the order of Tests when tests have dependencies on each other
Objective: You are working on a project where QA team has automated set of test cases for the project, but … Read more
Reverse a Stack using recursion – In Place (Without using extra memory)
Objective: Given a Stack, write an algorithm to reverse the stack. Example: Original Stack: [14, 9, 67, 91, 101, 25] … Read more
Convert Prefix to Postfix Expression
Objective: Given a Prefix expression, write an algorithm to convert it into Postfix expression. Example: Input: Prefix expression: + A … Read more
Sort a given stack – Using Temporary Stack
Objective: Given a stack of integers, write an algorithm to sort the stack using a temporary stack. Example: Given Stack: … Read more
Convert Postfix to Prefix Expression
Objective: Given a Postfix expression, write an algorithm to convert it into prefix expression. Example: Input: Postfix expression: A B … Read more
Convert Integer to Roman
Objective: Given an Integer, write a program to convert it to Roman number. This problem can be stated as “Convert … Read more
Convert Postfix to Infix Expression
Objective: Given a Postfix expression, write an algorithm to convert it into Infix expression. Example: Input: Postfix expression: A B … Read more
Longest substring with at most two unique characters
Objective: Given a string, write an algorithm to find the longest substring with at most two characters. Example: Input: aabbccddc … Read more
Convert Prefix to Infix Expression
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
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
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
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
Infix notation is commonly used in arithmetic formula or statements, the operators are written in-between their operands. Let’s assume the … Read more