2012年9月26日 星期三

Square phone interview


3 Rounds phone interview...

#1. Given array A[], find A[j] - A[i] which is max and j < i
A: DP

#2. String reverse
#3. Implement a hash table

#4 Prefix calcuator

prefix calculator

(+ (/ 4 2) 3)
5

giving a string, compute the expression using prefix notation
feel free to make simplifying assumptions about the expression or helper methods available to you
we'll relax some of these assumptions as we go

沒有留言:

張貼留言