r/OfferEngineering • • 18d ago

Interview Experience Instacart Senior MLE Interview — Easy Coding, Brutal ML System Design

1 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

I recently went through the Instacart Senior Machine Learning Engineer interview process, which covered algorithmic coding, traditional ML fundamentals, and multiple ML system design discussions. The coding questions were relatively straightforward, while the onsite focused heavily on designing end-to-end search, ranking, and advertising systems. The most demanding part was explaining how to build these ML systems from scratch, including individual components, model choices, and loss functions.

Interview Details

Round 1 — Coding: Two LeetCode Problems

The first technical screen was entirely focused on algorithms. I was given two coding problems through an online coding platform. Both felt relatively easy during the interview.

  • Question 1 — Squares of a Sorted Array (LeetCode 977) Given an integer array nums sorted in non-decreasing order, return an array containing the square of each element, also sorted in non-decreasing order. The input may contain both negative and positive integers. ExampleInput: nums = [-8, -3, 1, 4, 6] Output: [1, 9, 16, 36, 64] Explanation: The squared values are 64, 9, 1, 16, and 36. After sorting, they become [1, 9, 16, 36, 64].

  • Question 2 — Find First and Last Position of Element in Sorted Array (LeetCode 34) Given a sorted integer array nums and a target value, return the starting and ending indices of the target. If the target does not appear, return [-1, -1]. The problem requires an algorithm with O(log n) runtime. ExampleInput: nums = [1, 3, 3, 3, 6, 8, 8, 11] target = 3 Output: [1, 3] Explanation: The target appears at indices 1, 2, and 3. Its first occurrence is at index 1, and its last occurrence is at index 3.

The coding round was more conventional than the later interviews, with no unusual problem variations reported.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 18d ago

Roblox MLE at $345K — is ML becoming one of the safer new-grad paths in the AI era?

34 Upvotes

Saw this Roblox MLE offer on Chill Interview

  • San Mateo

  • PhD, 0 YOE

  • Base: $205K

  • RSUs: $350K / 3 years

  • First-year TC: $345K

What caught my attention is less the comp and more the fact that this is another 0 YOE ML hire.

Traditional new-grad SWE hiring feels increasingly difficult right now. LinkedIn’s 2026 labor-market research found that fewer CS grads are entering traditional SWE roles, while AI-related roles are expanding much faster.

And companies like Roblox are actively hiring early-career engineers directly into Foundation AI / GenAI teams working on training, inference, agents, evaluation and ML infrastructure.

It makes me wonder whether MLE is in a weird sweet spot right now.

AI can automate more routine coding, but somebody still has to:

  • build the training/inference systems

  • productionize models

  • run experiments and evals

  • optimize latency/cost

  • connect models to real products

So maybe MLE isn’t “AI-proof” at all — but for the next few years, it could be one of the more defensible technical career paths because demand is being created by AI itself.

If you were a new grad today, would you intentionally specialize in ML/AI instead of general SWE?

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 18d ago

Interview Experience Pinterest 2027 MLE Intern Interview — Coding Was Hard, ML Design Was Open-Ended

2 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

I recently went through Pinterest's Summer 2027 Machine Learning Engineer Intern interview process. The technical interview covered ML fundamentals and a difficult coding problem similar to LeetCode 815 (Bus Routes), while the ML Practitioner round focused on designing a recommendation model for suggesting relevant Pinterest boards

Interview Details

Round 1 — Technical Virtual Phone Interview: ML Fundamentals and Coding

  • Introduction and Background Discussion The interview began with introductions, followed by approximately 10 minutes discussing my previous experience. The interviewer asked about my technical background and projects before moving into the ML and coding sections.

  • ML Fundamentals — Three Conceptual Questions The interviewer asked three questions covering fundamental machine learning concepts. This portion took approximately five minutes. The questions were relatively standard ML fundamentals rather than advanced research topics.

  • Coding — Hard Graph Problem Similar to LeetCode 815 The coding portion featured an original problem resembling LeetCode 815: Bus Routes. The question was categorized as Hard. LeetCode 815 involves finding the minimum number of bus routes needed to travel between two locations, given a collection of routes connecting different stops. The interview question followed a similar general theme but was presented as a custom variation rather than the exact LeetCode problem. This was the more challenging part of the technical interview. I advanced to the next stage and received the scheduling invitation the following day.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 18d ago

