• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Generic Object Oriented Stack with Template

April 27, 2015 by Dhaval Dave

Here We have implemented a Generic Stack Example with Templates in C++ where we can Push any element into stack.

#include <iostream>
#include <vector>
#include <cstdlib>
#include <string>
#include <stdexcept>
using namespace std;

template <class T>
class Stack { 
  private: 
  vector<T> element; // elements
public: 
  void push(T const&); // push element 
  void pop(); // pop element 
  T top() const; // return top element 
  bool empty() const{ // return true if empty.
  return element.empty(); 
  } 
};
template <class T> void Stack<T>::push (T const& item) { 
 element.push_back(item); 
}
template <class T>
void Stack<T>::pop () { 
  if (element.empty()) { 
  throw out_of_range("Stack<>::pop(): empty stack"); 
  }
 element.pop_back(); 
}
template <class T> T Stack<T>::top () const 
{ 
  if (element.empty()) { 
  throw out_of_range("Stack<>::top(): empty stack"); 
  }
 return element.back(); 
}
int main() 
{ 
 try { 
  Stack<int> myIntegerStack; // stack of ints 
  Stack<string> myStringStack; // stack of strings
  myIntegerStack.push(10); 
       cout << myIntegerStack.top() <<endl;

myStringStack.push(“Messi”);
cout << myStringStack.top() << std::endl;
}
catch (exception const& ex) {
cerr << “Exception: ” << ex.what() <<endl;
return -1;
}
}
See Working Code at http://ideone.com/8sfDfC

Similar Articles

Filed Under: Adobe Interview Questions, Flipkart Interview Questions, Interview Questions, problem Tagged With: Stack

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Find next greater number with same set of digits

Hackerearth : Counting Subarrays

Printing intermediate Integers between one element & next element of array

Right view of Binary tree

Find the number ABCD such that when multipled by 4 gives DCBA.

Doubly linked list

Connect n ropes with minimum cost

Reliance Jio Software Developer Interview Experience

Linked List V/S Binary Search Tree

Circular Linked List

Find two non repeating elements in an array of repeating elements

VMWare Openings

Find min element in Sorted Rotated Array (Without Duplicates)

Find position of the only set bit

Implement LRU Cache

Flipkart Set 1 On Campus with Answers

Singly linked list

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Regular Expression Matching

Leetcode: Edit Distance

Find the smallest window in a string containing all characters of another string

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

BlueStone E-commerce Interview Experience

Find Pythagorean Triplets in an array in O(N)

Coin Collection Dynamic Programming

TicTacToe Game As Asked in Flipkart

25 horses 5 tracks Find 3 fastest puzzle

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Introduction To Number Theory ( Part 1 )

Copyright © 2025 · Genesis Framework · WordPress · Log in