Online Judge Solution

URI Online Judge Solution 1252 - Data Structure | 1252 - Sort sort and sort

2019-05-11T15:31:00.001-07:00

URI Online Judge Solution Data Structure | 1252 - Sort sort and sort

URI Online Judge Solution SQL | 1252 Sort sort and sort | Beginner

URI Problem Link - URI Data Structure | 1252 Sort sort and sort Link

Problem Name: Data Structure | Sort sort and sort

Problem Number : URI - Data Structure | 1252 Sort sort and sort

Online Judge : URI Online Judge Solution

Category: Data Structure

Solution Language : Data Structure

URI Online Judge Solution 1252 - Data Structure | 1252 - Sort sort and sort: Using C++


#include<bits/stdc++.h>
using namespace std;
int m;
bool comp (int a, int b){
    if (b%m == a%m)
        if(abs(a)%2 ==abs(b)%2){
            if (a%2 != 0){
                return a > b;
            }else{ 
                return b > a;
            }
        }
        return abs(a)%2 > abs(b)%2; 
    }
    return a%m < b%m;
}
int main()
{
    int n;
 
    while(cin>>n>>m&&n&&m){
    int a[n];
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    sort(a,a+n,comp);
    cout<<n<<" "<<m<<endl;
    for(int i=0;i<n;i++)
        cout<<a[i]<<endl;
    }
    printf("0 0n");
}

URI Online Judge Solution 1252 - Data Structure | 1252 - Sort sort and sort: Using C Language


#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

int M;


bool comp (int a, int b){
    if (b%M == a%M){ /// retorna primeiro os impares e depois os pares;
        if(abs(a)%2 ==abs(b)%2){ ///comparando dois pares ou dois impares
            if (a%2 != 0){ ///impares
                return a > b;
            }else{ ///a e b s?o pares
                return b > a;
            }
        }
        return abs(a)%2 > abs(b)%2; /// impares antes dos pares
    }
    return a%M < b%M;
}

int main()
{
	int N, cont;

	scanf("%d", &N);
	scanf("%d", &M);

	while(N!=0 && M!=0)
	{
		int vetor[N];
		printf("%d %d\n", N, M);

		for(cont=0;cont<N;cont++){
			scanf("%d", &vetor[cont]);
		}

		sort(vetor,vetor+N,comp);

		for(cont=0;cont<N;cont++){
			printf("%d\n", vetor[cont]);
		}

		scanf("%d", &N);
		scanf("%d", &M);

	}
	printf("0 0\n");

	return 0;
}

Demonstration:

Tags: URI Online Judge Solution, URI OJ Solution list, URI Problems Solution, URI solver, URI all problem solution list, URI SQL |URI Online Judge Solution 1252 - Data Structure | 1252 - Sort sort and sort, URI 1252 URI Online Judge Solution 1252 - Data Structure | 1252 - Sort sort and sort

URI Online Judge Solution SQL | 2609 Products by Categories - Solution in PostgreSQL

2019-04-05T12:43:00.004-07:00

URI Online Judge Solution SQL | 2609 Products by Categories - Solution in PostgreSQL

URI Online Judge Solution SQL | 2609 Products by Categories | Beginner

URI Problem Link - URI SQL | 2609 Products by Categories Link

Problem Name: SQL | 2609 Products by Categories

Problem Number : URI - SQL | 2609 Products by Categories

Online Judge : URI Online Judge Solution

Category: SQL

Solution Language : SQL, postgreSQL. mySQL

URI Solution SQL | 2609 Products by Categories Code in SQL, PostgreSQL, MySQL:


select categories.name, sum(products.amount) 
from products, categories 
where products.id_categories = categories.id 
group by categories.name;

Tags: URI Online Judge Solution, URI OJ Solution list, URI Problems Solution, URI solver, URI all problem solution list, URI SQL | 2608 Higher and Lower Price, URI 2609 Products by Categories SQL Solution, URI Solution - SQL, URI Online Judge Solution, , URI Higher and Lower price solution, URI 2609 Products by Categories solution

‘Do My Assignment for Me’ Orders: All Kinds of Difficult Projects Done with Ease

2018-06-24T11:41:00.000-07:00

‘Do My Assignment for Me’ Orders: All Kinds of Difficult Projects Done with Ease

Students dealing with their programming degree program usually get stuck in the process, as accomplishing the assignments like research papers on JAVA, reports on Python or app development, or any programming issues is a challenging task for them. Most of the discipline homework projects are time-consuming and quite frustrating. Thus, it makes hard for the college and university students to get the assignments done within the set date and they search for a professional programming projects writing services. You don’t need to make it a terrible educational experience, so be sure to approach one of the custom writing websites available online with a quick message like ‘Could you please do my assignment?’ AssignCode.com is one of the sites, where professional programming solutions are provided. Perfection in every ‘Please, make my assignment shine!’ order is what the company guarantees for a fair price.

The company has a huge team of experts of the computer science ready to provide educational help and assignment writing guidance. The people working for AssignCode.com will address any high school, college or university problem which you may be facing performing a specific task.

Make My Assignment: Different Programming Languages Covered!

When your college project has something to do with the programming languages, you may find it too hard to work on one since there are more than 800 of them! But for the companies like AssignCode.com impossible is nothing. You place the ‘Make my assignment for me, please’ order and make sure all the requirements are being provided. The company assigns your project with the best writer, who has the relevant experience with the programming languages and is free at the moment.

The various fields, or programming languages, in which the company renders programming assistance services are: Python, Ruby, C++, PHP, C#, JavaScript, SQL, etc. The team of IT specialists work hand-in-hand to provide you with the top quality answers for the most difficult projects on the languages mentioned above and many more. Their knowledge, efforts and experience lead to a supreme quality assignments that is written professionally from both aspects – practical and theoretical.

AssignCode.com: Why Do You Need Help with Programming Tasks?

The company’s years of experience in communication with college students taking a programming course suggest that nearly every student has to handle certain problems while working on the various projects. Among the reasons that make professional help from someone at AssignCode.com necessary are the ones mentioned below:

Difficulty. As mentioned earlier, programming is one of the areas students need a dedicated helper in. Being a real expert at it requires dozens of time, determination and focus. In order to grasp the subject as good as possible, it should find a competent academic problem solver from the website like AssignCode.com.
Demanding discipline. Taking into account the fact that the subject is quite vast and demanding, it’s no wonder college students search for the cheap writing services to approach with their ‘Do you have skilled writers, who can write my programming paper for me?’ message. Typically, students have more than 2-3 tasks to solve at a time, which is why working with AssignCode.com is always a good idea.
Lack of time. One of the reasons why you approach custom writing companies to buy a project from lies in the fact that you don’t have enough time to memorize all the codes and programing languages. AssignCode.com company offers pocket-friendly options for money to help you deal with the time-consuming projects.
Supervision. Here’s one of the major reasons why you’ll be there next time you’re assigned with the programming assignment – the lack of supervision. If you don’t know how to cope with the MBA programming assignment, please, feel free to approach AssignCode.com for some guidance.

If you don’t compose the programming assignments properly and within the required deadline, look for professional help from a reliable source. AssignCode.com won’t let you slip on your grades, that’s for sure.

URI Online Judge Solution SQL | 2608 Higher and Lower Price - Solution in PostgreSQL

2018-04-08T13:13:00.002-07:00

URI Online Judge Solution SQL | 2608 Higher and Lower Price - Solution in PostgreSQL

URI Online Judge Solution SQL | 2608 Higher and Lower Price | Beginner
URI Problem Link - URI SQL | 2608 Higher and Lower Price Link

Problem Name: SQL | 2608 Higher and Lower Price
Problem Number : URI - SQL | 2608 Higher and Lower Price
Online Judge : URI Online Judge Solution
Category: SQL
Solution Language : SQL, postgreSQL. mySQL

URI Solution SQL | 2608 Higher and Lower Price Code in SQL, PostgreSQL, MySQL:

SELECT max(price) as price, min(price) as price
FROM products

Demonstration:
Just use the max() and min() function of mySQL. max(atribute_name) returns the max value of that column from the table.
In this line-

SELECT max(price) as price, min(price) as price

Tags: URI Online Judge Solution, URI OJ Solution list, URI Problems Solution, URI solver, URI all problem solution list, URI SQL | 2608 Higher and Lower Price, URI 2608 SQL Solution, URI Solution - SQL, URI Online Judge Solution, , URI Higher and Lower price solution, URI 2608 solution

URI Online Judge Solution SQL | 2605 Executive Representatives - Solution in PostGreSQL

2018-04-08T12:37:00.001-07:00

URI Online Judge Solution SQL | 2605 Executive Representatives - Solution in PostGreSQL

URI Online Judge Solution 2605 Executive Representatives | SQL
URI Problem Link - URI 2605 Executive Representatives Link

Problem Name: URI 2605 Executive Representatives
Problem Number : URI - 2605 Executive Representatives
Online Judge : URI Online Judge Solution
Category: SQL
Solution Language : SQL, PostgreSQL

URI Solution 2605 Executive Representatives Code in PostgreSQL:

SELECT products.name, providers.name
FROM products, providers
WHERE products.id_categories = 6 and products.id_providers = providers.id;

Demonstration:

In this URI 2605 problem,
We've to find the name of the products and name of the providers.
So first line,

SELECT products.name, providers.name

Then From which table(products, providers) needs to calculate/joining

FROM products, providers

Finally the actual condition: The matching condition whose id_categories = 6 and the provider id also, So the SQL Query for that condition-

WHERE products.id_categories = 6 and products.id_providers = providers.id;

