René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"[FEATURE]: [ENHANCEMENT]: Add LRU (Least Recently Used) Cache implementation","articleBody":"### Motivation\n\n### Description\nCurrently, the repository lacks a standardized implementation of an **LRU (Least Recently Used) Cache**. This is a fundamental data structure in computer science used for memory management and caching strategies.\n\n### Proposed Solution\nI propose adding an LRU Cache implementation that achieves **O(1)** time complexity for both `get` and `put` operations by combining:\n1.  **A Doubly Linked List:** To maintain the order of elements based on their usage.\n2.  **A Hash Map (Map):** To provide fast access to nodes by their keys.\n\n### Implementation Details\n- **BaseCache (Abstract Class):** Defines the contract for cache implementations, demonstrating OOP abstraction.\n- **LRUCache (Concrete Class):** Extends `BaseCache` and manages the pointer logic for eviction and updates.\n- **Generics:** Supports any key-value types `\u003cK, V\u003e`.\n- **Unit Tests:** Comprehensive coverage for eviction, updates, and capacity constraints.\n\nI have already implemented this locally and would like to contribute it.\n\n### Examples\n\n_No response_\n\n### Possible workarounds\n\n_No response_","author":{"url":"https://github.com/MOHD-TAHA-KHAN","@type":"Person","name":"MOHD-TAHA-KHAN"},"datePublished":"2026-05-07T18:56:22.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/304/TypeScript/issues/304"}