12PM in Rome, Italy (Doing Codeforces)

Added: 2026-06-01

[00:00:00]We're officially in Rome, Italy.

[00:00:03]The last stop.

[00:00:06]And we're going to grind out some leetcode.

[00:00:10]It's hot here. I found a random corner.

[00:00:14]Show you where I'm at.

[00:00:15]I'm literally leetcoding off a random corner.

[00:00:19]But I found some shade. It's plus 30°.

[00:00:24]I'm hiding I'm hiding out in this random corner.

[00:00:28]It's kind of dirty corner, but I mean, it's perfect.

[00:00:34]Perfect place for optimal leetcode performance.

[00:00:39]Right behind the Colosseum.

[00:00:42]And it's hot, so people are just chilling. So, I mean Let's get straight into this. I'm going to grind out some questions and see how it goes from there.

[00:00:55]That's the backdrop.

[00:01:10]So, how much does Day 2 on a bus It's hot, so I have to just shoot this video and get out of here. That's That's what's going to happen.

[00:01:28]Connect to my 5G.

[00:01:30]How much does Day 2 on a bus cost? We define an integer to be the most common on a sub subsegment if if its number of occurrences on that subsegment is larger than the number of occurrences of any other integer in that sub subsegment.

[00:01:48]A subsegment of an array is uh consecutive segment of elements in the array A.

[00:02:00]Given an array A of size N and an integer K, determine if there exists a non-empty subsegment of A where K is the most common element.

[00:02:13]We define an integer to be the most common on a subsegment if it's number of occurrences on that subsegment Wait, let me just make sure that it's capturing my screen correctly.

[00:02:27]Okay, yeah.

[00:02:30]It's like like this.

[00:02:33]Perfect.

[00:02:37]Let me move my VS code.

[00:03:04]We define an integer to be the most common on a subsequence if it's number of occurrences on the sub segment if it's number of occurrences on that subsegment is larger than any other integer.

[00:03:51]Given an array of A of size N and integer K, determine if there exists a non-empty subsegment of A where K is the most Okay, let's look at the example.

[00:04:12]Man, it's hot.

[00:04:22]First line of each test case, N and K.

[00:04:37]N number of integers K equals K equals the element we want to be the most common.

[00:05:05]Now, you can hear the police here.

[00:05:11]If it's If its number of occurrences on that subsegment is larger than any other integer in that subsegment.

[00:05:20]So, if we're looking for four, I mean, this is easy.

[00:05:35]I think we just need to we just This is a very easy question. We just need to check if K exists.

[00:05:41]If K exists, if the element we want is in the array at all?

[00:06:07]Yeah, because Yeah, because if it's there, we just if it's any we just use it. Is in the array at all.

[00:06:33]I'm going to do some of the easier questions on Codeforces right now, but we're going to get to the hard ones and I don't want to be doing all the hard ones in the middle of the sun like this, so I need a proper setup to actually think those through. So, don't be complaining that oh, you're doing way too easy of a question, but I'm just trying to get get something done.

[00:06:56]Some of these questions are harder.

[00:06:57]These Codeforces questions are harder than leak code.

[00:07:20]You Go check out the weather out here. It's literally plus 30 and burning in the sun.

[00:07:29]N K first zero array equals input dot split if K in array print Yes.

[00:07:47]else Long session.

[00:08:20]Better work.

[00:08:23]Let's go.

[00:08:30]Oops.

[00:08:32]Let's go one down, one down. Look Look at my face. It's like just steaming, but look at this view.

[00:08:45]The things I do for y'all. Like honestly, I'm not going to lie to y'all.

[00:08:49]This corner that I picked is dirty. It smells bad. It smells awful.

[00:08:53]And I'm pulled up here to do this leak code question. Like come on. Drop a like.

[00:08:59]Drop a sub just for this.

[00:09:02]I'm really I am certified to each and every here. Let me show y'all the view again. I'm going to have to like disinfect everything.

[00:09:16]We out here. We out here.

[00:09:20]Let me do proper setup.

[00:09:30]How long has it been going? All right, we'll run for like 20 more minutes.

[00:09:35]Let's do this.

[00:09:39]This.

[00:09:43]Test test. Hopefully the audio is good cuz I'm only doing this in one take.

[00:09:58]A 10 by 10 target is made out of five rings as shown. Each ring has a different point value. The outermost ring one point is the is the next ring. Second is this Okay.

[00:10:12]Two points. So, one two.

[00:10:16]Vlad fired several arrows at the target.

[00:10:18]Help him determine how many points he got. If we could just do multiple test cases. The first line, okay.

[00:10:26]Yeah, this is easy as well. Just figure out the row and the column.

[00:10:32]Where the row.

[00:10:37]Or we can just make a hash map or we can calculate.

[00:10:41]What would this be?

[00:10:51]If row two Yeah, we can just put a if row column row is the column zero or is there or if it's row zero or column zero or this or that. Like the four cases.

[00:11:16]Or yeah.

[00:11:18]And then we have like elif condition.

[00:11:20]So, if that doesn't match, if it's in two row two If it's in row two, it would have hit this. Okay.

