C3 AI interview question
Hackerrank questions: 1) Sort by frequency then value (LC medium/easy?) 2) Leetcode 1220 (LC hard) 3) Photo album (LC easy) Interview 1: 1) Calculate price of items given it's materials needed, the quantity needed, and price of the material. Interview 2: First interviewer: Can you make it through all the gas stations around once? How can you improve it? Second Interviewer: Questions: Talk about previous work and comments on it. Where you want to be, why work here, and etc. Solve: Given a 2-player game, determine if 1st player has a forced win Third Interviewer: Design a library that allows users to checkout a book up to 3 times and other small constraints.
Interview Answer
Anonymous
Hackerrank questions: 1) Sort the data based on the given criteria (not hard) 2) Used dynamic programming of previous results 3) Used an arraylist and it's given methods Interview 1: Recursive calculate the price of the other items needed based on quantity and price of materials. Can use memoization to improve performance if there is future queries on that data (but was not the case). Interview 2: 1) Brute forced nested for loop. Improved it by solving accumulated data reducing extra work. Better solution: find the running sum, find inflexion point, and return that index (I did not solve but was close) 2) Went through a recursive brute force approach (missed a recursive check) 3) Used OOP and represented each entity with corresponding objects.