• 04 February

### LCA of a K-ary Tree in O(Sqrt(height))

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. 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 K-ary tree and […]

• 03 February

### Largest Rectangular Area in a Histogram

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. 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 of the bars […]

• 02 February

### Longest common Subsequence

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. 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 zero characters is […]

• 30 January

### Kruskal’s Algorithm for finding Minimum Spanning Tree

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. 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 all the vertices […]

• 08 December

### Coin Change Problem in java

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. 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 which, the given […]

• 30 November

### Bellman Ford Algorithm in java

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. 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 also serves the […]

• 20 November

### Serialize and Deserialize n-ary tree

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. 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 the actual tree […]

• 17 November

### Lowest Common Ancestor (LCA) for n-ary Tree

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. 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 ancestor of the […]

• 12 November

### Segment Tree in java

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see about Segment Tree in java. Problem Consider an Array of Integers, int[] arr = {a1, a2, a3, a4, a5,….., an}; Given two types of queries, (i) In the first type of query, […]