×

# HackerEarth: Help Katekar

 0 I couldn't understand what the following problem is trying to specify. Any inputs would be quite valuable. asked 14 Mar, 23:24 1 accept rate: 0%

 0 find a subset ( select some elements from array A) with maximum size (in short select maximum number of values from array A) such that the smallest value has smallest frequency and largest value selected has largest frequency and so on... 1 1 1 2 2 3 is not valid 1 2 2 3 3 3 is valid 1 3 3 5 5 5 5 is also valid 5 3 1 3 5 5 5 is also valid 1 2 3 3 is not valid as 1<2 but freq(1) is not < freq(2) answered 14 Mar, 23:31 1.6k●2●11 accept rate: 24% so if A[i] < A[j] then freq(A[i]) < freq(A[j]) (14 Mar, 23:34) Okay, thanks. That answer was helpful. I didn't get the question at first now I realized my mistake. (16 Mar, 09:28)
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×2,212