#
Algorithm Interview Archive

In this post, we will see about how to find Lowest Common Ancestor of a K-ary Tree in O(Sqrt(height)).We have already seen how to find LCA of n-ary tree in O(n) complexity. Problem Given a …

In this post, we will see about how to find largest rectangular area in a Histogram. Problem Given an Integer representing number of bars in a Histogram and an array of integers representing the height …

Given two Strings A and B. Find the length of the Longest Common Subsequence (LCS) of the given Strings. Subsequence can contain any number of characters of a string including zero or all (subsequence containing …

Kruskal’s Algorithm solves the problem of finding a Minimum Spanning Tree(MST) of any given connected and undirected graph. What is a Minimum Spanning Tree? It is basically a subgraph of the given graph that connects …

In this post, we will see about Coin Change problem in java. Problem Given an Amount to be paid and the currencies to pay with. There is infinite supply of every currency using combination of …

In this post, we will see about Bellman ford algorithm in java. Bellman Ford Algorithm is used to find shortest Distance of all Vertices from a given source vertex in a Directed Graph. Dijkstra Algorithm …

Problem Given a Generic Tree, Serialize and Deserialize it. Serialization is a basically a representation of a tree in a String format which takes much lesser space than storing the tree itself. Deserialization is constructing …

In this post, we will see about Lowest Common Ancestor for n-ary Tree. Problem Given a n-ary tree also known as a Generic Tree and also two nodes. You need to find the Lowest common …

In this post, we will see how to find the local minima in the array. Problem An element is local minima if it is less than its neighbors. Solution Naive approach You can use …

In this post, we will see edit distance problem in java Problem Given two strings string1 and string2, String1 is to be converted into String2 with the given operations available in the minimum number of …