Posts

Showing posts with the label hackerrank -10 Days of Javascript

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...

HackerRank Problem: "Sherlock and Squares" in Javascript

   HackerRank  Problem and solution in Javascript     Objective:   In this challenge, we will solve the “ Sherlock and Squares ”    HackerRank   puzzle using  javascript .   Problem statement:   Watson likes to challenge Sherlock's math ability. He will provide a starting and ending value describing a range of integers. Sherlock must determine the number of  square integers  within that range, inclusive of the endpoints. Note : A square integer is an integer which is the square of an integer, e.g.  . For example, the range is   and  , inclusive. There are three square integers in the range:   and  . Function Description: Complete the squares function in the editor below. It should return an integer representing the number of square integers in the inclusive range from  to . squares has the following parameter(s): a: an integer, the lower range boundary b: an integer, the uppere ...

Day 4: Count Objects (Hackerrank 10 days of Javascript) Problem and solution

  Objective:: In this challenge, we learn about iterating over objects. Task:: Complete the function in the editor. It has one parameter: an array, a  , of objects. Each object in the array has two integer properties denoted by  x and  y . The function must return a count of all such objects  o  in array a   that satisfy  o.x==o.y . Input Format:: The first line contains an integer denoting  n . Each of the  n  subsequent lines contains two space-separated integers describing the values of  x and  y . Constraints:: ·        5 <= n <= 10 ·        1 <=x, y<=100 Output Format Return a count of the total number of objects  o  such that o.x==o.y . Locked stub code in the editor prints the returned value to STDOUT. Sample Input 0 5 1 1 2 3 3 3 3 4 4 5 Sample Output 0 2 Explanation 0 There are...