Recruiter reached out over Linkedin.

No Assesment

Round 1:
Screening Round

Q1: Graph find shortest path
Q2: Follow up with obstacles added

Verdict: Passed

Round 2:
DSA

Q1: Build movie recommendation with given movie graph
having name and rating return list of similar top N movies

(Gave optimal solution and Took hints for space optimzation)

Verdict: Hire/ LH (due to hints taken)

Round 3:

DSA

Q1: Given array of strings group strings
which are buddies to each other 2 strings are
buddy if they have equal length and and each
character has same distance
for e.g.: aab and bbc are buddy

Verdict: Strong Hire

Round 4:
DSA

Q1: given a binary tree and possible path range [lmin, lmax] return true if there is any path with sum of nodes as kSum

similar to

https://leetcode.com/problems/path-sum-iii/description/

Couldn't give optimal solution gave exponential recursive brute force solution.

Solved later with O(h) TC 😒

Verdict: No Hire

Rejected

Any feedback on how to improve is appreciated.