Applied directly on expedia carrer portal without any referral. Recieved OA link after 2 weeks.
3 questions (90 mins)
there are n transformers each transformer belong to a group . you are given the groups[] arr. we have to deactivate at least ceil(n/2) transformers. we have to either deactivate all transformers of a group or no transformer from that group should be deactivated. find the minimum no of groups which needs to be deactivated
given string s, and an array arr[] of strings ,
find res[] where res[i] is min length prefix of s which is required to form a permutation of string arr[i]. All char of each string are numeric (0 - 9)
there are n students and there total "talentCount" unique talents. you are given talent[] where talent[i] is talent of ith array. we need to form a group . the group should have continuous students and at least 1 student corresponding to each talent [1, talentCount]
find res[], where res[i] is the minimum student count required to form the group if we start from ith index.
Solved all 3 problems successfully in 30 mins. Never heard back.
Now, I can see the status as Not Selected for this application on their portal.