I am getting 2 wrong test cases

#1

please help getting 2 wrong test cases

#2

hello @raghavkhaterpal
wait i checking

#3

hey ur logic is correct,but it has time complexity of O(N^2).
because for each index i. u will take complete n round.
try to think of O(n) approach.

video ediotrial is also available for the same

#4

no i am getting wrong answer

#5

not tle and also this is the solution explained

#6

i have followed them only and i know it is n^2 worst case

#7

image
why r u printing -1.
here u should print ans

#8

yea i have done that change still 2 test cases not working

#9

ur code is working fine on leetcode.
image

there might be some issue with cb checker