# Algorithm Interview

- 18 April
### Minimum Number of Jumps to reach last Index

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 find Minimum Number of Jumps to reach last Index. Problem Given an array A of positive integers possibly zeroes, every index indicating the maximum length of a jump that can […]

- 20 February
### Inorder Successor in a Binary Search 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 how to find Inorder Successor in a Binary Search Tree. Problem Given a Binary Search Tree and a target node value. Find the Inorder successor of the given node value in the […]

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

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

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

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

- 14 October
### Find peak element in the array

If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see how to find peak element in the array. Problem Given an array of integers. find the peak element in the array. Peak Element is the element of the array […]

- 27 September
### Print maximum occurring character in a String

In this post, we will see how to print the maximum occurring character in a String. Problem Print maximum occurring character in a String For example: String 1: java2blog tutorial Character: a has occurred maximum times in String: 3 ———————- String 2: This is test message Character: s has occurred maximum times in String: 5 […]

- 1
- 2
- 3
- …
- 11
- Nextkeyboard_arrow_right