Algorithm Interview

In this post, we will see about Topological Sorting in the graph. Topological Sorting is ordering of vertices or nodes such if there is an edge between (u,v) then u should come before v in topological sorting. Topological sort is possible only for Directed Acyclic Graph(DAG). If there is a cycle in graph, then there […]

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 Doubly LinkedList implementation in java. We have already seen the implementation of singly linked list. You can consider this as an extension of Singly linked list.It is quite complex to implement […]

If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see about Sorting algorithms in java. A Sorting algorithm is an algorithm which puts collection of elements in specific order. For example: You want to sort list of numbers into ascending order […]

In this tutorial, we will see how to rotate an array be K positions. Problem: N=6 and k=2 If Arr[] = {1, 2, 3, 4, 5, 6} and k=2 then [rotated array](https://java2blog.com/search-element-in-sorted-and-rotated-array-java/ “rotated array”) will be  {5, 6, 1, 2,  3,  4} Solution: There are multiple ways to solve this problem. Approach 1: Move each […]

If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see how to find smallest and largest element in an array. 1. Introduction to Problem Let’s say we have an array of numbers. [crayon-662f3637a6da7060346691/] Our goal is to find out smallest and […]

If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see about trie data structure in java. What is Trie : Trie is data structure which stores data in such a way that it can be retrieved faster and improve the performance. […]

If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. Problem: From Wikipedia : In computer science, the Largest sum contiguous subarray is the task of finding the contiguous subarray within a one-dimensional array of numbers which has the largest sum. For example, for the sequence of […]

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. Kadane algorithm is a famous algorithm to solve maximum subarray problem. Maximum subArray problem: From Wikipedia : In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers […]

If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview programs. Selection sort is an in place comparison sorting algorithm. It is very simple to implement but it does not go well with large number of inputs. Selection sort algorithm Find the minimum element in the list. […]