Phone Screening

Given N cpus and time taken to finish each of M tasks, find minimum time to finish all tasks. One CPU can only execte one task at a time, no cooldown involved. Follow up: Suppose you find the minimum time, what is the least no of CPUs you can use to achieve that minimum time.

Solution

Given a heap based solution, Interviewer later asked if you really need heap. I then solved using array. For follow up, I used binary search to call the function

Verdict: Cleared

DSA Round

Given N X M grid of dots, what is the Number of unlock patterns having length atleast L. You are only alowed start anywhere and visit neighbours (up, down, right, left and 4 diagonals), whichever available and unvisited. You can't jump over visited dot.

Follow up: Add linear optimisation

Solution

Gave Backtracking based solution, for Optimisation, made it 4x faster using vertical and hotizontal symmetery

AI/ML Round

Given two array of integers, find out in which array a given query integer should lie.

Solution

Gave clustering based solution, later optimised for variance by considering distance from existing data points.

GnL round

Basic Situational questions, Wrapped up in 30 min

Verdict: SH,H,H

Current status

Will be arranged team matching rounds and then managers will push to HC. Feeling rejected already.