Competitive programming – Page 7

Finding K-size sub array with minimum sum

November 21, 2013adminLeave a comment

Given an array of size N and a number K. We have to find the sub-array of size K such that the sum of it’s elements is minimum among all K-size sub arrays. For example Let us consider the following array of size 10. {1, 2, 1, 3, 1, 1, 1, 4, 2, 3} The…

Jolly jumpers problem

October 28, 2013adminLeave a comment

In this post I introduce you to a competitive programming problem called Jolly jumpers. This problem is available on UVa online judge on this link. UVa site is one of the first online judge websites which listed programming problems from different competitions like ACM ICPC and IOI and allowed users to solve and submit their…