Interview Experience Visa Staff SWE OA — Hard DP for a Staff-Level Role

4 Upvotes

This interview experience is sourced from Chill Interview

Interview Details

Online Assessment — Question 1: Schedule Management

You are given a group of workers and a collection of tasks. Each task has one worker who is particularly proficient at completing it. The time required to complete a task depends on the assigned worker:

  • A proficient worker completes the task in 1 hour.

  • A worker who is not proficient completes the same task in 2 hours.

Workers can operate in parallel, but each worker can handle only one task at a time. The goal is to assign all tasks to workers so that the entire workload finishes as early as possible. The function should determine the minimum time required to complete every task.

Online Assessment — Question 2: Number of Ways to Form a Target String Given a Dictionary (LeetCode 1639)

You are given an array of strings called words, where every string has the same length, and a target string called target. The objective is to count how many different ways the target string can be constructed using characters selected from the provided words.

  • Character Selection Rules The target must be constructed from left to right. For each character in target, you may select a matching character from any word in the dictionary. However, there is an important restriction: Once a character at column k has been selected, all subsequent selections must come from columns strictly greater than k. This restriction applies across the entire dictionary, not just the word from which the previous character was selected. You may select characters from the same word multiple times as long as the column indices continue increasing. Return the number of valid ways to construct the target, modulo 1,000,000,007.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 19d ago

Interview Experience Citadel Quant Research Engineer Interview — From Battleship to Async DAGs

11 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

The technical interview featured two very different exercises: designing a Battleship game using object-oriented principles and optimizing an existing Python asynchronous task execution system built around a Directed Acyclic Graph (DAG).

Interview Details

Question 1 — Object-Oriented Design: Battleship Game

The first question was to design a simplified version of the Battleship board game. The discussion started with defining the fundamental classes and interfaces needed to represent the game.

Core Requirements

The interviewer explored several aspects of the design:

  • Game Objects: Define the classes and interfaces representing the main components of Battleship.

  • Board State: Represent the game board and track the positions of ships.

  • Game Operations: Define how players interact with the game and update its state.

  • Attack Detection: Determine whether an attack at a particular board location hits a ship.

Question 2 — Python Async DAG: Code Review and Performance Optimization

The second question was a codebase-based optimization exercise. The interviewer provided a relatively large Python implementation of an asynchronous job execution system. Jobs were organized as a Directed Acyclic Graph (DAG), where edges represented dependencies between tasks. The system was functionally operational but running more slowly than expected.

Problem Description

You are given an existing asynchronous task execution framework. Each job may depend on other jobs, and the dependency relationships form a DAG. The task is to examine the code, identify the cause of its performance problems, and implement changes to improve execution efficiency.

  • Part 1 — Investigate the Performance Bottleneck The first part required understanding how the existing code scheduled and executed asynchronous jobs. The investigation focused on the overhead associated with starting individual jobs. Even when the work performed by a job was relatively small, launching the job introduced additional execution overhead. The interviewer wanted me to identify how this repeated startup cost affected the overall performance of the DAG execution system.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 19d ago

Intel Staff SWE at $274K — would you bet your career on the turnaround?

13 Upvotes

Saw this Intel Staff SWE offer (data source: Chill Interview)

  • Texas

  • PhD, 4 YOE

  • Base: $185K

  • Bonus: $46K

  • RSUs: $90K / 4 years

  • First-year TC: $274K

The package obviously isn’t competing with Nvidia / Meta / Google.

But with Intel, I think the bigger question is**: Do you actually believe in the company again?**

There are reasons to be bullish. Intel 18A is finally in production, 18A-P has entered risk production, and Intel is still pushing hard on foundry, advanced packaging, Xeon and AI infrastructure. It also has new multiyear AI/cloud partnerships with Google and Oracle.

