• 12 October

    Quick Sort in java

    If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions. Quick sort or partition-exchange sort, is a sorting algorithm, which is using divide and conquer algorithm. In quick sort, we first choose a pivot and divide into two sublists,one will contain elements lower than pivot and […]

  • 12 October

    Counting Sort in java

    Counting sort is special sorting technique used to sort elements between specific range. Lets say elements belong to range 1 to K , then Counting sort can be used to sort elements in O(N) times. Basic idea of counting sort to find number of elements less than X, so X can be put to its […]

  • 12 October

    Heap sort in java

    In this post, we will see how to implement heap sort in java. I will divide heap sort in multiple parts to make it more understandable. What is heap? A heap is a tree with some special properties, so value of node should be greater than or equal to(less than or equal to in case […]

  • 10 October

    Convert sorted Linked List to balanced BST

    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 convert sorted LinkedList to balanced binary search tree. There are two ways to do it. Solution 1: It is very much similar to convert sorted array to BST. […]

  • 10 October

    Convert sorted array to balanced binary search tree

    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 convert sorted array to balanced binary search tree. Algorithm: You might know that inorder traversal of binary search tree results in sorted array. We will use this property […]

  • 06 October

    Find the Contiguous Subarray with Sum to a Given Value in an array

    Problem : Given an array of positive integer and given value X, find Contiguous sub array whose sum is equal to X. For example: [crayon-68193b93f3147292430279/] Solution: Solution 1: Check all sub arrays and if current sum is equal to X, return. This will require two loops and if currentSum is greater than X tben try […]

  • 06 October

    Separate 0s and 1s in an array

    Problem : Given an array of 0’s and 1’s in random order , you need to separate 0’s and 1’s in an array. For example: [crayon-68193b93f3286282918593/] Solution : Solution 1: Count number of 0’s in the array. Lets say we get X 0’s Once we get the count, put X 0’s in the array and […]

  • 06 October

    find minimum element in a sorted and rotated array

    If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions. In this post, we will see how to find minimum element in sorted and rotated array. Problem: You are given an sorted and rotated array as below: [crayon-68193b93f3478775553671/] If you note that array is sorted and […]

  • 06 October

    Maximum difference between two elements such that larger element appears after the smaller number

    If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. Given array of integers, find Maximum difference between two elements such that larger element appears after the smaller number For example: [crayon-68193b93f35b4921418521/] Algorithm: Lets say we have array arr[] of stock prices. We will track two variable :minElementTillNow and maxDifference. minElementTillNow will be […]