Implement an LRU cache with a capacity limit, where the least recently accessed element is removed upon overflow; get and put operations should work in constant time.