Loading Company...
This is a verified interview question from Google. Candidates reporting seeing this problem in recent Online Assessments (OAs) and onsite rounds. Mastering "Tier Task Count Sum - Google OA IIIT Allahabad" covers key patterns like Arrays.
"You are given an array time of N integers, where time[i] is the time required for the i-th task. You are also given K tier limits in an array tier. For each tier tier[j], all tasks with time[i] ≤ tier[j] belong to that tier. A task may belong to multiple tiers. Compute the total number of task occurrences across all tiers. ### Input - First line: N - Second line: K - Third line: N space-separated integers time[i] - Fourth line: K space-separated integers tier[j] ### Output Print a single integer: the total count."
Join thousands of developers practicing for Google.