I was given a list of stores: `["McDonald's", "KFC", "Burger king", "Bites", "Biscuit shop"]`. I needed to implement an `autocomplete` method that takes a string `s` as input and returns a list of stores that start with `s`. For example, `autocomplete("B")` sh...
Showing 1-10 of 101 forum items
The phone screen started with a 5-minute self-introduction, followed by a 20-minute coding problem. Then, I had a 30-minute deep dive into a project I had worked on, where I was challenged extensively. The interview concluded with a 5-minute Q&A session. The f...
I had an onsite interview with Uber. The rounds covered a range of topics: **Round 1: Coding** The coding question involved a one-dimensional array of infected houses. There are multiple sources of infection, and each day the infection spreads to immediate nei...
I had an onsite interview at Uber for a Machine Learning Engineer position. Here's a breakdown of my experience: **Round 1: Hiring Manager (Behavioral)** This round consisted of standard behavioral questions. **Round 2: Coding** I was given a non-LeetCode codi...
I had four rounds of interviews. - Round 1: I was asked coding questions (LeetCode 593, 514, 7). - Round 2: I was asked to manually implement Linear Regression and Logistic Regression, and make them runnable. - Round 3: I had a behavioral discussion with the h...
The interviewer introduced the problem as a route-planning game with special warp moves. The question was Maximum Gem Collection with Prime-Length Warps: https://www.chillinterview.com/learn/coding-interview-questions/maximum-gem-collection-with-prime-length-w...
The interview began with introductions, followed by a request to describe a recent, representative project. I discussed a GenAI/agent-related project, covering the business context, system design, model/data pipeline, evaluation, and post-launch tradeoffs. The...
I had 90 minutes to complete two coding questions: **Question 1: Balanced Numbers** Given a permutation array of 1-N. Determine if, for each given length k (1-N), the k elements in the permutation with values in the range 1~k are continuously distributed in th...
### 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...
