(a) first, write a function to calculate the hamming distance between two binary numbers (b) write a function that takes a list of binary numbers and returns the sum of the hamming distances for each pair (c) find a solution for (b) that works in O(n) time.
Two people are each stuck on their own island, connected by a ferryman with a lockable box. Each person has their own lock and key, but can't send the key along with the box. One person wants to send the other a diamond, but it must be placed into the box and locked or it will be stolen by the ferryman. How do you send the diamond without the ferryman stealing it?
General behavior questions, like why you want to work in Japan. Why did you study computer science, etc. Barely any technical question, as the interviewers have already checked my website and experiences, and know I have extensively experience and projects under my belt, and is probably more competitive than their full-time engineers.
Given a list of number 8 4 3 0 6 4 0, move all 0's to start of the list. use minimum sorting rounds
Data structures and Algorithms related
Questions on basic Java,pointers concept,oops concept,Abstraction,Inheritance etc.
what is hash table??
Why do you want to join us?
If you add an element at a[1] position in arreylist and access a[2] element,what will happen?
Write a function to caculate the angle between hour and minute hand on a clock.
Viewing 181 - 190 interview questions