first round of interview : find largest area of rectangle in a histogram and some theory questions of DSA about finding a cycle and difference between tree and graph
Second Round : given number from 1 to n , and edge between them can exist if they have gcd greater than 1, given q queries find if a and b given are connected or not
