The exam goes by levels, starting from level 0. By doing each problem correctly, one level up, and so the difficulty of the problems. If one fails a problem, you can retry another problem in the same level, but without getting the full marks.

The following solutions are pending:

• cont_of_2 (fails test 9)
• equation
• print_doubleon

• count_alpha
• height_tree
• queue
• stack

• is_looping
• longest_sequence
• ord_alphlong
• reverse_tree
• str_maxlenoc

• can_split
• convert_bst
• gold_gain
• width_tree

• clone_list
• intersection
• longest_subarray
• range_comb
• volume_histogram

• count_island
• g_diam
• infin_add
• infin_mult