Loading...
I had two phone screen rounds. In the first round, I was asked to find the optimal path in a grid using BFS, optimizing for both time and cost. It was straightforward, and the interviewer was friendly. In the second round, the question seemed to be one the int...
### Path Existence with Minimum Edge Weight Constraint #### Problem Description You are given an **undirected weighted graph** with `n` nodes labeled from `0` to `n - 1`. - Each edge is represented as `(u, v, w)`, indicating an undirected edge between nodes `u...
The interviewer used a simple grid drawing to explain the storage room setup. The question was Virus Spread in a Storage Room: https://www.chillinterview.com/learn/coding-interview-questions/virus-spread-in-a-storage-room. I was asked to describe how the infec...
The interviewer gave a list of reserved seat sections and asked what the layout looks like after removing one seat. I handled cases where removing a seat shrinks a range, splits a range into two, or removes the whole range. I used sorted intervals and walked t...
- ML problem was related to explaining BERT architecture - How do multi head attention work - What is Learning to Rank framework? - How to evaluate a ranking system
I was given a coding problem that was a variation of Leetcode 1125. The difference is : given skills 1 and 2, each person has 0-2 skills. Select a certain number of people such that at least K people have skills 1 and 2. Each person has a cost. Return an array...
I was asked to implement a `DocumentSearch` class. The constructor takes an array of documents, each with a unique ID and content. The `search` method takes a query string and returns a list of document IDs that contain the query, sorted in ascending order. Th...
The interviewer introduced the prompt as coordinating two robots in a warehouse. The question was Two Delivery Robots Reaching Their Targets: https://www.chillinterview.com/learn/coding-interview-questions/two-delivery-robots-reaching-their-targets. I was aske...