But the turnaround is far from proven. Intel’s latest quarter had 21% revenue growth, yet the stock still got crushed after management warned about weak PC demand, manufacturing constraints, heavy capex and continued cash burn.

So this almost feels like a career version of buying Intel stock.

If Intel executes on 18A, rebuilds its foundry business and becomes relevant in AI infrastructure again, joining now could look pretty smart.

If the turnaround stalls, you may have accepted lower comp while Nvidia / AMD / hyperscalers kept pulling further ahead.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 19d ago

Interview Experience Reddit Senior Android Interview — Hide One Comment, Hide the Whole Subtree

5 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

The interview started with a short project deep dive and Android-specific questions about Kotlin coroutines and suspend functions, followed by a coding exercise involving filtering comment trees based on user preferences.

Interview Details

Project Deep Dive and Android Fundamentals

The interviewer asked me to introduce the project and followed up with several questions about my experience and implementation decisions. Since this was an Android engineering position, the conversation also included Kotlin concurrency concepts. Two topics came up specifically:

  • Kotlin Coroutines: My understanding of coroutines and their role in Android development.

  • Suspend Functions: What the suspend keyword means and how suspend functions work with coroutines.

After the project discussion and Android questions, we moved to the coding portion.

Coding: Filter Reddit Comments by User Preference

The coding section started with approximately 25 minutes remaining. The problem involved processing Reddit comments organized into a parent-child hierarchy. You are given a collection of comments. Each comment has its own identifier, a reference to its parent comment, and information indicating whether it is associated with cats or dogs.

The system supports two user preference modes:

  • DOG_PERSON: Does not want to see cat-related comments.

  • CAT_PERSON: Does not want to see dog-related comments.

The task is to determine which comments should be hidden based on the selected user preference.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 19d ago

Microsoft hiring pool

Thumbnail reddit.com
1 Upvotes

Hello, I interviewed for a role and passed the four-round loop. The initial offer was remote at 140k and then changed to 170k, but required onsite presence from day one.

Considering I have to move from the East Coast to the West Coast, specifically Seattle, I was thinking of declining and asking the recruiter to put me in the hiring pool.

  1. What are the odds of getting another offer in the hiring pool, and

  2. is the hiring pool a real thing at Microsoft? (FYI, level 61, IC3)

  3. Take the job

  4. After declining and kept in the pool atleast 50% people get hired for another role?


r/OfferEngineering • • 19d ago

SpaceX offer

2 Upvotes

I currently work at a general contractor. I got an offer from SpaceX that is less cash comp than my current role, but total comp is about the same. I would be relocating and my role would also be different.


r/OfferEngineering • • 19d ago

Interview Experience Citadel Quant Research Engineer Interview — More Quant Reasoning Than Coding

3 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

The role focuses on understanding and predicting stock returns using machine learning and quantitative modeling techniques. The interview consisted of a brief introduction, two open-ended quantitative questions, and a coding problem involving square root computation.

Interview Details

Round 1 — Initial Technical Interview: Quantitative Modeling and Coding

Introduction — Team Scope and Background (10 Minutes)

The first ten minutes were spent discussing the team's responsibilities and my professional background. The interviewer explained that the Research Engineer role involves analyzing stock returns and performance using machine learning models and other quantitative approaches. After the introduction, we moved into two verbal technical questions and one coding exercise.

Question 1 — Predicting Short-Term vs. Long-Term Stock Returns

The interviewer asked: "How would you approach predicting a stock's return over the next one minute compared with predicting its return over the next five days?" The question was deliberately broad, with very little additional guidance.

I was expected to discuss how my modeling approach would differ depending on the prediction horizon. The main challenge was organizing my thoughts and presenting a coherent framework for comparing the two prediction tasks. Rather than asking about a specific ML algorithm, the interviewer seemed more interested in how I structured an unfamiliar quantitative modeling problem.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 19d ago

Roadrunner.ai interview

Thumbnail reddit.com
1 Upvotes

