How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Implement cache and merge intervals | Microsoft Interview Question

Q: Implement cache and merge intervals

This question evaluates proficiency in designing and implementing efficient data structures (a fixed-capacity LRU key-value cache) and interval-processing algorithms (merging overlapping closed intervals), emphasizing time-complexity constraints, correct state management, and robustness to edge cases within the Coding & Algorithms category.

Microsoft

Feb 23, 2026, 12:00 AM

Machine Learning Engineer

Onsite

Coding & Algorithms

1

0

Loading...

The interview included two coding tasks:

Implement a fixed-capacity key-value cache with get(key) and put(key, value) . Both operations must run in O(1) average time. When the cache is full and a new key is inserted, evict the least recently used entry. A successful get also counts as a use.
Given a list of closed intervals [start, end] , merge all overlapping intervals and return the resulting non-overlapping intervals sorted by start value.

Comments (0)

Sign in to leave a comment

Loading comments...

Browse More Questions

More Coding & Algorithms•More Microsoft•More Machine Learning Engineer•Microsoft Machine Learning Engineer•Microsoft Coding & Algorithms•Machine Learning Engineer Coding & Algorithms

Implement cache and merge intervals

Quick Overview

Comments (0)