Pay and Duration
Pay: 1.14L/monthDuration: 8-10 weeks
See this for more questions in this year's Google rounds.
Q1
Straight forward 2D-dp. States: Indexes of the two arraysQ2
See thisQ3
Straight forward Dijkstra. Calculate unique prime factors using sieve (upto 1e3 should work, then see primality of the by division by primes lesser than 1e3), then run a loop for making the edges, since p <=7. Then apply dijkstra.Q4
Maintain a segment tree of the prefix sum, do cost of broken toys = 0 in a query. Find the index whose prefix sum is just than the amt to be paid and subtract the # of broken toys whose index is less than this index to answer the query.More discussions and questions:
<Insert CSEA link>
















