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
Adobe
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
Graph – Detect Cycle in a Directed Graph using colors
Objective: Given a directed graph write an algorithm to find out whether graph contains cycle or not. Example: Approach: Graph … Read more
Graph – Detect Cycle in an Undirected Graph using DFS
Objective: Given undirected graph write an algorithm to find out whether graph contains cycle or not. Example: Approach: Earlier we … Read more
Graph – Detect Cycle in a Directed Graph
Objective: Given a directed graph write an algorithm to find out whether graph contains cycle or not. Example: Approach: Graph … Read more
Print all sub sequences of a given array
Objective: Given an array write an algorithm to print all the possible sub subsequences. Example: int [] a = {1, 2, … Read more
Dynamic Programming – Egg Dropping Problem
Objective: There are n number of eggs and building which has k floors. Write an algorithm to find the minimum number … Read more
Nuts & Bolts Problem (Lock & Key problem)
Objective: Given ‘n’ Nuts and ‘n’ Bolts of different sizes. There is one-to-one mapping between nuts and bolts. Write an algorithm … Read more
Stock Single Sell Problem – O(n) Solution
Objective: Given an array represents cost of a stock on each day. You are allowed to buy and sell the stock … Read more
Find the element which appears maximum number of times in the array.
Objective: Given an array of integers, write a algorithm to find the element which appears maximum number of times in … Read more
Find duplicates in an given array in O(n) time and O(1) extra space.
Objective: Given an array of integers, find out duplicates in it. Example: int [] a = {4, 6, 2, 1, … Read more
Find the last non repeating character in a given string.
Objective: Given a string, write an algorithm to find the last non repeating character in it. Example: String input = … Read more
Find the last repeating character in a given string.
Objective: Given a string, write an algorithm to find the last repeating character in it. Example: String input = “horizon … Read more