Design Part 1 : LRU Cache | LeetCode

“Problem Statement”
“Class LRUCache”
“Double Linked List Node”
“Get and Put Operations”
“To add or Delete a Node”

--

--

--

Computer Science Enthusiast | 9+ Year of Software Evolution | @Sharechat, Groupon, Paytm, Myntra https://www.linkedin.com/in/therahulgoel/

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

QUDO NFTs DevBlog 01

Intricacies of Python

We Need a Cloud-Native Development Experience

Overview on Microservices over Monolithic Architecture

Big Monolith as Microservices

Headless Commerce | Codal | eCommerce Development Agency

Should you script at work?

Kotlin Users Group — Interview with organiser, Jakub Jablonski

Dynamic queries with Laravel

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Rahul Goel

Rahul Goel

Computer Science Enthusiast | 9+ Year of Software Evolution | @Sharechat, Groupon, Paytm, Myntra https://www.linkedin.com/in/therahulgoel/

More from Medium

[LeetCode] 1913. Maximum Product Difference Between Two Pairs (Swift)

Equal Stacks Swift HackerRank Solution

LeetCode #1 Two Sum — Swift solution

iOS-DispatchQueue and its WorkItem