Find Kth Unique Maximum

Q: Find Kth Unique Maximum

This question evaluates algorithmic problem-solving skills related to sorted arrays, deduplication, and order-statistics across combined datasets, measuring competence with array manipulation and distinctness reasoning.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

You are given two integer arrays sorted in non-decreasing order. Each array may contain duplicates, and the same value may appear in both arrays.

Find the k-th distinct largest integer across the combined values of both arrays.

Example:

nums1 = [1, 2, 4, 4, 5]
nums2 = [2, 4, 6]

The distinct values in descending order are [6, 5, 4, 2, 1], so:

k = 1 -> 6
k = 2 -> 5
k = 3 -> 4
k = 4 -> 2
k = 5 -> 1

Clarify what should be returned if there are fewer than k distinct values.

Find Kth Unique Maximum

Quick Overview

Comments (0)