InterviewBit Problems   Greatest Common Divisor : Unsolved

About the Greatest Common Divisor : Unsolved category (1)
Easiest Approach of Euclidian GCD (1)
Easy 4 line cpp solution ,TC=O(log^( min(a,b) ) ) (1)
Can't use recursion in Python (5)
Very Simple Cpp code (1)
Not giving full points (4)
Time limit exceded for both iterative and recursive (4)
Gcd(0,n) is not clearly defined. it should be noted that gcd(0,n) = n (4)
Are we allowed recursion? (3)
Important Corner Case (3)
Hi! i think the question should say '2 non-negative numbers' instead of '2 positi (5)
It would be nice if you could use grep and give a compilation error when using li (2)