วีดีโอ

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

All of the problems are as listed below in order (LeetCode Problems) 1436. Destination City 2133. Check if Every Row and Column Contains All Numbers 1790. Check if One String Swap Can Make Strings Equal 1725. Number Of Rectangles That Can Form The Largest Square 1753. Maximum Score From Removing Stones 2279. Maximum Bags With Full Capacity of Rocks 290. Word Pattern 2357. Make Array Zero by Subtracting Equal Amounts 1935. Maximum Number of Words You Can Type 2225. Find Players With Zero or One Losses 1338. Reduce Array Size to The Half Thank you for posting this I was also solving all the problems side by side enjoyed solving it. Surprising Moment for me, 2:00:58 Really Impressed by the way Jacopo solved it. what a technique of counting. 2:29:15 He came up really quick amazing

i would like to submit my programs to see if i can pass :c

Are you ever going to bring it to Ghana. We would kill for it

"In a proper language" ooof 🙂

damn MEI is great , She is absolute 🔥🔥🔥

Why the presenters look so uncomfortable? It’s like they are being force to talk😅

This should be in Olympics ❤

1:48:54

ayoo bro this is insane

These were pretty easy codes i guess practicing in leetcode has improved my thought process or maybe they got pressured from being on focus

fun recursion for the 5th task. def solution(a,b,c): ls = sorted([a,b,c]) a = ls[-1] - 1 b = ls[1] - 1 c = ls[0] ls = sorted([a,b,c]) if ls[0] + ls[1] == 0: return 1 return 1 + solution(a, b, c )

The host girl looks like the gal Mormont from GoT

Where can I sign up to be a competitor? I would smoke these guys lmao

But like they are all slow??? what is this

Lol, the commentator on the left is so bad xD

charisma by the buckets.....

Is it possible to download the test cases and program it for yourself locally like for educational purposes?

Where can I get the testing package?

These questions are too easy...

I would love to join some programming team and share ideas. Really Im a hard worker in what I do, but currently im just dreaming to study in my free time, but I don`t know if I could learn fast, because I only have 4 hours max per day. What platform is most trust to programming learning?

This feels so wrong but also awesome at the same time.

R2 - G1 can be done with a simple comparison im sure: You have 3 values: find the largest value if the sum of the 2 smaller values is less than the larger, return this. else return the largest value. eg if(a+b < c) return a+b else return c

Layton vs Bramble : Solution : return (max(min(a+b,c),min(a+c,b), min(b+c,a)) Jacopo vs Mei : remain = [cap - rock for cap, rock in zip(capacity, rocks)] remain.sort() count = 0 for r in remain: if additionalRocks >= r: additionalRocks -= r count += 1 else: break return count