Видео

this is wayyyy too underrated

sometimes I wonder do I have to morph into some creature to start being good at programming

Really thanks by watching this im getting confidence that I'm not the only one who struggles/suck at coding

R1 - G3: my solution count = 0 n = len(str1) for i in range(n): if str1[i] != str2[i]: count += 1 if count > 2: return False return count != 1

class Solution { public: int Solve(vector<vector<int>>& rectangles,unordered_map<int,int>&my_map){ int ele = 0; int max_element = INT_MIN; for(int i = 0;i<rectangles.size();i++){ if(rectangles[i][0]>rectangles[i][1]){ ele = rectangles[i][1]; }else{ ele = rectangles[i][0]; } my_map[ele]++; if(max_element<ele)max_element = ele; } int max_freq = 0; int max_freq_key = -1; for (auto& pair : my_map) { if (pair.second > max_freq) { max_freq = pair.second; max_freq_key = pair.first; } } if(max_element==max_freq_key){ return max_freq; } return my_map[max_element]; } int countGoodRectangles(vector<vector<int>>& rectangles) { unordered_map<int,int>my_map; return Solve(rectangles,my_map); } };

its a mix of cringe, elevated IQ, suspense, bugged npcs and nerdi things all in one place

Just dump the question In chatgpt, done.

~ 31:40 Quick comment for Dylan, I'd recommend Windows IoT Enterprise LTCS if you could get your hands on it, unfortunately it's not meant for consumers, no bloat, no ads etc., and then for the issue with wanting to use Linux you can use WSL and still use Adobe Applications. Mac, well, you could technically emulate it & sign it, but too much effort in my opinion.

All the problems in this competition are easier than Div3-A on Codeforces.

The *string match* instructions @ around 40:00 or so- is is written kinda weird for me- I wonder if that threw them off a bit. There is some weird choice words used there, the main things that sticks out is the "(not necessarily different)"; what does that refer to? It can't be the indices because the indices most certainly have to be different because it's referring to one string; and if its to the strings themselves, then that was oddly placed and seems like it's giving away too much info. If someone can see what I am missing there, please point it out for me. I have been trying to figure out what they mean there for the longest- however I do get the point of the challenge, just not why its written that way-

The real question is where did they fine Coder Commentators 😂

all the problems are very easy

36:53 function swap(a,b){ array1=a.split(''); array2=b.split(''); return array1.join('')===array2.reverse().join(''); }

I like how Bramble's reaction in 32:59 is just the same as me when wondering why my code wont work _🤣🤣🤣_

2:29:09 hahahaha. It's a basic arithmetic

The thrilllllllls of the second game was crazy !!! lol

In morning i had solved the same first two questions lol and then i saw this

my eyes just burned seeing these guys struggle at baby problems.

Where i can get the text of the test, i want to test with my solutions

one of the anchors look like an Indian.

coolest commentators ❤

The coolest commentators ❤

these are leetcode easy wtf

Hmm, is this serious or meant to be a comedy thing? Cause I skipped to 41:30 ish and there's no way these guys are stuck like that... Especially the guy on the right flipping return false and true. Or am I missing something?

1:20:24 wtf is that "daddy chill" meme

Mei looks like 2007 Messi 😭😭

Awesome thing!! How do I participate in this?

Mei gg.... try to keep it simple :P

На первой задаче выключил. Пять методов перепробовали, хотя решение на поверхности. Выключил на моменте set.insert(). Они даже базу языка не знают. Ни алгоритмов. О чем говорить?

This is first one from you guys...😅 Veryy good.

In the second problem, can't we just use Sn = (n*(n+1))/2 formula? (Sn = sum of first n integers starting from 1) Basically, what I thought is, just calculate the running sum of each row, then compare it with the Sn, if answer is not equal to Sn then simply return false. Else go forward. This solution might look good but there might be some bug in this, like what if the row is [6, -6, 6], the row sum is valid, but it does not have all the integers.

i can't coding, but i love to watch this

Love competitions like this, after discovering my passion for programming but still lack at some skills I'd love to get challenged with stuffs like this. Bet somebody here can defeat Gennady Korotkevich

for third question, just having same characters in both the strings is enough as when we have same characters, no matter in what way they are ordered, we can always arrange them correctly by successively swapping unordered characters

For the second problem what is taking them so long, in python there is a method called isDigit() which can be called from a string object. Make a local list, iterate that nxn matrix, cast everything into a string and check whether it is a digit and not zero, if yes append in that list (use copy.deepcopy() to avoid any errors). Whilst in the for loop check the boolean list, do *= (1*1=1, 1*0=0, 0*0=0). If all is true then return that boolean else return false.

Is this like some sort of amateur competition? Because all of these are leetcode easy. This pales magnitudes in comparison to easiest problem from actual coding contests like ICPC or from platforms like Codeforces lmao

Food! :)

57:47 step 1 : function GetSquares from rectangles => step 2: function from list output for step 1 => select distric value => find maxvalue=> count value => step 3: combine all step in code. Right or not?

43:53 => for(int i = 0;i<= string1.lengt;i++){ if(string1.Substring(i,1)!=string2.Substring(string2.lenght-i,1)){return false} } return true;

So many awkward moments on this video from everyone in a funny way.

Hahaha the commentators are funny, their vocal inflections are random and out of sync with relevance emphasis, then I saw what they looked like 😂😂

Hahaha the commentators are funny, they’re vocal inflections are random and out of sync with tone, then I saw what they looked like 😂😂

I'm scared whenever I start solving problem, so I just. I need to stop doing that.

I would quit after reading second sentence of the question

Do you know if it's possible to find the test files with the instructions? so that you can do the same exercises at home x)?

Why the host's are not seeing each other

in the Bramble vs Jo match,why did they waste so much time.How i observed the only thing you need is to pass all of the test,so they just need to write a simple code does not matter if it is too long,right.I have 1 experience in python and i wrote a 19 line code in like 2 minutes.You do not need to complicate it and make as short as possible.And we really need more competitions like this!

see the issue with python language here is the programmer is not thought on how computers and compilers think, their code has barely any structure giving a false logic in coding. However it remains as a pretty popular language because of how simple it is to learn and quite alot of things you caan create with it kind if like a lego.

This is so nerdy , where do i apply ?

i tried first issue but i don't have test case def solution(inputs): start_path = inputs[0][0] current_path = start_path while True: next_path = [p for p in inputs if p[0] == current_path] if not next_path: break next_path = next_path[0] or None current_path = next_path[1] return current_path