It is 12:00 PM mock interview. I have experience to work on the algorithm root of a number over 10 ten times, 5 for interviewer, 5 for interviewee. The peer has strong talent with 1st place twitter big data hackathon. The peer worked on decrypt the message algorithm first, I rated him top 5 - 10% in all over 200 peers I worked last 12 months.
I like to write a binary search and also apply some technique I saw recently using integer to count the numbers.
The peer challenged me about the termination base case, 0.001 is the error range, how I assert that two values are equal using 0.001?
Here is my C# code.