卖力校园招聘会第一轮

[hero]

• Describe LRU cache and Implement it in any programming language.
• Given a snake and ladder board(coordinates of snakes and ladders), find the minimum number of dice throws required to reach the destination or last cell from source or 1st cell.
• implement a dictionary to search and insert words efficiently .

1. https://leetcode.com/problems/lru-cache/
2. https://leetcode.com/problems/snakes-and-ladders/
3. https://leetcode.com/problems/add-and-search-word-data-structure-design/