Hello Programmers/Coders, Today we are going to share solutions of Programming problems of HackerRank, Algorithm Solutions of Problem Solving Section in Java. At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.
In this post, you will find the solution for Gemstones in Java-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.
Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.
Introduction To Algorithm
The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon in order to get the expected results.
Advantages of Algorithms:
- It is easy to understand.
- Algorithm is a step-wise representation of a solution to a given problem.
- In Algorithm the problem is broken down into smaller pieces or steps hence, it is easier for the programmer to convert it into an actual program.
Link for the Problem – Gemstones – Hacker Rank Solution
Gemstones – Hacker Rank Solution
Problem:
There is a collection of rocks where each rock has various minerals embeded in it. Each type of mineral is designated by a lowercase letter in the range . There may be multiple occurrences of a mineral in a rock. A mineral is called a gemstone if it occurs at least once in each of the rocks in the collection.
Given a list of minerals embedded in each of the rocks, display the number of types of gemstones in the collection.
Example
The minerals and appear in each rock, so there are gemstones.
Function Description
Complete the gemstones function in the editor below.
gemstones has the following parameter(s):
- string arr[n]: an array of strings
Returns
- int: the number of gemstones found
Input Format
The first line consists of an integer , the size of .
Each of the next lines contains a string where each letter represents an occurence of a mineral in the current rock.
Constraints
| arr[i] |
Each composition consists of only lower-case Latin letters (‘a’-‘z’).
Sample Input
STDIN Function ----- -------- 3 arr[] size n = 3 abcdde arr = ['abcdde', 'baccd', 'eeabg'] baccd eeabg
Sample Output
2
Explanation
Only and occur in every rock.
Gemstones – Hacker Rank Solution
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
int N;
Scanner in = new Scanner(System.in);
N = in.nextInt();
String s;
int[] count = new int[26];
int[] temp;
for (int i = 0; i < N; i++) {
temp = new int[26];
s = in.next();
for (char c : s.toCharArray()) {
temp[c - 97] += 1;
if (temp[c - 97] == 1)
count[c - 97] += 1;
}
temp = null;
}
int sum = 0;
for (int i = 0; i < 26; i++) {
if (count[i] == N)
sum += 1;
}
count = null;//garabage collector
System.out.println(sum);
}
}
