Tech Interview Questions

Software EngineerNew Grad

Simulate a Least-Recently-Used Cache over Get and Put Operations

A cache holds key-value pairs up to a fixed capacity. When it is full and a new key must be added, it evicts the key that was used least recently. Sim...

Coding & AlgorithmsData Structure Design

Find the Single Repeated Value Among n + 1 Integers Drawn from 1 to n

You are given an array nums of n + 1 integers, each between 1 and n inclusive. Because there are more entries than possible values, some value must ap...

Coding & AlgorithmsLinked ListsBinary Search

Machine Learning Engineer Locked

Unrolled Linked List with Insertion-Point Splitting

Implement unrolled-list get and insert with the exact insertion-point split rule, global indices, observable block snapshots, and honest complexity bo...

Coding & AlgorithmsLinked ListsData Structure Design

Software EngineerSenior+

Function-Call LRU Cache: Argument Key Generation and Crash Recovery from a Log

Build an LRU (least recently used) cache that memoizes function calls in Python. When a function is called with arguments whose result is already in t...

Software Engineering FundamentalsData Structure DesignDatabase Internals

Delete a Non-Tail Value through Its Supplied Node

Problem You receive only the node to delete from a singly linked list, not the head. The node is not the tail. Remove its value, reduce the list lengt...

16 people solved

Coding & AlgorithmsData Structure Design

Measure LRU Cache Hits and Misses for an Access Workload

Simulate an LRU cache with hit and miss counters, correct recency updates, bounded capacity, and explicit empty-workload behavior.

Solve 15 common Apple coding questions

The post summarizes high-frequency coding problems reported for Apple Software Engineer interviews. Practice the following algorithm and data-structur...

Coding & AlgorithmsTwo Pointers & Sliding Window

118

875 people solved

Jan 30, 2026

Physical Intelligence

Hard

Software Engineering FundamentalsCachingData Structure Design

Hand-Write a Bounded Cache for a Database-Backed Backend Service

Implement a hand-written, bounded cache in front of a database-backed backend service, including how reads fill it and how writes and deletes invalida...

Coding & AlgorithmsData Structure DesignLinked Lists

Fixed-Capacity Least-Recently-Used Cache Driven by Get and Put Operations

Design a fixed-capacity least-recently-used cache as an object-oriented exercise, driven here by a list of get and put operations whose read results y...

Locate a Cycle Entry without Changing the List

Problem Return the original node at which a singly linked-list cycle begins, or null if there is no cycle. Do not modify the list. A test display may ...

Replace a Range of Nodes in a Linked List with Another Linked List

You are given two singly linked lists, list1 and list2, and two indices i and j. Replace the nodes of list1 numbered i through j (inclusive) with the ...

Software Engineering FundamentalsDebuggingData Structure Design

Backend Engineer Locked

Find Bugs in an LRU Cache

Find the behavioral defects in a Java LRU cache built with LinkedHashMap and provide minimal failing tests. Correct access ordering, update recency, l...

Software Engineering FundamentalsData Structure Design

Track the User with the Most Distinct Contacts: O(1) Query and Top-K for Changing k

Design a class that records undirected messages between users and returns the user who has talked with the most distinct people, then make that query ...

66 people solved

Sep 8, 2026

AmazonGoogleMicrosoft

Software Engineer

Rotate a List Right by a Large Count

Problem Rotate a singly linked list to the right by k positions and return its resulting head. One right rotation moves the last node to the front. Pr...

10 people solved

Indeed

Software Engineering FundamentalsLinked ListsArrays & Strings

Compare Arrays and Linked Lists for Indexed Operations

Compare arrays, linked lists, and unrolled lists across indexed access, insertion, allocation, cache locality, and position-search costs.

Software EngineerSenior+

Implement a Key-Value Map from Scratch Without Built-in Dictionaries

Implement a map (a key-value store) from scratch, without using the language's built-in dictionary, hash map or tree map types. It must support: - put...

Software Engineering FundamentalsData Structure Design

Software EngineerSenior+

Debug a Linked-List LRU Cache That Evicts the Wrong Keys and Crashes

You are handed a fixed-capacity least-recently-used (LRU) cache and asked to debug it. The intended behavior: - LRUCache(capacity) creates a cache tha...

Software Engineering FundamentalsDebuggingData Structure Design

Fixed-Capacity Key-Value Cache That Evicts the Least Recently Used Key

Implement a key-value cache with a fixed capacity. When the cache is full and a new key has to be inserted, the cache evicts the key that was used lea...

Coding & AlgorithmsData Structure DesignLinked Lists

31 people solved

Oct 7, 2026

SnowflakeAmazonGoogle

Hard

Software Engineer

Implement an LFU Cache with LRU Tie-Breaking

Implement a least-frequently-used cache. get(key) returns its value or -1 when absent. put(key,value) inserts or updates an entry. New entries start w...

Coding & AlgorithmsData Structure DesignLinked Lists

23 people solved

AmazonGoogleMicrosoft

Software Engineer

Partition List Nodes Stably around a Threshold

Problem Partition the nodes of a singly linked list around x. Every node with value less than x must precede every node with value greater than or equ...