Codeforces Round 967 (Div 2) | Video Solutions - A to D | by Gaurish Baliga | TLE Eliminators

[@TLE_Eliminators]

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

[@surajmishra6900]

Love you Gaurish, I hope we get a lot of Gaurish videos from TLE eliminators in the future.

[@allmighty2000]

Gaurish always comes with best post contest solutions

[@sourabhtiwari4788]

Bro I was troubled by the problem c whole day you explained it in the simplest way just be frequent for uploading the solution for the rounds your video solutions are very intuitive to understand.

[@kshitijgarg7986]

very good explanation of C

[@sach_in_sigma]

that was super useful, thank you

[@priyanshkumar17]

The deque way was amazing. I used 2 pointers and a vector for creating the permutation with 1 in the middle.

[@64chaitanyaanand59]

good explanation. i still didnt understand D one. Maybe you could do a dry run in the case of a problem like D. Loved the video. thanks!

[@KartikeyTT]

0:40 A 8:26 B 21:24 C 34:44 D

[@priyanshkumar17]

Great explanation of C!! Thank you Sir

[@nemesis5391]

For B just use one half with increasing sequence and other half with decreasing sequence for permutation

[@rohitsonar8858]

For B I just keep numbers in vector if size is even then print -1 else reverse nums.begin,nums.end and then reverse nums.begin+n/2,nums.end and print nums

[@Ramneet04]

What's the time complexity for D problem??

[@akshatsharma5426]

I thought of the same approach for D but could not implement it

[@Harsh-w1i]

For problem C, how can we be so sure that the tree is rooted at 1. What if it's rooted at 2 instead of 1?

[@akshatsharma5426]

it is a tree you can assume it to be rooted at any node I would not change the overall structure and the corresponding parent of node

[@AyushVerma-ui7re]

there was no need to use a deque in B, just use for loop to first print the first half with increasing numbers, use odd numbers, then print the last half with decreasing even numbers. like 1 3 5 4 2

[@cqwshi]

i tried to do it but it is showing wrong answer in test case 2

[@AyushVerma-ui7re]

@@cqwshi #include #include #include using namespace std; int main(){ long long int t; cin>>t; while(t--){ int n; cin>>n; if(n==1) cout

[@Irakkli]

Thanks

[@kartiknagrale1479]

Hello

[@shanvi_ojha]

Runtime error on test 8 problem c

[@omkara477]

Make a video on Leetcode Biweekly 137

[@ashhar7284]

timestamp..pls

[@TLE_Eliminators]

It’s already there, from the very beginning

[@ashhar7284]

@@TLE_Eliminators nah it wasn't at the time i had watched it!, now it's there.