C++ Class Template Specialization in C++ HackerRank Solution

Hello Programmers, In this post, you will know how to solve the C++ Class Template Specialization in C++ HackerRank Solution. This problem is a part of the HackerRank C++ Programming Series.

C++ Class Template Specialization in C++ HackerRank Solution
C++ Class Template Specialization in C++ HackerRank Solutions

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.

C++ Class Template Specialization in C++ HackerRank Solutions

Objective

You are given a main function which reads the enumeration values for two different types as input, then prints out the corresponding enumeration names. Write a class template that can provide the names of the enumeration values for both types. If the enumeration value is not valid, then print unknown.

Input Format :

The first line contains t, the number of test cases.
Each of the t subsequent lines contains two space-separated integers. The first integer is a color value, c, and the second integer is a fruit value, f.

Constraints :

  • 1<= t <=100
  • -2*10^9 <= c <= 2*10^9
  • -2*10^9 <= f <= 2*10^9

Output Format:

The locked stub code in your editor prints t lines containing the color name and the fruit name corresponding to the input enumeration index.

Sample Input :

2
1 0
3 3

Sample Output :

green apple
unknown unknown

Explanation :

Since t = 2, there are two lines of output.

  1. The two input index values, 1 and 0, correspond to green in the color enumeration and apple in the fruit enumeration. Thus, we print green apple.
  2. The two input values, 3 and 3, are outside of the range of our enums. Thus, we print unknown unknown.

C++ Class Template Specialization in C++ HackerRank Solutions

#include <iostream>
using namespace std;
enum class Fruit { apple, orange, pear };
enum class Color { red, green, orange };
/* C++ Class Template Specialization in C++ - Hacker Rank Solution START */
template <typename T> struct Traits;
char s []="unknown";
char f0 []="apple";
char f1 []="orange";
char f2 []="pear";
char c0 []="red";
char c1 []="green";
char c2 []="orange";
template <>
struct Traits<Fruit>
{
    public:
    static char* name(int a)
    {
        if(a>=3 || a<0)
            return s;
        else if (a==0)
            return f0;
        else if (a==1)
            return f1;
        else
            return f2;
    }
};
template <>
struct Traits<Color>
{
    public:
    static char* name(int a)
    {
        if(a>=3 || a<0)
            return s;
        else if (a==0)
            return c0;
        else if (a==1)
            return c1;
        else
            return c2;
    }
};
/* C++ Class Template Specialization in C++ - Hacker Rank Solution END */
int main()
{
	int t = 0; std::cin >> t;
    for (int i=0; i!=t; ++i) {
        int index1; std::cin >> index1;
        int index2; std::cin >> index2;
        cout << Traits<Color>::name(index1) << " ";
        cout << Traits<Fruit>::name(index2) << "\n";
    }
}

Disclaimer: The above Problem (C++ Class Template Specialization in C++) is generated by Hackerrank but the Solution is Provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.

Next: Arrays Introduction in C++ HackerRank Solution

Leave a Reply

Your email address will not be published. Required fields are marked *