[Having any problem since, just comment here and I'll try to help to solve all URI online judge problems at most.]

Tags: URI Online Judge Solution, URI OJ Solution list, URI Problems Solution, URI solver, URI all problem solution list, URI 2605 Executive Representatives Code in mysql, URI 2605 Executive Representatives solution in sql, URI 2605 solution, URI 2605 code example, URI Online judge 2605 Code solution, URI 2605 solution, URI Solution,

URI Online Judge Solution SQL | 2606 Categories - PostGreSQL Solution - Code

2018-04-08T09:28:00.002-07:00

URI Online Judge Solution SQL | 2606 Categories - PostGreSQL Solution - Code

URI Online Judge Solution SQL | 2606 Categories | SQL
URI Problem Link - link

Problem Name: SQL | 2606 Categories
Problem Number : URI - SQL | 2606 Categories
Online Judge : URI Online Judge Solution
Category: SQL
Solution Language : PostGreSQL

URI Solution SQL | 2606 Categories Code in PostGreSQL:

SELECT products.id, products.name
FROM products
JOIN categories
ON products.id_categories = categories.id
WHERE categories.name like 'super%'

Demonstration:

This is query with join the two table using SQL, WHERE query, and finally like query.

JOIN for joining two table
WHERE for giving condition
LIKE for searching.

Links for learning to solve this problem:

Tags: URI Online Judge Solution, URI OJ Solution list, URI Problems Solution, URI solver, URI all problem solution list, URI Online Judge Solution SQL | 2606 Categories - PostGreSQL Solution - Code, URI 2606 solution, URI 2606 Categories, 2606 Categories Solution URI online judge, URI 2606 Categories code, 2606 Categories in PostgreSQL URI online judge

URI Online Judge Solution SQL | 2607 Providers' City in Alphabetical Order - PostgreSQL Solution

2018-04-07T13:02:00.003-07:00

URI Online Judge | SQL | 2607 Providers' City in Alphabetical Order - Solution in PostgreSQL

URI Online Judge Solution 2607 Providers' City in Alphabetical Order | SQL
URI Problem Link - link

Problem Name: 2607 Providers' City in Alphabetical Order
Problem Number : URI - 2607 Providers' City in Alphabetical Order
Online Judge : URI Online Judge Solution
Category: SQL
Solution Language : PostGreSQL

URI Solution 2607 Providers' City in Alphabetical Order Code in PostgreSQL:

SELECT DISTINCT city FROM providers ORDER BY city ASC

URI Solution Code / URI solution in PostGreSQL:

SELECT DISTINCT city FROM providers ORDER BY city ASC

URI Solution Code / URI solution in SQL:

SELECT DISTINCT city FROM providers ORDER BY city ASC

URI Solution Code / URI solution in Python:

URI Solution Code / URI solution in C# (C Sharp):

Demonstration:

Just implement this in coding. Since having any problem just put a comment below. Thanks

Tags: URI Online Judge Solution, URI OJ Solution list, URI Problems Solution, URI solver, URI all problem solution list, URI 2607 Providers' City in Alphabetical Order code in C, URI 2607 Providers' City in Alphabetical Order Weighted Averages code in C++, URI Area of a circle solution in C, URI solution, URI 2607Weighted Averages solution in C,URI 2607 Providers' Cvity in Alphabetical Order Weighted Averages solution in C++-CPP,URI https://www.urionlinejudge.com.br/judge/en/problems/view/2607 Weighted Averages solution in C# (C sharp),URI 2607 Providers' City in Alphabetical Order Weighted Averages solution in Java,URI 1079 Weighted Averages solution in Python,

URI Online Judge Solution 1030 Flavious Josephus Legend - Solution in C, C++, Java, Python and C#

2017-12-21T11:30:00.000-08:00

URI Online Judge Solution 1030 Flavious Josephus Legend - Solution in C, C++, Java, Python and C#

URI Online Judge Solution 1030 Flavious Josephus Legend | Beginner
URI Problem Link - link

Problem Name: 1030 Flavious Josephus Legend
Problem Number : URI - 1030 Flavious Josephus Legend
Online Judge : URI Online Judge Solution
Category: Beginner
Solution Language : C,C plus plus, java, python, c#(c sharp)

URI Solution 1030 Flavious Josephus Legend Code in C:

#include <stdio.h>
int josephusLoop(int n, int k, int startingPoint)
{
 if(n == 1)
  return 1;

 int newSp, survivor;
 newSp = (startingPoint + k - 2) % n + 1;
  survivor = josephusLoop(n - 1, k, newSp);

  if(survivor < newSp){
   return survivor;
  }else{
   return survivor + 1;
  }
}

int josephus(int n, int k)
{
 return josephusLoop(n, k, 1);
}

int main()
{
 int nc, n, k, s, i;
 scanf("%i", &nc);

 for (i = 1; i <= nc; ++i)
 {
  scanf("%i %i", &n, &k);
  s = josephus(n, k);
  printf("Case %i: %i\n", i, s);
 }

 return 0;
}

URI Solution 1030 Flavious Josephus Legend Code / URI 1030 solution in CPP:

#include <cstdio>
using namespace std;

int josephusLoop(int n, int k, int startingPoint)
{
 if(n == 1)
  return 1;

 int newSp, survivor;
 newSp = (startingPoint + k - 2) % n + 1;
  survivor = josephusLoop(n - 1, k, newSp);
  
  if(survivor < newSp){
   return survivor;
  }else{
   return survivor + 1;
  }
}

int josephus(int n, int k)
{
 return josephusLoop(n, k, 1);
}

int main()
{
 int nc, n, k, s;
 scanf("%i", &nc);

 for (int i = 1; i <= nc; ++i)
 {
  scanf("%i %i", &n, &k);
  s = josephus(n, k);
  printf("Case %i: %i\n", i, s);
 }

 return 0;
}

URI Solution 1030 Flavious Josephus Legend Code / URI 1030 solution in Java:

import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Main {

    static FastScanner in = new FastScanner(System.in);
    static PrintWriter out = new PrintWriter(System.out);

    public static void main(String[] args) throws IOException {

        int NC = in.nextInt(), n, k;
        for (int i = 1; i <= NC; i++) {
            n = in.nextInt();
            k = in.nextInt();
            out.println("Case " + i + ": " + (josephus(n, k) + 1));
        }
        in.close();
        out.close();
    }

    private static int josephus(int n, int k) {
        // Runtime error :/
        /* if (n == 1) {
            return 0;
        }
        return (josephus(n - 1, m) + m) % n; */
        int ans = 0;
        for (int i = 2; i <= n; i++) {
            ans = (ans + k) % i;
        }

        return ans;
    }

    static class FastScanner implements Closeable {

        private final BufferedReader reader;
        private StringTokenizer tokenizer;

        public FastScanner(InputStream input) {
            reader = new BufferedReader(
                    new InputStreamReader(input));
            tokenizer = new StringTokenizer("");
        }

        public String next() throws IOException {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                String line = reader.readLine();
                if (line == null) {
                    return null;
                }
                tokenizer = new StringTokenizer(line);
            }
            return tokenizer.nextToken();
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        public float nextFloat() throws IOException {
            return Float.parseFloat(next());
        }

        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        @Override
        public void close() throws IOException {
            tokenizer = null;
            reader.close();
        }
    }
}

URI Solution 1030 Flavious Josephus Legend Code / URI solution in Python:

URI Solution Code / URI solution in C# (C Sharp):

Demonstration:

Just implement this in coding. Since having any problem just put a comment below. Thanks

Tags: URI Online Judge Solution, URI OJ Solution list, URI Problems Solution, URI solver, URI all problem solution list,URI Online Judge Solution, URI Solution - Ad Hoc, URI 1030 Flavious Josephus Legend, URI Online Judge Solution 1030 Flavious Josephus Legend - Solution in C, C++, Java, Python and C#

URI Online Judge SQL Solution 2604 Under 10 or Greater Than 100 - Solution in PostgreSQL

2017-12-21T11:05:00.000-08:00

URI Online Judge SQL Solution 2604 Under 10 or Greater Than 100 - Solution in PostgreSQL

URI Online Judge Solution 2604 Under 10 or Greater Than 100 | SQL
URI Problem Link - link

Problem Name: 2604 Under 10 or Greater Than 100
Problem Number : URI 2604 Under 10 or Greater Than 100
Online Judge : URI Online Judge Solution
Category: SQL
Solution Language : PostgreSQL

URI Solution 2604 Under 10 or Greater Than 100 Code in PostgreSQL:

SELECT products.id, products.name FROM products WHERE products.price < 10 or products.price > 100;

Demonstration:

Basic Select query with a where clause SQL

Tags: URI Online Judge Solution, URI OJ Solution list, URI Problems Solution, URI solver, URI Online Judge SQL Solution URI Online Judge SQL Solution2604 Under 10 or Greater Than 100 - Solution in PostgreSQL - Solution in PostgreSQL, URI SQL Solution, URI SQL Solution, URI 2604 solution, URI PostgreSQL Code solution

URI Online Judge SQL Solution 2603 Customer Address - Solution in PostgreSQL

2017-12-21T10:58:00.001-08:00

URI Online Judge SQL Solution 2603 Customer Address - Solution in PostgreSQL

URI Online Judge Solution 2603 Customer Address | SQL
URI Problem Link - link

Problem Name:2603 Customer Address
Problem Number : URI 2603 Customer Address
Online Judge : URI Online Judge Solution
Category: SQL
Solution Language : PostgreSQL

URI Solution 2603 Customer Address Code in PostgreSQL:

SELECT customers.name, customers.street FROM customers WHERE customers.city = 'Porto Alegre';

Demonstration:

Basic Select query with a where clause SQL

Tags: URI Online Judge Solution, URI OJ Solution list, URI Problems Solution, URI solver, URI Online Judge SQL Solution URI Online Judge SQL Solution 2603 Customer Address - Solution in PostgreSQL - Solution in PostgreSQL, URI SQL Solution, URI SQL Solution, URI 2603 solution, URI PostgreSQL Code solution

URI Online Judge SQL Solution 2602 Basic Select - Solution in PostgreSQL

2017-12-21T10:52:00.001-08:00

URI Online Judge SQL Solution 2602 Basic Select - Solution in PostgreSQL

URI Online Judge Solution 2602 Basic Select | SQL
URI Problem Link - link

Problem Name: 2602 Basic Select
Problem Number : URI 2602 Basic Select
Online Judge : URI Online Judge Solution
Category: SQL
Solution Language : PostgreSQL

URI Solution 2602 Basic Select Code in PostgreSQL:

SELECT customers.name FROM customers WHERE customers.state = 'RS';

HackerRank BattleShip Code Solution

2017-12-12T20:28:00.000-08:00

HackerRank BattleShip Code Solution

Problem Name - BattleShip
Problem Link - BattleShip
Level - Artificial Intelligence

Java Code

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Random;
import java.util.Scanner;

public class Battleship {
 public static void main(String[] args) {
  Scanner scn = new Scanner(System.in);
  String out = scn.nextLine();

  if (out.equals("INIT")) {
   System.out.println("3 0");
   System.out.println("9 9");
   System.out.println("6 4:6 5");
   System.out.println("3 7:4 7");
   System.out.println("7 7:7 9");
   System.out.println("1 5:1 8");
   System.out.println("3 2:7 2");
  } else {
   String[] board = new String[10];
   @SuppressWarnings("unused")
   boolean printed = false;

   for (int i = 0; i < 10; i++) {
    board[i] = scn.nextLine();
   }

   File fileName = new File("myfile.txt");

   if (!fileName.exists()) {
    try {
     fileName.createNewFile();
     FileWriter fileWrite = new FileWriter(fileName);
     BufferedWriter bufferedWriter = new BufferedWriter(
       fileWrite);
     ArrayList<Integer> moves = getRandom(board);
     int x = moves.get(0);
     int y = moves.get(1);
     bufferedWriter.write(x + " " + y);
     bufferedWriter.close();
     System.out.println(x + " " + y);
    } catch (IOException e) {
    }
   } else {
    try {
     byte[] buffer = new byte[100];
     FileInputStream inputStream = new FileInputStream(fileName);
     @SuppressWarnings("unused")
     int readLines = -1;
     String last_move = "";

     while ((readLines = inputStream.read(buffer)) != -1) {
      last_move = new String(buffer);
     }

     inputStream.close();
     int x = Character.getNumericValue(last_move.charAt(0));
     int y = Character.getNumericValue(last_move.charAt(2));

     if (board[x].charAt(y) == 'h') {
      if (x + 1 < 10 && board[x + 1].charAt(y) == 'h') {
       for (int i = 1; i < 9 - x; i++) {
        if (x - i >= 0 && board[x - i].charAt(y) == '-') {
         x -= i;
         break;
        } else if (x - i >= 0
          && board[x - i].charAt(y) == 'm') {
         break;
        }
       }

       for (int i = 1; i < 9 - x; i++) {
        if (x + i < 10 && board[x + i].charAt(y) == '-') {
         x += i;
         break;
        } else if (x + i < 10
          && board[x + i].charAt(y) == 'm') {
         break;
        }
       }
      } else if (x - 1 >= 0 && board[x - 1].charAt(y) == 'h') {
       for (int i = 1; i < 9 - x; i++) {
        if (x - i >= 0 && board[x - i].charAt(y) == '-') {
         x -= i;
         break;
        } else if (x - i >= 0
          && board[x - i].charAt(y) == 'm') {
         break;
        }
       }

       for (int i = 1; i < 9 - x; i++) {
        if (x + i < 10 && board[x + i].charAt(y) == '-') {
         x += i;
         break;
        } else if (x + i < 10
          && board[x + i].charAt(y) == 'm') {
         break;
        }
       }
      } else if (y + 1 < 10 && board[x].charAt(y + 1) == 'h') {
       for (int i = 1; i < 9 - y; i++) {
        if (y - i >= 0 && board[x].charAt(y - i) == '-') {
         y -= i;
         break;
        } else if (y - i >= 0
          && board[x].charAt(y - i) == 'm') {
         break;
        }
       }

       for (int i = 1; i < 9 - y; i++) {
        if (y + i < 10 && board[x].charAt(y + i) == '-') {
         y += i;
         break;
        } else if (y + i < 10
          && board[x].charAt(y + i) == 'm') {
         break;
        }
       }
      } else if (y - 1 >= 0 && board[x].charAt(y - 1) == 'h') {
       for (int i = 1; i < 9 - y; i++) {
        if (y - i >= 0 && board[x].charAt(y - i) == '-') {
         y -= i;
         break;
        } else if (y - i >= 0
          && board[x].charAt(y - i) == 'm') {
         break;
        }
       }

       for (int i = 1; i < 9 - y; i++) {
        if (y + i < 10 && board[x].charAt(y + i) == '-') {
         y += i;
         break;
        } else if (y + i < 10
          && board[x].charAt(y + i) == 'm') {
         break;
        }
       }
      } else {
       ArrayList<Integer> moves = getRemainingHit(board);
       x = moves.get(0);
       y = moves.get(1);
      }
     } else {
      ArrayList<Integer> moves = getRemainingHit(board);
      x = moves.get(0);
      y = moves.get(1);
     }

     while (board[x].charAt(y) != '-') {
      ArrayList<Integer> moves = getRandom(board);
      x = moves.get(0);
      y = moves.get(1);
     }

     fileName.createNewFile();
     FileWriter fileWrite = new FileWriter(fileName);
     BufferedWriter bufferedWriter = new BufferedWriter(
       fileWrite);
     bufferedWriter.write(x + " " + y);
     bufferedWriter.close();
     System.out.println(x + " " + y);
    } catch (IOException e) {
    }
   }
  }
 }

 private static ArrayList<Integer> getRemainingHit(String[] board) {
  ArrayList<Integer> to_return = new ArrayList<Integer>();
  boolean added = false;

  for (int x = 0; x < 10; x++) {
   for (int y = 0; y < 10; y++) {
    if (board[x].charAt(y) == 'h') {
     if (x - 1 >= 0 && board[x - 1].charAt(y) == '-') {
      to_return.add(x - 1);
      to_return.add(y);
      added = true;
     } else if (x + 1 < 10 && board[x + 1].charAt(y) == '-') {
      to_return.add(x + 1);
      to_return.add(y);
      added = true;
     } else if (y - 1 >= 0 && board[x].charAt(y - 1) == '-') {
      to_return.add(x);
      to_return.add(y - 1);
      added = true;
     } else if (y + 1 < 10 && board[x].charAt(y + 1) == '-') {
      to_return.add(x);
      to_return.add(y + 1);
      added = true;
     }
    }

    if (added) {
     return to_return;
    }
   }
  }

  return getRandom(board);
 }

 private static ArrayList<Integer> getRandom(String[] board) {
  ArrayList<Integer> to_return = new ArrayList<Integer>();
  Random ran = new Random();
  int x = 0;
  int y = 0;

  do {
   x = ran.nextInt(10);
   y = ran.nextInt(10);
  } while (board[x].charAt(y) != '-');

  to_return.add(x);
  to_return.add(y);

  return to_return;
 }
}

Output:

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank Online Judge Solution, Hackerrank Artificial Intelligence

Hackerrank - Java Solution - Tag Content Extractor Solution

2017-12-12T20:14:00.003-08:00

Hackerrank - Java Solution - Tag Content Extractor Solution

Problem Name - Tag Content Extractor
Problem Link - Tag Content Extractor
Level - String

Java Code

import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;


public class Solution {
    public static void main(String[] args) {
        Scanner scan  = new Scanner(System.in);
        int testCases = Integer.parseInt(scan.nextLine());
        
        /* Solution assumes we can't have the symbol "<" as text between tags */
        while (testCases-- > 0) {
            String line = scan.nextLine();
            boolean matchFound = false;
            Pattern r = Pattern.compile("<(.+)>([^<]+)</\\1>");
            Matcher m = r.matcher(line);
            while (m.find()) {
                System.out.println(m.group(2));
                matchFound = true;
            }
            if (!matchFound) {
                System.out.println("None");
            }
        }
        scan.close();
    }
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank - Java Solution - Tag Content Extractor Solution, Hackerrank Online Judge Solution, Hackerrank - Java Solutions,

Valid Username Regular Expression Solution Hackerrank - Java Solution

2017-12-12T20:10:00.002-08:00

Valid Username Regular Expression Solution Hackerrank - Java Solution

Problem Name - Valid Username Regular Expression
Problem Link - Valid Username Regular Expression
Level - String

Java Only Submitted Code

class UsernameValidator {
    public static final String regularExpression = "([a-zA-Z])(\\w){7,29}";
}

Java Full Source Code

import java.util.Scanner;

class UsernameValidator {
    public static final String regularExpression = "([a-zA-Z])(\\w){7,29}";
}
public class Solution {
    private static final Scanner scan = new Scanner(System.in);
    
    public static void main(String[] args) {
        int n = Integer.parseInt(scan.nextLine());
        while (n-- != 0) {
            String userName = scan.nextLine();

            if (userName.matches(UsernameValidator.regularExpression)) {
                System.out.println("Valid");
            } else {
                System.out.println("Invalid");
            }           
        }
    }
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Welcome to Java!, Valid Username Regular Expression Solution Hackerrank - Java Solution

Hackerrank - Java Solution - Java Regex 2 - Duplicate Words Solution

2017-12-12T20:01:00.002-08:00

Hackerrank - Java Solution - Java Regex 2 - Duplicate Words Solution

Problem Name - Java Regex 2 - Duplicate Words
Problem Link - Java Regex 2 - Duplicate Words
Level - String

Java Code

import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class DuplicateWords {

    public static void main(String[] args) {

        String regex = "\\b(\\w+)(\\W+\\1\\b)+";
        Pattern p = Pattern.compile(regex, Pattern.CASE_INSENSITIVE);

        Scanner in = new Scanner(System.in);
        int numSentences = Integer.parseInt(in.nextLine());
        
        while (numSentences-- > 0) {
            String input = in.nextLine();
            
            Matcher m = p.matcher(input);
            
            // Check for subsequences of input that match the compiled pattern
            while (m.find()) {
                input = input.replaceAll(m.group(), m.group(1));
            }
            
            // Prints the modified sentence.
            System.out.println(input);
        }
        
        in.close();
    }
}

Output:

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank Online Judge Solution, Hackerrank - Java Solutions, Hackerrank - Java Solution - Java Regex 2 - Duplicate Words Solution

Hackerrank - Java Solution - Java Regex Solution

2017-12-12T19:56:00.000-08:00

Hackerrank - Java Solution - Java Regex Solution

Problem Name - Java Regex
Problem Link - Java Regex
Level - String

Java Only Submitted Code

/*
     [01]?\\d{1,2}   matches numbers 0-199.
     2[0-4]\\d       matches numbers 200-249
     25[0-5]         matches numbers 250-255
*/
class MyRegex {
    String num = "([01]?\\d{1,2}|2[0-4]\\d|25[0-5])";
    String pattern = num + "." +  num + "." +  num + "." + num;
}

Java Full Source 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));
        }

    }
}
/*
     [01]?\\d{1,2}   matches numbers 0-199.
     2[0-4]\\d       matches numbers 200-249
     25[0-5]         matches numbers 250-255
*/
class MyRegex {
    String num = "([01]?\\d{1,2}|2[0-4]\\d|25[0-5])";
    String pattern = num + "." +  num + "." +  num + "." + num;
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank - Java Solution - Java Regex Solution, Hackerrank Online Judge Solution, Hackerrank - Java Solutions,

Hackerrank - Java Solution - Pattern Syntax Checker Solution

2017-12-12T19:51:00.003-08:00

Hackerrank - Java Solution - Pattern Syntax Checker Solution

Problem Name - Pattern Syntax Checker
Problem Link - Pattern Syntax Checker
Level - String
Point - 20

Java Code

import java.util.Scanner;
import java.util.regex.Pattern;
import java.util.regex.PatternSyntaxException;

public class Solution {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int testCases = scan.nextInt();
        scan.nextLine();
        
