CareerCup

/* 
 this function defines the weight between two vertices
 we are looking at a directed graph, 
  where a->b and b->a will have different weights
*/
def min_click_path( ch_src, ch_dst  ){
   abs_delta = #|ch_src - ch_dst | // this is done by using +/- channel button 
   dst_digits = size( ch_dst , 10 ) // this is the abs number press 
   #(m,M) = minmax( abs_delta, dst_digits )
   m // minimal path from src to dst 
}
/* 
now just assume en.wikipedia.org/wiki/Dijkstra%27s_algorithm
from src to ch_dst 
respond with the weight for ch_dst 
*/

It is way simpler than that.

Need some more clarification on qn. Like
1. Is the start position of iteration is always start of the channel?
2. Is there any requirement like after reaching the max channel no. it will come to the start of channel no?

We can apply simple algm for resolving this:
1. find the min and max of the channel no's present in the array.
2. Get the start position,
3. if it is always start of the channel means, the answer will be max value of channel.