The questions were extremely easy and I solved all of them. I think I did very bad in the design round or behavior, impossible to know.

- Given N points find the nearest K from origin
- Given an array of numbers find a subset with a particular sum
- Given a Binary Tree, write an iterator.
- Given a sequence of tasks with a cooldown, return total time it takes to execute all of them, ignore the cooldown for the last task.
- Given two binary numbers add them.
- Design search()/suggestions.

All the best guys. I have no idea why I failed.