# Author: Ayush Kumar

- 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, […]

- 31 October
### Edit Distance Problem

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see edit distance problem in java. Sometimes this problem also referred as "String distance replacement in java" Problem Given two strings string1 and string2, String1 is to be converted into String2 with the […]

- 22 October
### Sliding Window Maximum 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 Sliding Window Maximum in java Problem Given an Array of integers and an Integer k, Find the maximum element of from all the contiguous subarrays of size K. For eg : […]

- 20 October
### Count number of occurrences (or frequency) of each element in a sorted array

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to count number of occurrences (or frequency) of each element in a sorted array Problem Given a Sorted Array of integers containing duplicates. Find the frequency of every unique element present […]