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.
  1. Frequency Queries
  2. Discussions

Frequency Queries

  • hristod + 2 comments

    I have almost the same code as you, but I have a few tests failing, all in the test cases with 100000 operations :( If I pastge your code directly, it works. I've optimised my code to be as close as yours, just to try and see what happens, and it doesn't work. Can you see any difference?

    function freqQuery(queries) {
    let result = [];
    let freq = [];
    let map = {};

    for (let i = 0; i < queries.length; i++) {
        const [op, x] = queries[i];
        const f = map[x] || 0;

        if (op === 1) {
            map[x] = f + 1;
            freq[f] = (freq[f] || 0) - 1;
            freq[f+1] = (freq[f+1] || 0) + 1;
        }
        if (op === 2) {
            map[x] = f - 1;
            freq[f-1] += 1;
            freq[f] -= 1;
        }
        if (op === 3) {
            result.push(freq[x] > 0 ? 1 : 0);
        }
    }

    return result;
}
    • nitishchandel13 + 1 comment

      I have only put 1 condition in second case for if map[x] > 0 then execute the code.

      let result = [];
let freq = [];
let map = {};

for (let i = 0; i < queries.length; i++) {
    const [op, x] = queries[i];
    const f = map[x] || 0;

    if (op === 1) {
        map[x] = f + 1;
        freq[f] = (freq[f] || 0) - 1;
        freq[f + 1] = (freq[f + 1] || 0) + 1;
    }
    if (op === 2) {
        if (map[x] > 0) { 
            map[x] = f - 1;
            freq[f - 1] += 1;
            freq[f] -= 1;
        }
    }
    if (op === 3) {
        result.push(freq[x] > 0 ? 1 : 0);
    }
}
return result;
    • cchan1613 + 0 comments

      Learned something that I never used before: javascript engine can increase the size of an array with previous value intialized to undefined. Also the speed of accessing an array element using index, is way faster than the properties of an object. Thank you, ivanduka!