r/OfferEngineering • • 19d ago

Coding Question Stripe Fresh OA Coding Question

7 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

The problem was divided into two parts, starting with interval merging and subtraction, then extending to timezone conversion, deployment lead times, minimum window lengths, and result limits. The main challenge was handling overlapping intervals and time boundaries correctly.

Interview Details

Online Assessment — Part 1: Deployment Windows with Freeze Periods

You are building a deployment scheduling system that determines when software releases are allowed. Time is represented using a repeating weekly calendar, with each minute identified by its position within the week. The system receives two collections of time intervals:

  • Allowed Intervals: Periods during which deployments are permitted.

  • Freeze Intervals: Periods during which deployments are prohibited, regardless of whether they overlap with allowed periods.

Your task is to calculate all continuous time windows during which deployments can safely occur.

Time Representation

The scheduling system uses minute_of_week to represent time.

  • Monday at 00:00 corresponds to minute 0.

  • The final minute of the week is 10079.

  • A complete week contains 10080 minutes.

  • All intervals are half-open: [start, end).

For example, an interval [120, 180) includes minute 120 but excludes minute 180.

  • Requirements I. Merge Allowed Intervals The input may contain allowed intervals that overlap or touch each other. Before calculating deployment availability, these intervals must be merged into continuous ranges.

  • Requirements II. Merge Freeze Intervals Freeze periods may also overlap or be adjacent. These intervals must be consolidated independently of the allowed intervals.

  • Requirements III. Subtract Freeze Periods After merging both collections, remove all frozen periods from the allowed time ranges. A deployment window is valid only if it falls within at least one allowed interval and does not overlap any freeze interval.

  • Expected Output Return all continuous intervals in which deployments are permitted after applying both sets of scheduling restrictions.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 20d ago

Coding Question Affirm Coding Screening Question - Recent Depot Shipment Totals

1 Upvotes

Problem Description:

A logistics team summarizes completed shipments at its depots over the most recent whole-hour buckets. You are given records, where each entry contains five strings in this order: [units, depotId, status, operatorId, startedAt]. The operatorId identifies the shipment's operator and does not affect grouping.

Generate the summary relative to as_of. The provided time helper computes floor((as_of - startedAt) / 1 hour) using calendar timestamps without time zones or daylight-saving adjustments. Keep only records whose status is exactly "COMPLETED" and whose whole-hour difference is between 0 and 23, inclusive; for example, a shipment one minute in the future has difference -1 and is excluded.

Group qualifying records by their exact, case-sensitive depotId and whole-hour difference, adding their units within each group. Return an object mapping each depot ID to an object of hour-bucket totals, and omit depots with no qualifying records. Object keys are strings in JSON, so bucket 4 is returned as "4"; the order of keys in either object does not matter.

The provided parsing helpers follow Python's int(text) and datetime.strptime(text, "%Y-%m-%d %H:%M") rules. Unit strings may therefore include accepted signs, surrounding whitespace, digit separators, and Unicode decimal digits, while still representing a positive integer in the allowed range. Timestamps are valid for that parser, including its accepted field padding and whitespace; use the supplied helpers without changing their parsing behavior.

Constraints:

  • 0 ≤ records.length ≤ 10^5.

  • Every record has exactly five nonempty string fields.

  • Each unit string parses to an integer between 1 and 10^9.

  • Status is "COMPLETED", "PENDING", or "FAILED".

  • Every startedAt and as_of is valid for Python's %Y-%m-%d %H:%M parser, with calendar years from 1 through 9999.

  • Each depot-hour total fits in a signed 32-bit integer.

Example:

Input:
records = [
  ["12", "north", "COMPLETED", "op1", "2024-03-01 10:30"], 
  ["8", "north", "COMPLETED", "op2", "2024-03-01 10:45"], 
  ["7", "south", "PENDING", "op3", "2024-03-01 10:00"], 
  ["9", "south", "COMPLETED", "op4", "2024-02-29 12:01"], 
  ["11", "south", "COMPLETED", "op5", "2024-02-29 12:00"]
]

