↳

What if one or both of a,b is less than zero. ln(x) for x < 0 is not defined. Less

↳

Obviously the interviewer would not allow us to use Math functions like exp, log etc. We are supposed to use the Long division method or the Newton Raphson method to find the quotient. Newton Raphson is the fastest but uses operator * (multiplication) though. Less

↳

Ya the same thing.....I already listed right...I had a difficulty in answering Observer pattern so listed here so that others can prepare well :) On site they will ask to write small code I guess but not so complicated. I heard that fidelity interview is not that tough as tech companies. So prepare well, answer confidently. All the best for the interview. Less

↳

Did you guys gave the on-site interview? How was the experience?

↳

We didn't even get to salary expectations actually. Yea I'm very confident I answered everything correctly. It was definitely not a difficult assessment at all. I know it's kinda tough but try not to be discouraged, unfortunately it's not uncommon for you to ace a technical but still get rejected. All we did was have the technical thing on a google doc, then afterwards they explained what the company does, which is build custom software essentially, and then asked if I had questions. Hopefully you guys have better luck than I did. Less

↳

I have an interview with them this upcoming next week, I am sorry it did not work out I am sure you did great. Makes me a bit nervous you aced it and didnt get a call back. Less

↳

String buffer = new StringBuffer(); while (n > 0) { int base = n% 16; buffer.append((base<10 ? base : (Char)('a'+base-10)); n /= 16; } String result = buffer.toString().reverse(); Less

↳

public String toHex(int num) { if(num == 0) return "0"; char[] map = {'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'}; String result = ""; while(num != 0){ System.out.println((num & 15)+ " "+ result); result = map[(num & 15)] + result; num = (num >>> 4); } return result.toString(); } Less

↳

I would add a min-heap of size 100 to BetterSolution's answer (in order to get the top 100). Less

↳

Quick Sort is O ( n log n ) avg case, so we could do better O (n) Now, onto design : Do the lines have other information other than URL? If so, we need to filter them out using Regular Expressions. Possible O (n) solution: A hashmap with URL's as keys and number of hits as values would yield a O(n) run-time to populate it. Algo: while input from file getURL (or filter out URLs from line) if URL exists in hashmap, increment its count else add URL to hashmap Ofcourse, being a large data set, we might get a ton of random disk seeks due to paging of memory. After profiling, if we really find that to be a problem then we could do something like encode the urls into something smaller that takes less space and hence has a lesser probability of causing paging. I can think of few more solutions but I think this should be sufficient. Less

↳

The "What is your biggest weakness?" question is a stock question in the interview processes. Generally speaking, when noting a weakness it should be a small, nominal item and relevant to the workplace. Certainly, be honest, as it could come back to you later in your career. For example, if you note being too talkative as your weakness, but hardly say a word once you have landed the job or during the interview, it could impact your credibility. Most importantly, when you're provided the opportunity to answer this question, be confident and try to make a professional, memorable impression to set yourself apart from the other candidates, because that's really what it's all about. Less

↳

I tend to explain to much beyond what is needed/required.

↳

I was asked this question by the CEO of a company during my telephonic interview. Even though I didn't ask, told me his age. That just seemed weird and not very professional. This wasn't Deloitte. Less

↳

So many ways to find this information - in a, sort of, sneaky way. Has no-one noticed that now you not only being asked for your degrees but what year you obtained them - easy enough to extrapolate in the majority of cases... Less

↳

I'm not a CS student, so I'm not sure if it is a plain tree. It is a rooted tree, and each branch with one or two branches below. The solution seems using recursion. Less

↳

Generally in this type of question, tree should mean a binary search tree in which each left child (and subtree) is smaller than the parent and right child (and subtree) is greater than the parent. So it requires an inorder traversal of this tree to obtain values in a sorted order that can be put in an array. Less

↳

Same idea that in-place partition for quicksort, swap them if the number is 0, at the end you will have all the 0's in the right side Less

↳

array = [1,2,3,4,0,5,6,0,7,8] for (i = 0, z = 0, l = array.length; i < l; i++) { if (i < l - z) { if (array[i] === 0) z++ else array[i - z] = array[i] } else { array[i] = 0 } } Less