Simulate a robot's movement on an infinite grid based on a sequence of commands and obstacles. Determine the square of the robot's final Euclidean distance from the origin.

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Design a system to shorten long URLs into tiny URLs and then retrieve the original URL from the shortened version. You need to implement both encoding and decoding functionalities.