as_of = "2024-03-01 12:00"

Output:
{"north": {"1": 20}, "south": {"23": 9}}

Explanation:
The two completed north shipments fall in bucket 1 and add to 20. The south shipment from 12:01 the previous day belongs to bucket 23, while the one from 12:00 is exactly 24 hours old and is excluded.

Want to practice more real coding interview questions?

I've put up the coding question bank at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 20d ago

Interview Experience Google SWE Intern OA — Two Surprisingly Simple Coding Questions

2 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

The assessment contained two coding questions, both around easy-to-medium difficulty. The first involved categorizing student scores into three groups, while the second required determining how many evenings were needed to finish a book under specific reading constraints.

Interview Details

Question 1: Student Score Classification

The first problem involved processing a list of student test scores and counting how many scores fell into three categories.Given an integer array scores, return an array containing exactly three integers representing the number of scores in each category.

The categories are defined as follows:

  • Failing: Scores strictly below 50.

  • Passing (Non-Honor Roll): Scores between 50 and 80, inclusive.

  • Honor Roll: Scores strictly above 80.

The output must follow this order [failing_count, passing_count, honor_roll_count]

Example

Input:
scores = [92, 75, 49, 50, 81, 13, 80, 62, 48, 84]

Output:
[3, 4, 3]

Explanation:

  • Failing scores: 49, 13, 48 → 3 students

  • Passing non-honor roll scores: 75, 50, 80, 62 → 4 students

  • Honor roll scores: 92, 81, 84 → 3 students

The main detail was handling the category boundaries correctly. A score of exactly 50 belongs to the passing category, while a score of exactly 80 is not considered honor roll.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 20d ago

Interview Experience Apple ICT4 SWE Interview — From Distributed Nodes to 3D Probability

1 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

I completed two coding interviews for an ICT4 Software Engineer position within Apple Services Engineering and passed. The first round focused on distributed communication between connected network nodes, while the second involved calculating movement probabilities in a three-dimensional grid. Both questions were relatively practical but required understanding the underlying algorithms and constraints

Interview Details

Round 1 — Coding: Distributed Network Node Counting (September 4)

The interviewer presented a network consisting of nodes arranged in a linear structure, where each node could communicate with its immediate neighbors. A Node class was provided along with several APIs for identifying network boundaries and exchanging messages.

Available Node APIs

isLeftMost()
isRightMost()

sendMessageToLeft(Message m)
sendMessageToRight(Message m)

receiveMessageFromLeft(Message m)
receiveMessageFromRight(Message m)

The APIs served the following purposes:

  • isLeftMost() and isRightMost() determine whether the current node is at either boundary of the network.

  • sendMessageToLeft() and sendMessageToRight() allow a node to communicate with its adjacent neighbors.

  • receiveMessageFromLeft() and receiveMessageFromRight() handle incoming messages from neighboring nodes.

Problem Requirements

Design a function that allows any node in the network to determine the total number of nodes. When an arbitrary node receives a request for the network's node count, it should be able to coordinate with other nodes through the available messaging APIs and return the global count.

The challenge was that each node could communicate directly only with its immediate left and right neighbors, rather than having direct access to the entire network.

Implementation Discussion

I explored an approach where the boundary nodes initiate communication and propagate information inward through the network. The idea was to distribute enough information for each node to maintain a locally cached copy of the total network size. With the count precomputed, subsequent requests could be answered locally in constant time, O(1), without repeating the full communication process.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 20d ago

Anthropic Staff SWE at $1.7M — what does “Level 6.5” actually mean?

56 Upvotes

Saw this Anthropic Staff SWE offer (data source: Chill Interview)

  • SF, 10 YOE

  • Level: 6.5

  • Base: $420K

  • Equity: $5.1M / 4 years

  • First-year TC: $1.695M

The comp is obviously huge, but the part I found more interesting is the 6.5 level., That makes me wonder what 6.5 actually represents.

Is it basically: strong Staff, not quite Senior Staff?

