Posts

Showing posts with the label hackerearth problem and solution in java

Dutch national flag problem in Javascript

Image
Dutch national flag problem and solution in Javascript Problem statement:   The Dutch national flag (DNF) problem is one of the most popular programming problems proposed by Edsger Dijkstra. The flag of the Netherlands consists of three colors: white, red, and blue. The task is to randomly arrange balls of white, red, and blue such that balls of the same color are placed together. Now, let's consider an array with 3 distinct values say 0, 1 and 2. We won't be using any sort method and we need to sort this array in 0(n). Input Array :  let   arr  = [ 0 ,  2 ,  1 ,  0 ,  1 ,  2 ,  0 ,  2 ]; Expected Output: [ 0, 0, 0, 1, 1, 2, 2, 2 ] Solution Approach : When we see expected output, we can clearly see that sorted array is divided into 3 sections having values 0 , 1 and 2. So, let's divide the array in 3 sections: a) from 0th index to left boundary b) from left boundary to right boundary c) from right boundary to last index. Now we...

Micro and Array Update : Hackerearth Problem and Solution

Micro and Array Update : Problem Micro purchased an array $$A$$ having $$N$$ integer values. After playing it for a while, he got bored of it and decided to update value of its element. In one second he can increase value of each array element by $$1$$. He wants each array element's value to become greater than or equal to $$K$$. Please help Micro to find out the minimum amount of time it will take, for him to do so. Input: First line consists of a single integer, $$T$$, denoting the number of test cases. First line of each test case consists of two space separated integers denoting $$N$$ and $$K$$. Second line of each test case consists of $$N$$ space separated integers denoting the array $$A$$. Output: For each test case, print the minimum time in which all array elements will become greater than or equal to $$K$$. Print a new line after each test case. SAMPLE INPUT 2 3 4 1 2 5 3 2 2 5 5 SAMPLE OUTPUT 3 0 Explanation For first test cas...