GOOGOL05 – Laboratories
PROBLEM STATEMENT: Practice, Contest
CATEGORY: CAKEWALK
PRE-REQUISITES: String operation or map in STL(C++).
EXPLAINATION:
The task was pretty simple and you had to calculate the number of times a particular string occurred in the given set of string. Using a map would easily help you to map all the strings. And then you can iterate the map, because a map stores the strings in lexicographical order.
Problem Setters code: mugHX3 - Online C++ Compiler & Debugging Tool - Ideone.com .
Author: Prayank Mathur
Tester: Suraj Singh
Editorialist: Suraj Singh