Caching

Caching or Indexing is a technique used to store counts of values which lie in a small range.

Example:
You are given a million numbers in a range, say ; now, if ordering is not important, a good way to store these value is to create an array of size 1000 and simply update counts of each index.

This has many benefits in simple array-based problems and string problems.

A more advanced topic is hashing, where large values of can be hashed into small index values with a collision probability which, if below a certain value, can be used in practice.

Usage:

  • Such mapping of elements from larger domain to comparatively smaller domain is useful when we need to compare elements only with or symbol. For example Coordinate Compression is useful in case of Longest Increasing Subsequence Problem and some other problems if
 
Related challenge for Caching
Go to Top
  1. Challenge Walkthrough
    Let's walk through this sample challenge and explore the features of the code editor.1 of 6
  2. Review the problem statement
    Each challenge has a problem statement that includes sample inputs and outputs. Some challenges include additional information to help you out.2 of 6
  3. Choose a language
    Select the language you wish to use to solve this challenge.3 of 6
  4. Enter your code
    Code your solution in our custom editor or code in your own environment and upload your solution as a file.4 of 6
  5. Test your code
    You can compile your code and test it for errors and accuracy before submitting.5 of 6
  6. Submit to see results
    When you're ready, submit your solution! Remember, you can go back and refine your code anytime.6 of 6
  1. Check your score