There were two coding questions and I was given a blank paper. Q1: find digit sum of all the questions till n. eg if n = 12, res = 51 (1+2+...+9 + (1+0) + (1+1) + (1+2)) Q1 was easy and I was able to code it. Q2 was tough here is the question http://stackoverflow.com/questions/11253027/algorithm-to-find-the-total-number-of-connected-sets-in-a-matrix I solved the problem, but was not able to code it properly as it was a long program and I had only paper. I thought i will explain the code later to the interviewer. I got rejected came back and coded both questions at home with same logic. Still dont know why I got rejected.
