Hacker Rank - Weekly Challenges - Week 12 

Weekly Challenges are contests hosted by Hackerrank. We are given some set of problems to solve. You can see more about weekly challenges here.

Currently one problem is available to solve for this week.

1. Priyanka and Toys

Following is the solution to the problem.

package hackerRank; import java.util.*; import java.lang.*; import java.io.*; /* Name of the class has to be "Main" only if the class is public. */ class PriyankaAndToys {        public static void main (String[] args) throws java.lang.Exception        {               // your code goes here               Scanner sc = new Scanner(System.in);               int n = sc.nextInt();               int count=1; int c =0;               int[] array = new int[n];               //aray               for(int i=0;i<n;i++)                      array[i] = sc.nextInt();                                    Arrays.sort(array);               if(array.length >1)               {                      //constraint                      c = array[0];                                           for(int i=1;i<n;i++)                      {                            if(array[i]>=c && array[i]<=c+4 )                                   continue;                            else                                   count++;                                   c = array[i];                      }               }               else if(array.length==1)                      count =1;               System.out.println(count);               sc.close();        } }

Algorithms - Warmup - Alternating Characters

Alternating Characters

The following is the solution to Hacker Rank problem Alternating Characters using Java.  For solutions to other Hacker Rank Problem visit my page HackerRank, alternatively try searching for the problem in my blog.

It is a easy problem, one solution is to read all characters one by one and check if both are equal. If both these characters are equal, we keep count of the character. This count will give us the number of characters to be deleted.

Score:30/30

/**  *  */ import java.util.Scanner; /**  * @author Arun.G  *  */ public class Solution{        /**         * @param args         */        public static void main(String[] args) {               // TODO Auto-generated method stub               Scanner sc = new Scanner(System.in);               int T = sc.nextInt();               for (int count = 0; count < T; count++) {                      char[] characters= sc.next().toCharArray();                       int AlterCount=0;                      for(int i=0;i<characters.length-1;i++)                      {                            if(characters[i]==characters[i+1])                            {                                   AlterCount++;                            }                                                 }                      System.out.println(AlterCount);                                    }               sc.close();        } }