These were the questions asked for the GS coder pad (1st round)-

1. Compress String - aabbc - a2b2c1, a - a1
2. Find optimal path -
   Grid - [[0, 0, 0, 0, 5],
   [0, 1, 1, 1, 0],
   [2, 0, 0, 0, 0]]

Start is [2, 0], destination - [0, 4]
Can only go up or east(right)
Numbers denote the rocks, find the most optimal path where you go from source to destination and collect the maximum number of rocks in the process.
Output - 10