   # Write a method to calculate total Weight of a hill pattern in Java?

0 votes
7,691 views

Given,
the total levels in a hill pattern (input1),
the weight of the head level (input2), and
the weight increments of each subsequent level (input3),
you are expected to find the total weight of the hill pattern.

"Total levels" represents the number of rows in the pattern.
"Head level" represents the first row.
Weight of a level represents the value of each star (asterisk) in that row.

The hill patterns will always be of the below format, starting with 1 star at head level and increasing 1 star at each level till level N.

``````*
**
***
****
*****
******
``````

. . .and so on till level N

Example1 -
Given,
the total levels in the hill pattern = 5 (i.e. with 5 rows)
the weight of the head level (first row) = 10
the weight increments of each subsequent level = 2
Then, The total weight of the hill pattern will be calculated as = 10 + (12+12) + (14+14+14) + (16+16+16+16) + (18+18+18+18+18) = 10 + 24 + 42 + 64 + 90 = 230

Example2 -
Given,
the total levels in the hill pattern = 4
the weight of the head level = 1
the weight increments of each subsequent level = 5
Then, Total weight of the hill pattern will be = 1 + (6+6) + (11+11+11) + (16+16+16+16) = 1 + 12 + 33 + 64 = 110 posted Dec 10, 2017
Share this question

## 1 Answer

+1 vote

Best answer
``````public int totalHillPatern(int input1, int input2, int input3){
int row=1,num=input2,sum=0,i;
while(input1-- >0){
i=0;
while(i++ < row){
sum+=num;
num+=input3;
row++;
}
return sum;
}
`````` answer Dec 10, 2017
public int totalHillWeight(int input1,int input2,int input3){

int row=1,num=input2,sum=0,i;
while(input1-- >0){
i=0;
while(i++ < row){
sum+=num;

}
num+=input3;
row++;
}
return sum;
}
what is the solution for 10+(12+10+12)+(14+12+14+12+14)+(16+14+16+14+16+14+16)+(18+16+18+16+18+16+18+16+18)=370
Please ask a fresh question, in place of comment?
why you have written input-->0?
Similar Questions
+2 votes

Weight of vowels that appear in the string should be ignored and All non-alphabetic characters in the string should be ignored.

Weight of each letter is its position in the English alphabet system, i.e. weight of a=1, weight of b=2, weight of c=3, weight of d=4, and so on….weight of y=25, weight of z=26
Weight of Upper-Case and Lower-Case letters should be taken as the same, i.e. weight of A=a=1, weight of B=b=2, weight of C=c=3, and so on…weight of Z=z=26.

Example1:
Let us assume the word is `“Hello World!!”`
Weight of “Hello World!!” = 8+0+12+12+0+0+23+0+18+12+4+0+0 = 89
Note that weight of vowels is ignored. Also note that the weight of non-alphabetic characters such as space character and ! is taken as zero.

+3 votes

Implement a code that counts the occurrences of each word in an input file and write the word along with corresponding count in an output file sorted by the words alphabetically.

## Sample Input

``````Gaurav is  a Good Boy
Sita is a Good Girl
Tommy is  a Good Dog
Ram is a Good person
``````

## Sample Output

``````D:\>Java FileWordCount inputFile.txt outputFile.txt
Boy : 1
Dog : 1
Gaurav : 1
Girl : 1
Good : 4
Ram : 1
Sita : 1
Tommy : 1
a : 4
is : 4
person : 1
``````
+3 votes

Rohit wants to add the last digits of two given numbers.
For example, If the given numbers are 267 and 154, the output should be 11.

Below is the explanation -
Last digit of the 267 is 7
Last digit of the 154 is 4
Sum of 7 and 4 = 11

### Write a program to help Rohit achieve this for any given two numbers.

Note: The sign of the input numbers should be ignored. i.e.
if the input numbers are 267 and 154, the sum of last two digits should be 11
if the input numbers are 267 and -154, the sum of last two digits should be 11
if the input numbers are -267 and 154, the sum of last two digits should be 11
if the input numbers are -267 and -154, the sum of last two digits should be 11

+2 votes

Assumption:

• The input strings will contain only numeric digits
• The input strings can be of any large lengths
• The lengths of the two input string need not be the same
• The input strings will represent only positive numbers

Example

If input strings are “1234” and “56”, the output string should be “1290”
If input strings are “56” and “1234”, the output string should be “1290”
If input strings are “123456732128989543219” and “987612673489652”, the output string should be “123457719741663032871”