Find the number of distinct Islands OR connected components.
Objective: Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of distinct or unique islands. … Read more
Oracle
Check if Graph is Bipartite – Adjacency List using Depth-First Search(DFS)
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
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
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
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
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
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
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
Merge K sorted Linked List – Using Priority Queue
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
Objective: Given a string containing just the characters ( , ) determine if the input string is valid. Example: ()()(()(()))() valid: true … Read more
Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)
Objective: Given a graph, check if the graph contains a cycle using disjoint set. Note: Disjoint-set data structure, also called … Read more