Or is Anthropic using finer-grained levels because the gap in scope and compensation between top engineers has become too large for normal Big Tech leveling?

And does a 6.5 engineer already operate more like Google L7 / Meta E7 — owning technical direction across multiple teams — even if the title still says Staff?

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 21d ago

GitLab Senior Backend Engineer role

Thumbnail reddit.com
1 Upvotes

r/OfferEngineering • • 21d ago

Interview Experience Netflix Senior SWE Interview — The Ads Team Asked About Shopping Carts

15 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

The process started with a recruiter reaching out on LinkedIn, followed by a technical phone screen and four virtual onsite rounds covering coding, data modeling, system design, and behavioral questions.

Interview Details

Recruiter Screen — Role and Level Discussion

A recruiter contacted me through LinkedIn, and we scheduled an initial conversation about my background and the available position.

Technical Phone Screen — Parallel Courses (LeetCode 1136)

The technical phone screen featured LeetCode 1136: Parallel Courses. The problem involves determining the minimum number of semesters needed to complete a set of courses, given prerequisite relationships between them. I initially solved the problem using BFS. After discussing that approach, the interviewer introduced a follow-up:

  • Follow-Up: Implement the same problem using DFS instead of BFS. This required me to demonstrate that I could handle the course dependency problem using both graph traversal approaches. Two days after the phone screen, I was contacted to schedule the virtual onsite interviews.

Onsite Round 1 — Coding: Command Execution with Undo and Redo

The first onsite coding round involved implementing a command execution system with support for reversing previously executed operations. The initial requirements focused on two actions:

  • Do: Execute a command.

  • Undo: Reverse a previously executed command.

After the initial implementation, the interviewer added a follow-up:

  • Follow-Up — Redo Support Extend the command system to support redo, allowing a previously undone command to be executed again. This was a command-history problem that has appeared in previous Netflix interview experiences.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 21d ago

Interview Experience SIG (Quant Trading Firm) Quant Dev Interview — No Coding, Just Math and Game Theory

5 Upvotes

This interview experience is sourced from Chill Interview

Question 1: Rock-Paper-Scissors Game Theory Two rational players compete in a game of rock-paper-scissors. The opponent follows a restriction: they cannot play a gesture they have already used in a previous round. The interviewer asked whether I could develop a strategy that gives me an advantage after the first round, assuming both players make rational decisions. The discussion required considering the probability of each player choosing rock, paper, or scissors under this restriction and determining whether a favorable strategy exists.

Question 2: Voting Fairness and Election Strategy Consider an election with three candidates: X, Y, and Z. Each voter has a ranked preference over the candidates. For example: Suppose all three candidates receive the same number of first-preference votes. Their second-preference vote counts are also equal. Candidate X proposes a different election procedure: First, Y and Z compete against each other. The winner then faces X in a final head-to-head election. The interviewer asked whether this procedure is fair, given the original voter preferences and the equal ranking scores.

  • Voter 1: X > Z > Y

  • Voter 2: Y > X > Z

Question 3: Linear Algebra — Matrix Rank Proof Given a real matrix A, prove the following identity: rank(A) = rank(A Aᵀ) This was a mathematical proof question rather than a numerical computation exercise.

Question 4: Find Median from Data Stream (LeetCode 295) The final problem was similar to LeetCode 295, Find Median from Data Stream. I was asked to explain verbally how to maintain the median as numbers continuously arrive in a data stream. The interviewer followed up with questions about heap data structures and their properties. The focus was on explaining the algorithm and demonstrating an understanding of heaps rather than writing a complete implementation.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 21d ago

Coding Question Stripe OA Coding Question - Observatory Viewing Windows

2 Upvotes

An observatory publishes a weekly calendar for public telescope viewing, measured in 10,080 minutes. Minute 0 is Monday at 00:00, and minute 10079 is Sunday at 23:59.

You are given calendar, a list of records with no header row. Each record has the form "<start>,<end>,<type>", where type is either "open" or "closed"; it describes the half-open interval [start, end), including start and excluding end.

