Applied through a friend and was invited for a phone interview. Guess Phone interview was overall fine with one coding question and some LP during discussion.
Coding Question:
Given 2 arrays denoting a set of objects for weights and their values. Also given a max weight value, find the maximal value we can fit in the given weight.
Eg:
values=[30,80,11,40]
weights=[20,10,100,3]
maxweight=35
output={30,80,40} //Since maxweight is 35 we can include objects 30,80,40 to maximize value for 150 and still staying under maxweight 35
for an object @ i its weight is at weight[i] and its value is at values[i]

I did a 2 pointer approach for finding the max weight O(n2) within the time limit. but I guess its not good enough. do we have a better way to solve this?
Not sure if I would be getting to next round.

LP:
whats the hardest challenge you faced at your work and what did you do to overocme it?
They dig deeper on what exactly you did to over come it. Be ready with specifics.

overal I did decent on LP and just OK on tech prob I think.
I guess I may not make to next round but would like to see how can we solve this problem in a more optimal way.