q1: why does pow(2, ( logn/log4)) does not work?

class Codechef { public static void main (String[] args) throws java.lang.Exception { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); // Number of test cases while (t-- > 0) { int n = sc.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = sc.nextInt(); } HashMap<Integer, Integer> map1 = new HashMap<>(); HashMap<Integer, Integer> map2 = new HashMap<>(); for (int i = 0; i < n; i++) { if (map1.containsKey(arr[i])) { map2.put(arr[i], i); } else { map1.put(arr[i], i); } } HashSet<Integer> set = new HashSet<>(); int sum = 0; // Total cost for (int i = 0; i < n; i++) { int l = map1.get(arr[i]); int r = map2.getOrDefault(arr[i], l); while (l < r) { if (map2.containsKey(arr[l]) && map2.get(arr[l]) <= r) { l++; } else if (map2.containsKey(arr[l])) { r = map2.get(arr[l]); l++; } else { break; } } sum += r - l + 1; set.add(arr[i]); } System.out.println(sum - set.size()); } } } Why is this code failing?

Very Nicely Explained C

For 01 it can be done in 2 operations but according to ur code it is giving one operation

Comefrom CF blog

great explanation for D bro

Perfect explanation both mathematically as well as intuitively. Really liked the approach to explain!!

For E ❤

Crystal Clear explanation for D🔥 Thank You sir❤

sir, in problem E, you could have explained using binary numbers with a1, a2, a3, a4,... but nevertheless it was a great explanation. Really helpful.

Explanation for problem E is very clean and intuitive, thanks!

Usually, whoever linkdel profile has title of pupil. He is 3 star on codechef. But despite of having 1247 on cf, I am stuck on 2 star on codechef. For me it's like solving 2 q in 10 min of div3 and then being stuck. Maier time I have solved 3rd q early also. But many times, I do fail. Sugestion pls. It's been 8 month, I am 2 star. 😢

Please fill the Feedback form for PCD: forms.gle/eKCcKwD9pQLTr9Xb8

4th problem is the definition of a good problem

what an explanation for E!!

Nice explanation

so smart for odd one i just used like 10 testcases and it finally worked out

best explanation

For E1, I think you are mentioning we can achieve 'w' at the kth position if we have strictly less than k weights greater than 'w' in some path. I think we can only say we can achieve some weight <= w in that case. Since we are taking the minimum 'w', we end up getting the right answer. Correct me if it's wrong.

Great Explanation......

Good explanation for C! You broke things down very well. The first thing that we think for this problem is classic pick/ not pick -> dp( i , cur_difference, prev_element ). But this will TLE. And thinking top down for the correct approach is not super intuitive.

TLE on test case 11 for problem B for your code

s = "nrnrs" , p = "*nn" is this true or false ? ( basically its an edge case for me )

nice explanation.

thanks for the easy editorial

Solution of D please

Really good explanation helped in solving yesterday's LeetCode problem 2381. Shifting Letters 2, thank you.

nice explanation soumojit

I was only able to solve 2 questions from the contest !!

can anybody tell me why that l to r loop not giving tle

can anybody tell me why when l is something of 00000 and r is something or 111111 then we know our a=100000.. and b=01111.... and if we are taking c as 0 then we can get a^b = max of all with all bit set and b^c = here we can get b c^a = here we can get a so answer looks like A^B + A + b any bhai or sir help please

excited

But if we consider a particular bit position and set it to 1 in all the three numbers then also for that Position after the xor the bit will be 1 hence it also maximizes. Because (1^1)^1=1.

great explaination for c1, thanks!!

Hi Raghav. Thanks for explaining the 4th one clearly, missed it in the contest as was unable to figure out the lexicographical catch.

Great explanation of C. Thank you Raghav bhaiya!! very helpful

i solved A,B in 30 min for the next 2hr i tried C this logic came into my mind but still could not solve it.. btw nice explanation..

nice explanation

Thank you, very helpful.

so near to c! didnt code but approach was almost same i just wasted my time so that i could choose c optimally but it wasn't even needed hahhaa

How can i buy TLE eliminator level 1 and 2 courses 12 version

Like this Technique , plz Post more videos like this , it will be helpful for , to solve medium lvl problems on OA round with Time constraint . today date : 05-01-2025

Awesome explanation for C!!

good explanation.

Please fill the Feedback form for PCD: forms.gle/GbcRiUTC5kqu6hjw5

do anyone know when will batch 13 of tle eliminators start??