1. What is precision?
2. Implement a hashmap.
3. How would you build a platform to onboard riders, similar to Zomato?
4. What do you understand by the word implementation?
5. Rank from Stream Problem Statement Given an array of integers ARR and an integer K, determine the rank of the element ARR[K]. Explanation: The rank of any element in ARR is defined as the number of elements smaller than ARR[K] that appear before it in the array. Input: The first line contains an integer T, the number of test cases. Each test case consists of: - A line with two integers N and K, the size of the array and the index of the element for which the rank is to be found. - A line with N space-separated integers representing the array ARR. Output: For each test case, output a single integer representing the rank of ARR[K]. Example: Input:ARR = [6, 2, 9, 7], K = 3Output:2Explanation:There are two elements smaller than ARR[3] = 7 on its left side (6 and 2). Constraints: 1 <= T <= 100 1 <= N <= 10^4 1 <= K <= N 0 <= ARR[i] <= 10^5 Time limit: 1 sec Note: You do not need to print anything; just implement the function to return the result.
Browse through a variety of job opportunities tailored to your skills and preferences. Filter by location, experience, salary, and more to find your perfect fit.
We have sent an OTP to your contact. Please enter it below to verify.
Instantly access job listings, apply easily, and track applications.
