Skip to main content

Posts

Showing posts from 2017

Java program to print the maximum hourglass value of the matrix

Context   Given a    2D Array ,  : 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 We define an hourglass in   to be a subset of values with indices falling in this pattern in  's graphical representation: a b c d e f g There are   hourglasses in  , and an  hourglass sum  is the sum of an hourglass' values. Task   Calculate the hourglass sum for every hourglass in  , then print the  maximum  hourglass sum. Note:  If you have already solved the Java domain's  Java 2D Array  challenge, you may wish to skip this challenge. Input Format There are   lines of input, where each line contains   space-separated integers describing  2D Array   ; every value in   will be in the inclusive range of   to  . Constraints Output Format Print the largest (maximum) hourglass sum f...

Java program to find the Pythagorean Triplet in an array

Pythagorean Triplet Show Topic Tags Amazon Given an array of integers, write a function that returns true if there is a triplet (a, b, c) that satisfies a2 + b2 = c2. Input: The first line contains 'T' denoting the number of testcases. Then follows description of testcases. Each case begins with a single positive integer N denoting the size of array. The second line contains the N space separated positive integers denoting the elements of array A. Output: For each testcase, print "Yes" or "No" whether it is Pythagorean Triplet or not. Constraints: 1<=T<=50 1<=N<=100 1<=A[i]<=100 Program below: package test; import java.util.Scanner; public class PythagorianTriplet { private static String findPythagorianTripletInArray(int[] input, int n) { int yesCount = 0; String values = null; for (int i = 0; i < n; i++) { for (int j = i+1; j < n; j++) { for (i...

Java program to create staircase

Observe that its base and height are both equal to  , and the image is drawn using  #  symbols and spaces.  The last line is not preceded by any spaces. Write a program that prints a staircase of size  . Input Format A single integer,  , denoting the size of the staircase. Output Format Print a staircase of size   using  #  symbols and spaces. Note : The last line must have   spaces in it. package com.rohan.test; import java.util.Scanner; public class StaircaseTest {     public static void main(String[] args) {         Scanner in = new Scanner(System.in);         int n = in.nextInt();                  for(int i = 0; i< n; i++) {         for(int k = 0; k < n; k++) {         if(k < n-i-1)         System.out.p...

Fractional part test in java program

Given an array of integers, calculate which fraction of its elements are  positive , which fraction of its elements are  negative , and which fraction of its elements are  zeroes , respectively. Print the decimal value of each fraction on a new line. Note:  This challenge introduces precision problems. The test cases are scaled to six decimal places, though answers with absolute error of up to   are acceptable. Input Format The first line contains an integer,  , denoting the size of the array.  The second line contains   space-separated integers describing an array of numbers  . Output Format You must print the following   lines: A decimal representing of the fraction of  positive  numbers in the array compared to its size. A decimal representing of the fraction of  negative  numbers in the array compared to its size. A decimal representing of the fraction of  ze...