Interview Experience 21

#Round 1 codechef 3 coding questions

#Round 2 skype find the longest subset of an array having continuous numbers. (expected o(n) time). ans : use hashmap, it inserts,deletes search in o(1) or else use unordered set(worst case search is o(n))

#Round 2 algo given a paranthesis string which is balanced, then find the number of ways in which we can divide it into 2 groups x and y such that both the groups are paranthesis balanced. for eg : (()) -- ans is 6

#Round 3 algo There is a rectangle with left bottom as (0, 0) and right up as (x, y). There are n circles such that their centers are inside the rectangle. Radius of each circle is r. Now we need to find out if it is possible that we can move from (0, 0) to (x, y) without touching the circle.We can move freely anywhere.