Tech-queries.blogspot.com Website Review

I generally start with a very simple question with my interview candidates. I ask the for writing a program for giving the integer average of 2 integers using only integer type variables. As*ume that input will always be with in integer limits. The definition of integer average is the highest smaller integer if average is floating point number. Also the condition if that they can 95% of candidates smell some issues in this problem and when I say nothing is there they don't even ask any clarification and come up Then I ask them to have a look if this is correct on definition and then they see that it is. But there test failed on very first floating point negative average. Then most of them do a quick fix and come up with something below: The above solution is obviously wrong if sum if a even negative number. I am disheartened to see why do these candidates just solve a test case and show the solution. They don't even care to run this with some examples. On pointing this, most of them correct the code. Others face the rejection at this stage. Now I ask them to make it production worthy and taking care of boundary conditions. Many of them are not able to do so but some of Though I expect this problem to be concluded within 30 minutes depending of their experience but candidates do a lot of silly   int sum = a+b;   if (sum < 0 && sum%2 != 0)   cout << endl << Enter a and b: ;   cin >> a >>b; EDIT: We get a more efficient and concise solution in comments. Please go through it.  Notably most of the solution for binary search are wrong because of above reason. This bug This question can also be asked as print all subsets of a given set. This can be simply achieved by recursion. We just need to identify correct boundary conditions. Below is the code for the same. In this code, I have taken string in place of tuple but the logic stays same. def pattern(prefix, input, len)   # boundary condition # for test, I took only abc, you can take the input as argument input = abc