Home Problem Set Companies Projects Contribute Requests

Loading Question...

LRU Cache Statistics- OYO Prism Online Assessment NSUT - OYO (Prism) Interview Question | Codinzhub

CodinzHub

Home Problem Set Companies Projects Contribute Requests

LRU Cache Statistics- OYO Prism Online Assessment NSUT

A computer system maintains an LRU (Least Recently Used) cache capable of storing at most K pages.

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

new page, so every access results in a cache miss.

solution.cpp

Run code to see test results

00:00 / 69:42

LRU Cache Statistics- OYO Prism Online Assessment NSUT

MediumMed•866 views

A computer system maintains an LRU (Least Recently Used) cache capable of storing at most K pages.

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

new page, so every access results in a cache miss.

MediumMed•866 views

Asked at

OYO (Prism)

Author: Amit Dayal

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.

Reviewed by Senior Engineers

GitHub

Up Next

Eternal Online Assessment - IIT Bombay

Eternal • Pending

Swapped Neighbour Scans Inmobi Online Assessment - IIT Kanpur 24th September

Inmobi • Pending

Peak Profit Window Inmobi Online Assessment - IIT Kanpur 24th September

Inmobi • Pending

Cold Start Inmobi Online Assessment - IIT Kanpur 24th September

Inmobi • Pending

Bank Transactions Squarepoint Capital - IIT Kanpur 26th September

Squarepoint Capital • Pending

Last updated Sep 2026