Design LRU cache and pick k closest points

Q: Design LRU cache and pick k closest points

This question evaluates understanding of data structures and algorithmic techniques for designing an in-memory LRU cache (eviction policies, recency maintenance, and complexity analysis) and for selecting k closest points using sorting and selection/heap-based approaches.

Q: 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.

Question

Design a fixed-capacity in-memory cache that evicts the least recently used key when full. Support get(key) and put(key, value) in O(
average time. Describe the data structures you would use, how recency is updated on get/put, how evictions occur, and analyze time and space complexity.
Given an array of 2D points and an integer k, return the k points closest to the origin by Euclidean distance. First outline a straightforward approach using sorting. Then discuss improvements using Quickselect and a max-heap, including their time and space complexity and when you would choose each approach.

Design LRU cache and pick k closest points

Overview

Comments (0)