We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Data Structures
  3. Arrays
  4. Sparse Arrays
  5. Discussions

Sparse Arrays

  • mhadaily + 2 comments

    I'd like to share my solution for Javascript 

    function processData(input) {
    input = input.split('\n')
    var onlyNumber = input.filter(item => !isNaN(Number(item))).map(Number);
    var onlyStrings = input.filter(item => isNaN(Number(item)));
    var strings = onlyStrings.slice(0, onlyNumber[0]);
    var query = onlyStrings.slice(-onlyNumber[1]);
    query.map(item => {
        console.log(strings.filter(current => current === item).length);
    });
}

    1- Get strings and query respectively 2- iterate over query and filter strings with the same value and get length out of that which is the number of repetition

    could be better with reduce function, however, it passes all test cases.

    • jadex1 + 0 comments

      This is really cool. I wouldn't have thought of using the iSNaN property.

    • vaidyasaurabh08 + 0 comments

      Any way to do it in O(n) ?