Category: Competitive Programming

This problem is related to string handling and manipulation. So the original string which is sent to Cybertron is encrypted in the new string which comprises the letters followed by each time it has occurred in the original string.

Three dinos decide to play a game. In one move, one of the outer dinos can hop into a spot between the other two. Help them maximise their duration of play.

There are several sticks each 1 inch long. Your job is to form a rectangle with the biggest possible area, using these sticks as the perimeter.