flow.cpp

//http://code2flow.com
A Q is raised; 
Name of the function;
Input type and output type;
Test case;
Contrains / time / space requirements;

if (Q in [Leetcode, CareerCup] or similiar) 
  {
  Recall the answer;
  prepare the followup
}

else { 
  if (Q has hints) 
  { 
    if (sorted) 
    { 
      binary search
    }
    else if ( max or all)
    {
      dp or backtracking
    }
    else if ( bit / tree / linked list )
    {
      common strategies
    }
  
    else 
    {
      data structure brainstorm
      hash / stack / heap 
    }
  }
  else 
  {
    estimate the difficulty;
    ask for hints
  }
}

Start to write codes;