[00:11:32]We could We could a bunch of conditions here.

[00:11:52]So, the parse this input.

[00:12:27]We parse input.

[00:12:36]or go So, it's going to be 1 2 3 4 5 6 7 8 10 So, we're just going to parse out the rows.

[00:13:32]>> I got to get out of this little corner and ASA Shoot.

[00:14:03]What broke?

[00:14:26]God.

[00:14:33]Taking the biggest shower once I get out of this because I just feel dirty.

[00:14:50]This this corner is not the most sanitary corner.

[00:15:17]So we're just going to just literally pop out all the conditions for row in range.

[00:15:25]What is it? 5? 1 2 3 4 5 10 by 10 10 row column in the range 10 What we're going to do is if row equals 0 or row equals 9 or column equals 0 or column equals 9 if row the row column not equal to X bunch of conditions like that That was bull's eye.

[00:16:37]1 2 1 8 1 8 2 7 2 7 3 6 3 6 >> Mali gold beast Mali gold beast mode accepted accepted.

[00:17:31]It's time.

[00:17:33]Maybe we get like we'll do 6 7 more minutes.

[00:17:37]Probably one question because y'all don't understand how bad this corner is.

[00:17:48]I wish that I could just actually go live, but I can't.

[00:17:55]Rome. This city is honestly very beautiful city though.

[00:17:59]I really enjoyed my time at this city.

[00:18:01]I'm going to be back in this city.

[00:18:03]There's so much things to do. The architecture is beautiful. It's so inspirational.

[00:18:08]Like all of the work by the people in the Renaissance like Michelangelo, Raphael, all that stuff. I I was at the Vatican and I seen it. It's just just beautiful.

[00:18:18]Super motivational inspirational. So, definitely got to travel more.

[00:18:22]See all the art, but I mean, let's get back into this leak code.

[00:18:32]Last one.

[00:18:36]>> [snorts] >> There are N teams in a football tournament.

[00:18:41]Oh, now the sun's like straight up hitting my face.

[00:18:43]Yeah, I might have to get out of here soon.

[00:18:48]Okay, after after this question.

[00:18:52]There are N teams in a football tournament. Each pair of teams match up once. After every match Hack Janek receives two integers as the result of the match. The number of goals the two teams scored during the match.

[00:19:05]And this place has is getting me sick.

[00:19:06]The whole time I'm like my eyes is itchy and my nose is stuffed. I I thought I was it was cuz of me, but every time it's every time I leave this my my apartment or leave my hotel.

[00:19:22]After every match, Max receives two integers as a result. Remember goals of two teams scored in a match. The efficiency of a team is equal to not the number of total Man, hopefully this is easy so we just get out of here.

[00:19:48]Each match you get two integers.

[00:19:57]Number of goals scored by each team.

[00:20:07]Efficiency equals total number of goals minus total goals scored by the opponent in each of its matches.

[00:20:39]Turns out he forgot the efficiency of one of the teams. Given the efficiency of n minus one teams, what is the efficiency of the missing team? Oh, it's a math.

[00:20:54]You see?

[00:20:58]Team one versus team two, one and two.

[00:21:01]Okay.

[00:21:17]>> Okay.

[00:21:21]The first test case What was the possible tournament result?

[00:21:25]Team one.

[00:21:27]Okay, what are we given though?

[00:21:31]I'm going to have to move. The sun's starting to hit my head.

[00:21:37]No, we're going to stick it out.

[00:21:42]Got to focus up.

[00:21:52]What's the efficiency of the missing team?

[00:21:59]So, there's going to be four teams.

[00:22:08]First line is n equals the number of teams.

[00:22:13]Holy.

[00:22:19]My nose is getting stuffed by the second while I'm here.

[00:22:29]I'm just kidding.

[00:22:34]You know I wore my gym shirt.

[00:23:02]The efficiency kind of does it need to even out to zero? Yeah, it kind of needs to even out to zero.

[00:23:20]Yeah, I think it needs to even out to zero.

[00:24:05]Yeah, we just need to add them up.

[00:24:12]Holy, I'm getting out of here.

[00:24:25]Split.

[00:24:27]Um and balance.

[00:24:35]Split.

[00:24:39]And balance.

[00:24:43]Holy.

[00:24:44]Side of my face is burning for element input.

[00:24:58]No, no, I don't have that.

[00:25:27]>> Base 10. Oh yeah, we got to split.

[00:25:43]Accepted. All right.

[00:25:48]We're done our session.

[00:25:50]I took a big hit. I think I literally got sick from just chilling in this corner, but I mean one last I'll take y'all one last little view around the Colosseum.

[00:26:08]But we out. Last day of Rome. I'm actually going to go inside there today, but hopefully I didn't get sick, but I'll catch y'all in the next video and I'll be back in San Francisco and we're going to be streaming, making content.

[00:26:20]Like and subscribe.

[00:26:22]I think I had a great vacation.

[00:26:24]I feel like I got got to relax, got to check out, got to see a lot of inspirational stuff.

[00:26:31]But other than that, peace.