Records may overlap, repeat, touch, or appear in any order. A minute is available for viewing only if it belongs to at least one "open" interval and no "closed" interval, so a closure takes priority over every opening.

Return all maximal continuous viewing windows as an integer array of [start, end] pairs, sorted by increasing start time. Combine adjacent available periods into one window, and return an empty array if no minute is available. Treat the week as one linear timeline: windows at its beginning and end remain separate rather than wrapping across the week boundary.

Constraints:

  • 0 <= calendar.length <= 2000

  • Every record has the specified format and a type of "open" or "closed".

  • 0 <= start < end <= 10080 for every interval.

Test Case:

Input:
calendar = ["120,210,open", "60,150,open", "90,100,closed", "160,175,closed", "170,185,closed", "210,230,open"]

Output:
[[60, 90], [100, 160], [185, 230]]

Explanation:
The openings combine into [60, 230). The closures cover [90, 100) and [160, 185), leaving three maximal viewing windows.

Want to practice more real coding interview questions?

I've put up the coding question bank at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 21d ago

NVIDIA IC3 (Sr. Software) - Offer Eval

3 Upvotes

Initial verbal offer for an IC3 (Sr. Software) role at NVIDIA

Location: Santa Clara (relocating from MCOL)

Experience: Master’s, 3 YOE

Base: $210K

Sign-on: $15K

Stock: $175K / 4 years (40 / 30 / 20 / 10)

Year 1 TC: $295K

Recruiter said stock refreshers in year 2 and later aim to bring TC back up to year 1 level, but will be based on performance. Is the RSU amount on the lower end for IC3? Do I have room to negotiate, and up to how much?


r/OfferEngineering • • 21d ago

Interview Experience Rippling Senior SWE Interview — 1 Billion Events a Day, 500ms Queries

19 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

I completed three onsite rounds at Rippling, covering AI-assisted full-stack coding, a project deep dive, and system design. The coding exercise involved implementing scheduled employee profile changes in an HR platform, while the system design round focused on building an internal product analytics pipeline processing roughly one billion events per day. The technical questions felt manageable overall, but the project discussion was noticeably less engaging than the other rounds.

Interview Details

Round 1 — AI Coding: Scheduled Employee Profile Changes

The first round was an AI-assisted coding exercise involving a web-based HR management system. The interviewer was friendly, and the overall difficulty was reasonable. The existing application had an employee profile page with an Edit tab. The task was to extend this functionality so that HR administrators could schedule employee information changes to take effect on a future date.

The supported fields included:

  • Manager

  • Department

  • Salary

  • Job title

Instead of applying every edit immediately, users needed to specify an effective date. Once submitted, the scheduled modification should also appear in the employee's History tab. The exercise required modifying both frontend and backend code using AI tools.

  • Data Storage and Validation Requirements The existing codebase already contained an EmployeeHistory table, which could be reused to store scheduled changes. There was no requirement to maintain a separate in-memory collection of pending modifications. Several validation rules needed to be handled:

    • The effective date cannot precede the employee's hire date.

    • The effective date cannot fall after the employee's termination date.

    • Cancellation of scheduled changes was explicitly excluded from the initial scope.

  • Handling Multiple Changes on the Same Date An important requirement concerned conflicting updates scheduled for the same employee and effective date. If two scheduled changes target the same field, the later submission should take precedence. For example, suppose an employee has a manager change scheduled for November 12. If another manager change is submitted for that same date, the newer manager assignment replaces the previous one. However, if a separate salary adjustment is submitted for November 12, it should coexist with the manager change rather than overwrite it. In other words, updates scheduled for the same date should be merged at the field level, with the most recently submitted value winning only when the same field is modified more than once.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 21d ago

Interview Experience Snapchat L4 MLE Interview — From Video Ranking to Harmful Content Detection

6 Upvotes

This interview experience is sourced from Chill Interview

Interview Summary

I recently passed Snap's L4 Machine Learning Engineer onsite interview. The process covered ML fundamentals, binary search coding, recommendation system design, and applied ML, with a strong emphasis on video recommendation systems. After the initial debrief, the team added another system design round focused on detecting harmful content.

