E constraints were too tight. This complexity N*M is not expected for E.

Can u explain why we will use c++ 20? in A

can u explain this in case of k = 10 ^ 18 its answer = 1000000001000000000 why not its 1000000000099999999??

How base case for len=1,k is 1 for 0,k suppose [0,3]-->[3,3],[2,3],[4,3] there are 3 possibility coming

When Update problem F my bro, i really wanna solve that

w

g

The algorithm for problem B is is giving wrong answer on 8 th test case in java: import java.util.*; public class State{ public static void main(String args[]) { Scanner scm=new Scanner(System.in); int t=scm.nextInt(); for(int a=1;a<=t;a++) { long k=scm.nextLong(); long low=1; long high=(long)4e18; long mid=0; if(k==1) { System.out.println(2); } else { long answer=0; while(low<=high) { mid=(low+high)/2; long ans=mid-(long)Math.floor(Math.sqrt(mid)); if(ans<k) { low=mid+1; } else { answer=mid; high=mid-1; } } System.out.println(answer); } } } } Can someone suggest why?

Using dfs on graphs in D gives MLE on test case 7

please help me same code in c++ why not run in java. import java.util.Scanner; public class problema { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); while (t-- != 0) { long k = sc.nextLong(); long maxans = (4 * (long) Math.pow(10, 18)) ; long low = 1L; long high = maxans; long myans = 0L; while (low <= high) { long mid = ( low) + ((high-low) / 2); double ans = Math.sqrt(mid); long my = (mid - (long)ans); if (my < k) { low = mid + 1; } else { myans = mid; high = mid - 1; } } System.out.println(myans); } sc.close(); } } please help me give wrong answer in java same code. why giving wrong answer in testcases 8 .

Nice explanation sir, i have never solved problems on probability and modular inverse. Solution was a great help

use long long and submit in c++20 (if anyone getting tle)

Why we are still looking for mid in the else statement after setting answer equal to mid? In the else statement why we are still doing r=mid-1 after setting the answer equal to mid? In the problem B.

problem A is giving tle in test 3 in java

I just copy and paste your code(problem A). But it's getting TLE in 5th test case ?

what kind of question is b i mean similar question names?

I already did 2nd queation within 1 hour but showed wrong on test case 8 even when it was completely right because of the reason that i was using C++ 20 compiler instead of C++17 🥲🥲🥲🥲🥲

Can u explain the time complexity of A?

Hey can you please add time stamps for A, B , C, D, E so that we navigate easily

Very great explanation

The first code is now giving tle on 5th test case UPDATE: Sorry guys I was submitting In c++ 17 which is getting tle whereas c++20 It is getting accepted no idea why

your explanations are crisp and to the point! Love it

Gaurish sir is lit🔥🔥

hey ,where to practice mathematical question like 1st or 2nd one.

it should be e1>=e2 for third problem as e1 is smallest endpoint greater than k and e2 is largest but less than k

Please fill the feedback form for PCD: forms.gle/TamiaQyjCaXYobzP7

Hey Priyansh, this series is amazing, could you add more here ? If possible could you cover leetcodes problems ?

A- this give me TLE class Solution { public: string reverseNext(string temp){ string ans = ""; for(auto it : temp){ ans += ((it-'a' + 1) % 26) + 'a'; } return ans; } char kthCharacter(int k) { string word = "a"; for(int i=0; i<k; i++){ string temp = word; word += reverseNext(temp); } return word[k-1]; } }; first time got TLE in easy solution :)

Please fill the feedback form for PCD: forms.gle/htwvkSfiCyv62Lfn8

such a good explanation for B!

One can also use TRie for the prolem A.

6:30 bro be like , chalega kse nahi , le submission p submission 😂😂

explanation of task b was so clear

Thankyou bhai Love your content, currently 600 rating, road to CM

Problem C's solution is as good as it can be 😇 Step1 - Find solution range ( Best -- n , Worst -- 1 ) ( Height of decks ) Step2 - Iteration through range from best to worst - Construct the deck ( total_cards_in_all_decks, no_of_decks ) - Check its validity ( total_cards_in_all_decks >= minimum_cards_available && max_frequency_any_card_type <= no_of_decks ) - If valid, return

why we have freq1[word1[0]-'a']++; as we have initialised s and e from 0?

Good explanation for B ❤

Problem B explanation was great! I didn't found anyone explaining so clearly except this video

Can u tell the date when TLE 12.0 will be open?

can you explain why doesn't binary search works in c? I correctly implemented the check conditions however since i did by bs,i failed in later test cases

was contest difficult today or its me only who is feeling this😅

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

Nice explanation sir

thank you so much!

In your C solution you also get WA just bcz of not taking letter in a variable name temp . But I don't understand why. Can you please tell why?

D -> solution ( passed -with out tle ) void sol() { int n; cin>>n; int ans=0; vector<int>arr(n); for(auto &it:arr) cin>>it; vector<int>str(1<<20,0); for(int i=0;i<n;++i) { for(int j=i+1;j<n;++j) { str[arr[i]^arr[j]]++; } } for(auto &it:str) { if(it>1) { ans+=(it*(it-1)); } } cout<<4*ans<<" "; }

question 3 observation is just genius

Amazing explanation