Software Engineer · Senior-Level (9 YOE)
Location: RemoteReport date: May 1, 2026
05
Loading...
I encountered a coding question similar to Leetcode 689, but with three different parameters represented by 'k'. The 2nd problem involved applying Dijkstra's algorithm on a directed weighted graph.
I interviewed for a Frontend Engineer position. The recruiter scheduled two back-to-back interview rounds on the same day. **Round 1: Frontend Coding** I was asked to build a frontend component for streaming text from an AI. It involved a simple input box, a s...
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...
I was asked to find the most time-efficient route between a start and destination in a 2D matrix, given four different modes of transportation represented by 1, 2, 3, and 4. Each mode has a specific time and cost associated with it. The goal was to find the ro...
I was asked to implement a snapshot set iterator. The problem stated that the return order was not important. I described that I would need a list of logs and a dictionary, and explained my general approach. The interviewer then asked if I could think of anoth...
I was asked to implement a multithreaded latency tracker with two functions: ``` setLatency(long timestamp, double latency) getP99Latency(long windowSize) ```
I interviewed for a Software Engineer role. I think I failed the interview, but I will share my experience anyway... **Round 1: Coding** I was given 'n' players with unique rankings from 1 to n. A higher-ranked player always wins against a lower-ranked player,...
The problem involved a 2D array representing different factories. Each row represented a factory type, and each element within a row represented an individual factory of that type. Each element contained two values: the distance from the origin and the cost of...