        // If a PatternSyntaxException is not thrown by Pattern.compile, the regular expresion is valid
        while (testCases-- > 0) {
           String pattern = scan.nextLine();
           try {
               Pattern.compile(pattern);
               System.out.println("Valid");
           } catch (PatternSyntaxException exception) {
               System.out.println("Invalid");
           }
        }
        scan.close();
    }
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank - Java Solution - Pattern Syntax Checker Solution ,Hackerrank Online Judge Solution, Hackerrank - Java Solutions,

Hackerrank - Java Solution - Java String Tokens solution

2017-12-12T19:48:00.000-08:00

Hackerrank - Java Solution - Java String Tokens

Problem Name - Java String Tokens
Problem Link - Java String Tokens
Level - String
Point - 15

Java Code

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        /* Read input */
        Scanner scan = new Scanner(System.in);
        String s = scan.nextLine();
        scan.close();
        
        s = s.trim(); // so that .split() works properly
        
        /* Check special cases */
        if (s.length() == 0) {
            System.out.println(0);
            return;
        }
        
        /* Split on all non-alphabetic characters */
        String [] words = s.split("[^a-zA-Z]+");
        
        /* Print output */
        System.out.println(words.length);
        for (String word : words) {
            System.out.println(word);
        }
    }
}

Output:

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank - Java Solution - Java String Tokens, Hackerrank Online Judge Solution, Hackerrank - Java Solutions,

