Senior Software Engineer

The problem can be solved using dynamic programming. 
At every i-th element we have two choices to make, i.e., include the i-th element or don't.
•Case1 : Don't include the ith element - then we can include the i-1 th element...so we will have max sum included till i-1 th element
•Case 2 : Include the i-th element - then we can't include the i-1 th element but we can include i-2 th element. So, we will have max sum included till i-2 th element + ith element.
Time Complexity: O(n) 
Auxiliary Space Complexity: O(n)

To get a uniform distribution between 1-12, 3 faces of the dice should be marked 0 and the rest three with 6. In this manner, all values will have a probability of 1/12.

The output of v will be 5. 
v++ is a post increment operator, so the value of v is incremented after it is evaluated. Hence, the operation would be :
3 += 2;
So, v = 5