My solution:
max(maximum(frequency),(n+1)/2)
Complexity O(NlogN)
Here’s my Solution
I tried the same using multiset but couldn’t get AC.
Can anyone please give me a test case where my solution could fail? Thanks!
@admin SUBMIT button is not available on the practise page of this problem.Pls look into it.
There is a way to solve this in O(n).
When I click on a solution it says “This XML file does not appear to have any style information associated with it. The document tree is shown below.”
Can someone find mistake in my
[1]
[1]: https://www.codechef.com/viewsolution/9231730
though i manually checked different test cases.
I want to submit for this problem but the submit button is not available
What is wrong with this
[1]??
[1]: https://www.codechef.com/viewsolution/9230426
@shariquemohd you can directly submit to: CodeChef: Practical coding for everyone ,i had just submitted like this.
Can’t see the solution.XML error.
Can someone please provide any test case in which given code gives wrong output.
Implemented using Max Priority Queue. But still getting WA.
Tried all the above test cases and Passed.
Can Anyone tell other test cases where my code might have failed
here is my link to solution CodeChef: Practical coding for everyone