Leetcode Weekly Contest 417 | Video Solutions - A to D | by Raghav Goel | TLE Eliminators

[@TLE_Eliminators]

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

[@universalcosmologist3675]

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

[@itzzRaghav]

e1 is the smallest endpoint with >= k (it's not > k) consonants and e2 is the largest endpoint with

[@TON-108]

Am i only one who felt Problem C too hard?

[@mk_0380]

yes

[@TON-108]

@@mk_0380 😭

[@nikhilkumarv2577]

Plz fix ur mic, it give a little sharp noise at the end of each word, it's really disturbing and gives head ace to me. Rest all is good 🛐🛐

[@Abhay14]

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

[@itzzRaghav]

Your for loop inside kthCharacter() method has k iterations, and the size of word will double in each iteration. So if k is 30, then the size of the string word will become 2^30 which we can't store in a string. And k can be as large as 500, so this solution wouldn't work.