R1 : Phone Screen The interview started with a few questions about my resume and previous projects. Q1: Implement a rate limiter, what algorithms would you use & when. Q2: Given a series of opening and closing parenthesis, return if it is a valid seque...

Question was structured differently with a real life example. Searching across different categories in amazon website. Underlying pattern was merge K lists. Interviewer probed for edge cases, optimal solution, etc

What do you think is the most pressing issue in AI safety?

We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. You're given the startTime, endTime and profit arrays, return the maximum profit you can take such that there are no two jobs in t...

Question 1 — Search Insert Position ✅ Completed Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. Question 2 — Non-overl...

Straight Flush Detection Problem Description You are given a set of poker cards drawn from a standard 52-card deck (jokers removed). Each card is represented by a string consisting of its suit followed by its rank. Suits are represented by a single cha...

Process CSV file with business name rows, given some rules and identify each row is valid or not

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct...

first round (30 min behavioral + 30 min coding) just 2 lp questions + 2-3 follow ups (it was ok) 1 easy-med low level design question (i did bad on this) I explained my approach towards this problem. When I was implementing, he told me that my approach...

For a given array remove the duplicates and sort them in ascending order Additional submission details: Test cases: same letter number etc Multiple parts or follow-ups: No

Assume you are given users in a video game, create and manage their inventory. Also, print all the inventory operations for the user : UserA added Apple*2 UserB added Banana*2

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edg...

HR screening round: Ask for my past experience and what i learnt from my undergrad.

Implement URL shortner

Microsoft SDE Interview Experience (2026) – Backend Coding Round Role: Software Engineer II (Backend) Round: Coding + LLD (60 minutes) Question: Design a Resilient Notification Dispatcher You are asked to design an in-memory notification service that...

Asked to build Chess game from scratch.

It gave sku units got from upstream, and have limited cache to store them. Basically it was LRU cache. Additional submission details: Test cases: Standard LRU cache test cases Multiple parts or follow-ups: Optimization, concurrency

Question: Minimum Time for Drone Delivery on a Circular Route Amazon has a circular network of m hubs labeled 1..m, where hub 1 is adjacent to hub m. A drone can move from any hub to either adjacent hub (clockwise or counterclockwise). You are given a ...

I recently interviewed for a Senior Software Engineer role at Capital One and received & accepted the offer. Here’s my interview experience: Online Assessment (HackerRank) Platform: HackerRank Format: 4 coding questions Difficulty: Easy to Medium The...



Did you get promoted during your tenure? Additional submission details: Test cases: Why Stripe and why are you leaving your current company Multiple parts or follow-ups: No

I recently discussed a classic iterator-merge problem: Problem Given two strictly sorted iterators, create a new iterator that returns all values in sorted order, while deduplicating values that appear in both iterators. Example Iterator 1: [2, 4, 6, 8...

Given two nodes in a binary tree, find the lowest common ancestor. Additional submission details: Test cases: Had to come up with my own Multiple parts or follow-ups: Yes, one follow up - one of the nodes can be ancestor of the other

Design a stack data structure that supports all standard stack operations while also allowing retrieval of the minimum element currently present in the stack. Implement the MinStack class with the following methods: MinStack() – Initializes an empty ...

Design excel sheet. Two main functions: set(cell, value/expression) print() -> should print both raw and computed values. Example: set(A1, "=5+9+-8") set(A2, "5") Only +,- and in case of -, + would be preceding which made it easier to split. This was t...