Hackerrank - Java Solution - Java Anagrams Solution

2017-12-12T19:42:00.001-08:00

Hackerrank - Java Solution - Java Anagrams Solution

Problem Name - Java Anagrams
Problem Link - Java Anagrams
Level - String

Java Anagram Full Code

mport java.io.*;
import java.util.*;

public class Solution {
    static boolean isAnagram(String a, String b) {
        if ((a == null || b == null) || (a.length() != b.length())) {
            return false;
        }
        final char[] ARRAY_A = a.toUpperCase().toCharArray();
        final Map map = new HashMap<>();
        for (int i = 0; i < ARRAY_A.length; i ++) {
            if (map.containsKey(ARRAY_A[i])) {
                map.put(ARRAY_A[i], (map.get(ARRAY_A[i]) + 1));
            } else {
                map.put(ARRAY_A[i], 1);
            }
        }
        final char[] ARRAY_B = b.toUpperCase().toCharArray();
        for (int i = 0; i < ARRAY_A.length; i ++) {
            if (map.containsKey(ARRAY_B[i])) {
                Integer count = map.get(ARRAY_B[i]);
                if (count == 0) {
                    return false;
                } else {
                    count --;
                    map.put(ARRAY_B[i], count);
                }
            } else {
                return false;
            }
        }
        return true;
    }
    public static void main(String[] args) {
    
        Scanner scan = new Scanner(System.in);
        String a = scan.next();
        String b = scan.next();
        scan.close();
        boolean ret = isAnagram(a, b);
        System.out.println( (ret) ? "Anagrams" : "Not Anagrams" );
    }
}

