Artyom Leonov
Design and implement a Least Recently Used (LRU) cache with `get(key)` and `put(key, value)` operations.
Create two threads, one printing even numbers and the other printing odd numbers in sequence.
You are given an array containing `n` distinct numbers taken from `0, 1, 2, ..., n`. Find the missing number. **Example:** ``` Input: [3, 0, 1] Output: 2 ```
Design a system like Bit.ly that converts long URLs into short ones and allows redirection. Consider database storage, scaling, and analytics.
Given the head of a singly linked list, reverse the list and return the new head. **Example:** ``` Input: 1 -> 2 -> 3 -> 4 -> 5 Output: 5 -> 4 -> 3 -> 2 -> 1 ```