Data Structures Visualizer

Least Recent Used caching scheme is to remove the least recently used frame when the cache is full and a new page is referenced which is not there in the cache. Here's an implementation in reference to LRU Cache in an chat inbox.

Sudoku can be solved by one by one assigning numbers to empty cells. Before assigning a number, check whether it is safe to assign. After checking for safety, assign the number, and recursively check whether this assignment leads to a solution or not.

Given an list of stones where each stone represents the max number of steps that can be made forward from that stone. Jump Game returns the minimum number of jumps required by the frog to reach the end of the stones queue.

Trie is an efficient information retrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length). Here's an implementation in contact search, auto completes and suggestions given by trie.

Given a 2D list of coins as input, using dynamic programming you have to choose either of the higher or lower platforms alternatively to maximise the profit.

Given a player, you have to make him reach end using mouse clicks. Click to run and release to stop. You have to make maximum score and avoiding the enemies. Collisions with enemies will reduce your score, and if it goes negative you lose.