You are not logged in. Please login at to post your questions!


GOOGOL05 - Editorial

GOOGOL05 – Laboratories

PROBLEM STATEMENT: Practice, Contest


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: .

Author: Prayank Mathur
Tester: Suraj Singh
Editorialist: Suraj Singh

This question is marked "community wiki".

asked 21 May '15, 17:09

surajjumpy's gravatar image

accept rate: 0%

edited 21 May '15, 18:15

admin's gravatar image

0★admin ♦♦

toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 21 May '15, 17:09

question was seen: 891 times

last updated: 21 May '15, 18:15