Skip to main content

Grid Challenge Hackerrank Solution - java | Hackerrank Algorithm

 Grid Challenge Hackerrank Solution - java 

For Explanation Watch Video ::





Code ::

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;

class Result {

    
    public static String sort(String s){
        char[] ch = s.toCharArray();
        Arrays.sort(ch);
        return new String(ch);
    }
    public static String gridChallenge(List<String> grid) {
        
        ArrayList<String> al = new ArrayList<>();
        for(int i=0;i<grid.size();i++){
            String s = sort(grid.get(i));
            al.add(s);
        }
      
        int size = al.get(0).length();
        for(int i=1;i<al.size();i++){
            for(int j=0;j<size;j++){
                if(al.get(i-1).charAt(j)>al.get(i).charAt(j)){
                    return "NO";
                }
            }
        }
        return "YES";
    }

}

public class Solution {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        int t = Integer.parseInt(bufferedReader.readLine().trim());

        IntStream.range(0, t).forEach(tItr -> {
            try {
                int n = Integer.parseInt(bufferedReader.readLine().trim());

                List<String> grid = IntStream.range(0, n).mapToObj(i -> {
                    try {
                        return bufferedReader.readLine();
                    } catch (IOException ex) {
                        throw new RuntimeException(ex);
                    }
                })
                    .collect(toList());

                String result = Result.gridChallenge(grid);

                bufferedWriter.write(result);
                bufferedWriter.newLine();
            } catch (IOException ex) {
                throw new RuntimeException(ex);
            }
        });

        bufferedReader.close();
        bufferedWriter.close();
    }
}

Comments

Popular posts from this blog

Servlet Project Book Shop Application in eclipse

 Servlet Project Book Shop Application in eclipse  For explanation watch video::: Note :: In this Project you must configure web server (for example tomcat) with eclipse ide Download Bootstrap  from ::         https://getbootstrap.com/docs/4.3/getting-started/download/ Download mysql jar file from :: https://mvnrepository.com/artifact/mysql/mysql-connector-java/8.0.22 adding MySQL Connector/J jar file in eclipse ide for jdbc video :: video link : https://youtu.be/4Fyd-k3eG_I Directory Structure:: web.xml <?xml version="1.0" encoding="UTF-8"?> <web-app xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://xmlns.jcp.org/xml/ns/javaee" xsi:schemaLocation="http://xmlns.jcp.org/xml/ns/javaee http://xmlns.jcp.org/xml/ns/javaee/web-app_4_0.xsd" id="WebApp_ID" version="4.0">   <welcome-file-list>     <welcome-file>home.html</welcome-file>   </welcome-file-list>   <display-...

Java Regex Hackerrank Solution

 Java Regex Hackerrank Solution For Explanation Watch Video: Sample Input 000.12.12.034 121.234.12.12 23.45.12.56 00.12.123.123123.123 122.23 Hello.IP Sample Output true true true false false false Code: import  java.util.regex.Matcher; import  java.util.regex.Pattern; import  java.util.Scanner; class  Solution{      public   static   void  main(String[] args){         Scanner in =  new  Scanner(System.in);          while (in.hasNext()){             String IP = in.next();             System.out.println(IP.matches( new  MyRegex().pattern));         }     } } //Write your code here class MyRegex{   ...

Java Hashset Hackerrank Solution

 Java Hashset Hackerrank Solution For Explanation Watch Video: Sample Input 5 john tom john mary john tom mary anna mary anna Sample Output 1 2 2 3 3 Code: import  java.io.*; import  java.util.*; import  java.text.*; import  java.math.*; import  java.util.regex.*; public   class  Solution {   public   static   void  main(String[] args) {         Scanner s =  new  Scanner(System.in);          int  t = s.nextInt();         String [] pair_left =  new  String[t];         String [] pair_right =  new  String[t];                   for  ( int  i =  0 ; i < t; ...