Instacart Software Engineer Interview Questions

instacart full stack take home ai test in onsite interview process

做完OA后，recruiter介绍了oniste流程。onsite1 是2轮真人code面试，一轮take home的AI测试。请问有人做过这个take home的吗？而且我申请的是后端，给了我这个full stack测试，问recruiter,他说就是这个。 请问有人有做过这个吗

instacart tech phone screen experience: karat interview insights

看了很多地里的面经 大家一面都是codesignal OA 就我是karat一面 完全找不到面经... recruiter只告诉我是30分钟system design + 20分钟coding + 10分钟Q&A 面完了两周后收到拒信 非常难受 发个面经作为分享 如果你也是karat一面 希望能帮助到 总体感觉就是 要快快快！ SD和coding都是很简单很简单的题目 不要画时间在clarify和想深入问题上面 主要考察完成度 SD： 设计一个存放asset的storage system, asset 包括text, image, video 只要求画high level design 其他都不需要 不要花时间和他讨论clarify问题 也不要API data model那些 就直接画方块图就可以了 他只要那个流程图 画完后，他随便挑3个component让你解释是干什么用的，你用什么系统，limitation在哪里，有什么优缺点 语速也要快 Coding: 属于有手就会，非常简单 不要想复杂 时间特别紧张 只有20分钟 题目还特别长 我做完第二题还没来得及run就时间到了...

instacart fulltime software engineer onsite interview experience

coding1 decode password，刷过，写的比较快，面试官很 nice，聊了怎么 refactor for prod。 coding2 Find Minimal Shoppers，binary search 套 heap simulation，做出来了。 Karat 那轮极度不爽。面试官推进特别快，AI 吐出来的答案特别长，一下子找不到自己代码了，完全不知道在干什么。 两轮 coding 感觉还好，Karat 就不知道怎么评价了。。。

Interview Experience at Instacart Toronto : Seeking Clearer Feedback After a Positive Process

I recently completed the interview process at Instacart (Toronto), starting with an online assessment, followed by a recruiter call, two coding rounds, a system design round, and a behavioral intervie

#1701 Average Waiting Time

LeetCode #1701: Average Waiting Time. Difficulty: Medium. Topics: Array, Simulation. Asked at Instacart in the last 6 months.

#34 Find First and Last Position of Element in Sorted Array

LeetCode #34: Find First and Last Position of Element in Sorted Array. Difficulty: Medium. Topics: Array, Binary Search. Asked at Instacart in the last 6 months.

#49 Group Anagrams

LeetCode #49: Group Anagrams. Difficulty: Medium. Topics: Array, Hash Table, String, Sorting. Asked at Instacart in the last 6 months.

Design an In-Memory Database with Field-Level TTL, Prefix Scan, and Backup/Restore

Design and implement an **in-memory database** keyed by `key` (unique per record). Each record contains multiple `field -> value` pairs, where both `field` and `value` are strings. Implement the foll

Count Subarrays With Alternating Parity (Odd/Even) Including Negatives

Given an integer array `nums` (may contain negative numbers), count how many **contiguous subarrays** have strictly alternating parity between adjacent elements. Formally, a subarray `nums[l..r]` is

Flip Inner Segment If String Starts and Ends With Vowels

Given an array of strings `arr`, transform each string `s` as follows and return the resulting array: - If both the first and last characters of `s` are vowels, reverse (mirror) the inner substring o

Compute counts on nested maps (Level 1/Level 2 aggregation)

You are given a data structure consisting of nested maps (dictionaries/JSON objects). The data has the notion of “Level 1” and “Level 2” (corresponding to two specific nesting layers). Compute and ou

Bus Boarding Simulation (Priority + Wheelchair Capacity)

Implement a bus boarding simulator with regular riders, priority boarding, and wheelchair constraints. Design and implement functions/classes to support the following (progressive) requirements: ##

Evaluate an Arithmetic Expression

Given a string `expr` representing an arithmetic expression, evaluate it. **Rules** - `expr` contains non-negative integers, operators `+ - * /`, parentheses `(` `)`, and spaces. - Operator precedenc

Decode an Encoded String

Given an encoded string `s` with the rule: - The encoding format is `k[encoded_string]`, meaning `encoded_string` is repeated exactly `k` times. - `k` is a positive integer. - `encoded_string` may it

In-Memory Database with Backup and Restore

## Problem: In-Memory Database with Backup and Restore Design and implement a simplified in-memory database that supports read/write on key-values and also supports **backup** and **restore**. ### D