Java Anagram Only Submitted Code

static boolean isAnagram(String a, String b) {
        if ((a == null || b == null) || (a.length() != b.length())) {
            return false;
        }
        final char[] ARRAY_A = a.toUpperCase().toCharArray();
        final Map map = new HashMap<>();
        for (int i = 0; i < ARRAY_A.length; i ++) {
            if (map.containsKey(ARRAY_A[i])) {
                map.put(ARRAY_A[i], (map.get(ARRAY_A[i]) + 1));
            } else {
                map.put(ARRAY_A[i], 1);
            }
        }
        final char[] ARRAY_B = b.toUpperCase().toCharArray();
        for (int i = 0; i < ARRAY_A.length; i ++) {
            if (map.containsKey(ARRAY_B[i])) {
                Integer count = map.get(ARRAY_B[i]);
                if (count == 0) {
                    return false;
                } else {
                    count --;
                    map.put(ARRAY_B[i], count);
                }
            } else {
                return false;
            }
        }
        return true;
    }

Output:

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank - Java Solution - Java Anagrams Solution, Hackerrank Online Judge Solution, Hackerrank - Java Solutions,

Hackerrank - Java Solution - Java String Reverse Solution

2017-12-12T19:31:00.001-08:00

Hackerrank - Java Solution - Java String Reverse Solution