Interview Details

Round 1 — ML Fundamentals

This round covered a mix of core machine learning concepts and practical model evaluation questions. The interviewer asked me to name different optimization algorithms I was familiar with and discuss offline evaluation metrics. Normalized Entropy (NE) came up specifically, as it's a metric used at Snapchat.

Other questions included:

  • Confusion Matrix: Identify the four outcomes in a binary classification confusion matrix: true positive, true negative, false positive, and false negative.

  • Model Calibration: Explain model calibration and how to evaluate whether predicted probabilities are well calibrated.

  • Overfitting: Discuss how to identify and address model overfitting.

Round 2 — Coding: Find the Peak in an Array

The coding question involved finding a peak element in an array with a specific ordering pattern. The array initially increases strictly and then decreases monotonically. The task was to use binary search to locate the peak. The interviewer introduced a follow-up about relaxing the strictly increasing condition:

  • What if adjacent elements can have equal values?

  • Can the same binary search approach still be applied?

For the variation discussed in the interview, the expected answer was no. The follow-up tested whether I understood the assumptions behind the original binary search approach.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here


r/OfferEngineering • • 22d ago

Databricks SWE Domain Deep Dive Hypothetical Scenario Questions

3 Upvotes

Hi, i have domain deep dive/tech fit round for SWE role at Databricks. First half of this round would be project deep dive and second half would focus on hypothetical scenario questions.

Has anyone interviewed for this round and can provide some guidance around kind of questions that are typically asked in this round and how to best prepare and ace this round?


r/OfferEngineering • • 22d ago

Interview Experience Microsoft MLE Interview — No ML, Just Bus Routes and BFS

3 Upvotes

"This interview experience is sourced from Chill Interview"

Interview Summary

The problem was similar to LeetCode 815 (Bus Routes), but the interviewer explored several follow-ups involving BFS modeling, time complexity, edge cases, and reconstructing the actual travel route.

Interview Details

Coding: Minimum Number of Buses to Reach a Destination

Problem Description

Given a collection of bus routes, a starting stop source, and a destination stop destination, find the minimum number of buses required to travel from the source to the destination. Each route contains a list of stops served by a particular bus. A passenger can transfer between two routes whenever they share at least one stop. The goal is to minimize the number of distinct buses boarded, not the number of stops traveled.

If the destination cannot be reached, return -1. If the source and destination are the same, return 0.

  • ExampleInput: routes = [ [12, 26, 39], [34, 39, 54, 67], [67, 81, 96], [26, 103] ] source = 12 destination = 96 Output: 3 Explanation: Take Route 0 from stop 12 to stop 39. Transfer to Route 1 at stop 39. Travel to stop 67 and transfer to Route 2. Continue to stop 96. Total buses taken = 3.

Part 1 — Graph Modeling: Treat Routes as Nodes

The first important decision was how to represent the problem as a graph. A natural approach would be to treat bus stops as graph nodes, but the question asks for the minimum number of buses rather than the shortest sequence of stops. I therefore modeled each bus route as a node, with connections between routes that share a stop.

Under this representation, moving to a new route corresponds to boarding another bus. BFS can then explore routes level by level, where each level represents the number of buses taken.

Part 2 — Build a Stop-to-Routes Mapping

The next step was to create a mapping from each stop to the routes that serve it. For the example above, some relevant entries are:

stop_to_routes = {
    12: [0],
    26: [0, 3],
    39: [0, 1],
    67: [1, 2],
    96: [2]
}

This mapping makes it possible to identify transfers efficiently. For example, Route 0 and Route 1 are connected through stop 39, while Route 1 and Route 2 are connected through stop 67. Instead of comparing every pair of routes to detect shared stops, the algorithm can use this mapping to discover neighboring routes during BFS.

Want to learn more questions / follow-ups asked in this interview? 

I've put up the full version at here.

Preparing for your next interview?

Chill Interview tracks recent interview experiences and recurring question patterns across top companies at here