• 30 November

    Bellman Ford Algorithm in java

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

  • 20 November

    Serialize and Deserialize n-ary tree

    If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. 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 […]

  • 17 November

    Lowest Common Ancestor (LCA) for n-ary Tree

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

  • 12 November

    Segment Tree in java

    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, given two integers, L & R, Output the sum of the elements in the given range. (ii) […]

  • 01 November

    Find the local minima in 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 the local minima in the array. Problem An element is local minima if it is less than its neighbors. int [] arr = {10, 5, 3, […]

  • 31 October

    Edit Distance Problem

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

  • 22 October

    Sliding Window Maximum in java

    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 : Input : int[] arr = {2,6,-1,2,4,1,-6,5} int k = 3 output : 6,6,4,4,4,5 for every subarray of […]

  • 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 100+ data structure and algorithm programs. 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 […]

  • 20 October

    Find subarrays with given sum in an 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 subarrays with given sum in an array. Problem Given an Array of non negative Integers and a number. You need to print all the starting and […]