Problem Name - Java String Reverse
Problem Link - Java String Reverse
Level - String

Java Code

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        /* Read input */
        Scanner scan = new Scanner(System.in);
        String str = scan.nextLine();
        scan.close();
        
        /* Reverse string and compare to original */
        /* If a String is equivalent to itself when reversed, it's a palindrome */
        
        String reversed = new StringBuilder(str).reverse().toString();
        System.out.println(str.equals(reversed) ? "Yes" : "No");
    }
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank Online Judge Solution, Hackerrank - Java Solutions, Hackerrank - Java Solution - Java String Reverse Solution

Hackerrank - Java Solution - Java Substring Comparisons Solution

2017-12-12T19:27:00.004-08:00

Hackerrank - Java Solution - Java Substring Comparisons Solution

Problem Name - Java Substring Comparisons

Problem Link - https://www.hackerrank.com/challenges/java-string-compare/problem
Level - String

Java Code

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        /* Save input */
        Scanner scan = new Scanner(System.in);
        String s = scan.nextLine();
        int k    = scan.nextInt();
        scan.close();
        
        /* Create smallest and largest strings and initialize them */
        String smallest = s.substring(0, k);
        String largest  = s.substring(0, k);

        for (int i = 0; i <= s.length() - k; i++) {
            String curr = s.substring(i, i + k);
            if (smallest.compareTo(curr) > 0){
                smallest = curr;
            }
            if (largest.compareTo(curr) < 0) {
                largest = curr;
            }
        }
        
        /* Print results */
        System.out.println(smallest);
        System.out.println(largest);
    }
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution,Hackerrank - Java Solution - Java Substring Comparisons Solution, Hackerrank Online Judge Solution, Hackerrank - Java Solutions,

