Abstract Classes – Polymorphism in C++ Hacker Rank Solution

Hello coders, In this post, you will learn how to solve the Abstract Classes – Polymorphism in C++ Hacker Rank Solution. This problem is a part of the HackerRank C++ Programming Series.

We also provide Hackerrank solutions in CJava programming, and Python Programming languages so whatever your domain we will give you an answer in your field.

You can practice and submit all HackerRank problem solutions in one place. Find a solution for other domains and Sub-domain. I.e. Hacker Rank solution for HackerRank C ProgrammingHackerRank C++ ProgrammingHackerRank Java Programming, HackerRank Python ProgrammingHackerRank Linux ShellHackerRank SQL Programming, and HackerRank 10 days of Javascript.

Abstract Classes - Polymorphism in C++ Hacker Rank Solution
Abstract Classes – Polymorphism in C++ – Hacker Rank Solution

As you already know that this site does not contain only the Hacker Rank solutions here, you can also find the solution for other problems. I.e. Web Technology,Data StructuresRDBMS ProgramsJava Programs Solutions,  Fiverr Skills Test answersGoogle Course AnswersLinkedin Assessment, and Coursera Quiz Answers.

Abstract Classes – Polymorphism in C++ Hacker Rank Solution


Abstract base classes in C++ can only be used as base classes. Thus, they are allowed to have virtual member functions without definitions.
A cache is a component that stores data so future requests for that data can be served faster. The data stored in a cache might be the results of an earlier computation, or the duplicates of data stored elsewhere. A cache hit occurs when the requested data can be found in a cache, while a cache miss occurs when it cannot. Cache hits are served by reading data from the cache which is faster than recomputing a result or reading from a slower data store. Thus, the more requests that can be served from the cache, the faster the system performs.
One of the popular cache replacement policies is: “least recently used” (LRU). It discards the least recently used items first.
For example, if a cache with a capacity to store 5 keys has the following state(arranged from most recently used key to least recently used key) –

5 3 2 1 4

Now, If the next key comes as 1(which is a cache hit), then the cache state in the same order will be –

1 5 3 2 4

Now, If the next key comes as 6(which is a cache miss), then the cache state in the same order will be –

6 1 5 3 2

You can observe that 4 has been discarded because it was the least recently used key and since the capacity of cache is 5, it could not be retained in the cache any longer.

Given an abstract base class Cache with member variables and functions:

mp – Map the key to the node in the linked list
cp – Capacity
tail – Double linked list tail pointer
head – Double linked list head pointer
set() – Set/insert the value of the key, if present, otherwise add the key as the most recently used key. If the cache has reached its capacity, it should replace the least recently used key with a new key.
get() – Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
You have to write a class LRUCache which extends the class Cache and uses the member functions and variables to implement an LRU cache.

Input Format :

First line of input will contain the N number of lines containing get or set commands followed by the capacity M of the cache.
The following N lines can either contain get or set commands.
An input line starting with get will be followed by a key to be found in the cache. An input line starting with set will be followed by the key and value respectively to be inserted/replaced in the cache.

Constraints :

1 <= N <= 500000
1 <= M <= 1000
1 <= key <= 20
1 <= value <= 2000

Output Format :

The code provided in the editor will use your derived class LRUCache to output the value whenever a get command is encountered.

Sample Input :

3 1
set 1 2
get 1
get 2

Sample Output :


Explanation :

Since, the capacity of the cache is 1, the first set results in setting up the key 1 with it’s value 2. The first get results in a cache hit of key 1, so 2 is printed as the value for the first get. The second get is a cache miss, so -1 is printed.

Abstract Classes – Polymorphism in C++ Hacker Rank Solution

#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#include <set>
#include <cassert>
using namespace std;
struct Node
   Node* next;
   Node* prev;
   int value;
   int key;
   Node(Node* p, Node* n, int k, int val):prev(p),next(n),key(k),value(val){};
   Node(int k, int val):prev(NULL),next(NULL),key(k),value(val){};
class Cache
   map<int,Node*> mp; //map the key to the node in the linked list
   int cp;  //capacity
   Node* tail; // double linked list tail pointer
   Node* head; // double linked list head pointer
   virtual void set(int, int) = 0; //set function
   virtual int get(int) = 0; //get function
// Abstract Classes - Polymorphism in C++  - Hacker Rank Solution start
class LRUCache: public Cache
    LRUCache(int c)
      cp = c;
    void set(int k, int v)
        Node* N;
        if ( mp.empty() )
            N = new Node(k,v);
            tail = head = N;
            mp[k] = N;
        auto it = mp.find(k);
        if ( it != mp.end() )
            it->second->value = v;
            if ( head == it->second )
            it->second->prev->next = it->second->next;
            if ( tail == it->second )
                tail = tail->prev;
                it->second->next->prev = it->second->prev;
            it->second->next = head;
            it->second->prev = nullptr;
            head->prev = it->second;
            head = it->second;
            N = new Node(head->prev, head, k, v);
            head->prev = N;
            head = N;
            mp[k] = N;
            if ( mp.size() > cp )
                tail = tail->prev;
                delete tail->next;
                tail->next = nullptr;
    int get(int k)
        auto it = mp.find(k);
        if ( it != mp.end() )
            return it->second->value;
        return -1;
// Abstract Classes - Polymorphism in C++  - Hacker Rank Solution End
int main()
   int n, capacity,i;
   cin >> n >> capacity;
   LRUCache l(capacity);
      string command;
      cin >> command;
      if(command == "get")
         int key;
         cin >> key;
         cout << l.get(key) << endl;
      else if(command == "set")
         int key, value;
         cin >> key >> value;
   return 0;

Disclaimer: The above Problem (Abstract Classes – Polymorphism in C++ ) is generated by Hackerrank but the Solution is Provided by Chase2Learn. This tutorial is only for Educational and Learning purposes. Authority if any of the queries regarding this post or website fill the following contact form thank you.


Which language is best for HackerRank?

While JavaScript is the best-known language, HackerRank also found that only 5% of respondents say it is their first programming language.

Is HackerRank good for beginners?

HackerRank is very good for beginners so even if you want to print your first program “Hello World!” then definitely HackerRank gives this opportunity to you. It has a pretty good UI with boilerplate code pre-written that helps beginners to start competitive coding.

What is meant by HackerRank?

HackerRank is a tech company that focuses on competitive programming challenges for both consumers and businesses. Developers compete by writing programs according to provided specifications. Wikipedia

What is C++ programming used for?

C++ is a general-purpose programming language created by Danish computer scientist Bjarne Stroustrup as an extension of the C programming language, or “C with Classes”. Wikipedia

Where can I find HackerRank solutions in CPP?

in this post you will get all the solutions of HackerRank CPP Problems.

Finally, we are now, in the end, I just want to conclude some important message for you

Note:- I compile all programs, if there is any case program is not working and showing an error please let me know in the comment section. If you are using adblocker, please disable adblocker because some functions of the site may not work correctly.

Please share our posts on social media platforms and also suggest to your friends to Join Our Groups. Don’t forget to subscribe.

Sharing Is Caring

Leave a Comment