[Amazon]Implement LRU cache

By -
Implement the LRU cache algorithm. Given following interface.
CacheStrategy<K, T> {
    // get the data by key from the cache.
    T get(K key);
 
    // put <key, data> pair to the cache
    void put(K key, T data);
}
where k is key and T is data part.
Note: All operation should be o(1).

Comments

  1. Tanmay ChakrabartyJanuary 27, 2012 at 5:46 PM

    Did not understand? R u talking about the Least Recent Used method we studied for Page Fault Counting in Operating System Concepts course?

    ReplyDelete
  2. AdminJanuary 28, 2012 at 12:39 AM

    @Tanmay yes it same as Least Recent Used method we studied for Page Fault Counting in Operating System Concepts

    ReplyDelete
  3. Tanmay ChakrabartyJanuary 28, 2012 at 9:03 AM

    Then I already have my program on this, I will post it hopefully tonight as my pc is at doctor's corner right now...

    ReplyDelete

Post a Comment

Popular posts from this blog

By -
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
Read more