Hackerrank - Java Solution - Java Substring Solution

2017-12-12T19:24:00.000-08:00

Hackerrank - Java Solution - Java Substring Solution

Problem Name - Java Substring
Problem Link - Java Substring
Level - String

Java Code

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String str = scan.next();
        int start  = scan.nextInt();
        int end    = scan.nextInt();
        scan.close();
        
        System.out.println(str.substring(start, end));
    }
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, WHackerrank - Java Solution - Java Substring Solution, Hackerrank Online Judge Solution, Hackerrank - Java Solutions,

Hackerrank - Java Solution - Java Strings Introduction Solution

2017-12-12T19:20:00.001-08:00

Hackerrank - Java Solution - Java Strings Introduction Solution

Problem Name - Java Strings Introduction
Problem Link - Java Strings Introduction
Level - String

Java Code

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        /* Save input */
        Scanner scan = new Scanner(System.in);
        String A = scan.next();
        String B = scan.next();
        scan.close();
        
        /* Sum lengths */
        System.out.println(A.length() + B.length());

        /* Compare lexicographical ordering */
        System.out.println(A.compareTo(B) > 0 ? "Yes" : "No");
        
        /* Print the Strings in desired format */
        System.out.println(capFirstLetter(A) + " " + capFirstLetter(B));
    }
    
    private static String capFirstLetter(String str) {
        if (str == null || str.length() == 0) {
            return "";
        } else {
            return str.substring(0,1).toUpperCase() + str.substring(1);
        }
    }
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank - Java Solution - Java Strings Introduction Solution, Hackerrank Online Judge Solution, Hackerrank - Java Solutions,

Hackerrank - Java Solution - Java Currency Formatter Solution

2017-12-12T19:07:00.000-08:00

Hackerrank - Java Solution - Java Currency Formatter Solution

Problem Name - Java Currency Formatter
Problem Link - Java Currency Formatter
Level - Introduction Challenges

Java Code

import java.util.Scanner;
import java.text.NumberFormat;
import java.util.Locale;

public class Solution {
    public static void main(String[] args) {
        /* Save input */
        Scanner scan = new Scanner(System.in);
        double payment = scan.nextDouble();
        scan.close();

        /* Create custom Locale for India - I used the "IANA Language Subtag Registry" to find India's country code */
        Locale indiaLocale = new Locale("en", "IN");

        /* Create NumberFormats using Locales */
        NumberFormat us     = NumberFormat.getCurrencyInstance(Locale.US);
        NumberFormat india  = NumberFormat.getCurrencyInstance(indiaLocale);
        NumberFormat china  = NumberFormat.getCurrencyInstance(Locale.CHINA);
        NumberFormat france = NumberFormat.getCurrencyInstance(Locale.FRANCE);

        /* Print output */        
        System.out.println("US: "     + us.format(payment));
        System.out.println("India: "  + india.format(payment));
        System.out.println("China: "  + china.format(payment));
        System.out.println("France: " + france.format(payment));
    }
}

Output:

Hackerrank - Java Solution - Java Int to String Solution

2017-12-12T18:39:00.002-08:00

Hackerrank - Java Solution - Java Int to String Solution

Problem Name - Java Int to String
Problem Link - Java Int to String
Level - Introduction Challenges

Java Only Submit Part Code

String s = "" + n;

Java Full Source Code

import java.util.*;
import java.security.*;

public class Solution {
    public static void main(String[] args) {
        DoNotTerminate.forbidExit();
        try {
            Scanner in = new Scanner(System.in);
            int n = in .nextInt();
            in.close();
             
            /* Here are 3 ways to convert an int to a String */
            // String s = String.valueOf(n);
            // String s = Integer.toString(n);
            String s = "" + n;

            if (n == Integer.parseInt(s)) {
              System.out.println("Good job");
            } else {
              System.out.println("Wrong answer.");
            }
        } catch (DoNotTerminate.ExitTrappedException e) {
              System.out.println("Unsuccessful Termination!!");
        }
    }
}

// The following class will prevent you from terminating the code using exit(0)!
class DoNotTerminate {
    public static class ExitTrappedException extends SecurityException {
        private static final long serialVersionUID = 1;
    }
    public static void forbidExit() {
        final SecurityManager securityManager = new SecurityManager() {
            @Override
            public void checkPermission(Permission permission) {
            if (permission.getName().contains("exitVM")) {
                throw new ExitTrappedException();
            }
        }
    };
    System.setSecurityManager(securityManager);
    }
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank - Java Solution - Java Int to String Solution, Hackerrank Online Judge Solution, Hackerrank - Java Solutions,