### Phone Screen The phone screen consisted of a 30-minute discussion about my projects, followed by a coding question. The question involved being given a set of coordinates representing train stations, where each horizontal, vertical, and diagonal direction...
Showing 51-60 of 83 forum items
I applied through a referral and the process was slow. ### OA: 1. Longest Palindromic Substring. 2. Given a set of points in a 2D plane, if points are in the same row or column and the distance is less than d, they are connected. Connectivity is transitive. Ho...
I interviewed with Uber for a Software Engineer position. The process started with an Online Assessment consisting of two questions. The first was a binary search problem (similar to an elevator problem), and the second was about server throughput, which I sol...
I was asked a variation of the classic word search problem: Given a 2D character matrix and a word, determine if the word exists in the matrix. Unlike the classic Word Search: * It supports 8 directions (up, down, left, right + four diagonals). * Once the star...
I had a technical phone screen with an interviewer who seemed nice. We started with some casual conversation. The interview consisted of two coding questions and a brief discussion about vibe coding at the end. **Question 1:** Given a list of intervals, find t...
## Problem Description You are given an array of **distinct positive integers** called `nums`, along with a positive integer `target`. Determine whether it is possible to select **some elements** from `nums` (each element can be used **at most once**) such tha...
The coding questions were relatively straightforward. I needed to implement the Node class myself. **My approach:** 1. For the first problem, I used a simple recursive approach to sum the node values. 2. For the second problem, I used a recursive approach to f...
The HackerRank round consisted of two questions that required optimization to pass all test cases. **Question 1:** Given a permutation list and a value k, return true if, within the range of k, each value's corresponding permutation can be found as a subset in...
The problem involved multiple services that can be scaled up multiple times. Each scaling increases throughput but also increases costs. The input to the (i+1)th service comes from the ith service. The goal is to maximize throughput without exceeding a total b...
The interviewer introduced the problem as an infrastructure scheduling scenario. The question was Server Backup Scheduling: https://www.chillinterview.com/learn/coding-interview-questions/server-backup-scheduling. I was given backup jobs and timing constraints...
