Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6379 |

@blackshadows | 6329 |

@mb1973 | 5358 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3357 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@ritiksethi21 | 1050 |

@aroranayan999 | 807 |

@RizulBansal | 685 |

@ashishtrehan002 | 538 |

@hemantgarg923 | 528 |

@simrangoyal | 526 |

@ronaldo77 | 520 |

@thanosagain | 505 |

@anishrajan | 505 |

@ssparteek470 | 495 |

@rahul2312 | 491 |

Complete Leaderboard |

Given an array nums** **of n elements and q queries . Each query consists of two integers l and r . You task is to find the number of elements of nums[] in range [l,r] which occur atleast k times.

**Example 1:**

**Input: **nums = {1,1,2,1,3}, Queries = {{1,5},
{2,4}}, k = 1
**Output: **{3,2}
**Explanation: **For the 1st query, from l=1 to r=5
1, 2 and 3 have the frequency atleast 1.
For the second query, from l=2 to r=4, 1 and 2 have
the frequency atleast 1.

**Your Task:**

Your task is to complete the function **solveQueries() **which takes nums, Queries and k as input parameter and returns a list containg the answer for each query.

**Expected Time Complexity: **O(n*sqrt(n)*log(n))

**Expected Space Compelxity: **O(n)

**Constraints:**

1 <= n, no of Queries, k <= 10^{4}

1 <= nums[i] <= 10^{3}

1 <= Queries[i][0] <= Queries[i][1] <= n

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Interesting Queries

...