# Gemstones

### Problem Statement :

```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 ascii[ a - z ]. 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.

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 n, the size of arr.
Each of the next n lines contains a string arr[ i ] where each letter represents an occurence of a mineral in the current rock.

Constraints

1  <=   n  <=  100
1  <=   | arr [ i ] |   <=  100
Each composition arr[ i ] consists of only lower-case Latin letters ('a'-'z').```

### Solution :

```                            ```Solution in C :

In   C++   :

#include <iostream>
#include <fstream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <complex>
#include <cstdlib>
#include <ctime>
using namespace std;

bool occ[105][26];

int main()
{
int N;
cin >> N;

for (int i = 0; i < N; i++)
{
string s;
cin >> s;

for (int j = 0; j < s.length(); j++)
occ[i][s[j]-'a'] = true;
}

int total = 0;
for (int i = 0; i < 26; i++)
{
bool all = true;
for (int j = 0; j < N; j++)
all = all && occ[j][i];

total += all;
}

cout << total << "\n";

return 0;
}

In   Java  :

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;

class Solution {
public static void main(String... args) {

Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
List<HashSet<Character>> distinctSets = new ArrayList<>();
scanner.nextLine();
for (int i = 0; i < N; ++i) {
HashSet<Character> set = new HashSet<>();
char[] array = scanner.nextLine().toCharArray();
for (char c : array)
}

boolean isCurrentCharGem = false;
int count = 0;
for(char c : distinctSets.get(0)) {
isCurrentCharGem = true;
for (HashSet<Character> set : distinctSets) {
if (!set.contains(c)) {
isCurrentCharGem = false;
break;
}
}
if (isCurrentCharGem)
count++;
}

scanner.close();
System.out.println(count);

}
}

In   C :

#include<stdio.h>

int main()
{

int n,i,j,freq[150][27]={0},count;
char str[200];
scanf("%d",&n);
for(i=0;i<n;i++)
{

scanf("%s\n",str);
for(j=0;str[j]!='\0';j++)
{
freq[i][str[j]-97]++;
}

}
count=0;
for(i=0;i<26;i++)
{
for(j=0;j<n;j++)
if(freq[j][i]>0)
continue;
else
break;
if(j==n)
count++;
}
printf("%d\n",count);
return 0;
}

In  Python3  :

import sys
import string

if line is None:
return [int(x) for x in line.split()]

if __name__ == '__main__':
gem_elements = set(string.ascii_lowercase)
for i in range(n):
gem_elements = gem_elements & set(stone)
print(len(gem_elements))```
```

## Left Rotation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d

## Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

## Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

## Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

## Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink