It starts at 38:56! I'm mentally exhausted now and going to play some Rocket League. I will update this comment later with info about future streams.

@fosres

4 жыл бұрын

I think its interesting how even you sometimes play video games on your downtime. Did video games make you interested in coding? Please let us know in a future video how you got interested in programming in general.

@mayankraj6511

4 жыл бұрын

sir,please make an editorial on sorted vase (codechef may challenge) problem

@SiLLyIITian

4 жыл бұрын

Can you make a tutorial on this problem? . If you find it interesting www.codechef.com/JAN20B/problems/CHEFPSA

@cypherllc7297

4 жыл бұрын

whats your tier in rocket league

Watching you doing these problems in an hour I am motivated enough to do this in a day. This Saturday it's going to be fun.

Coming back to old videos to watch it again. So fun to watch how you tackle each problems

Green screen looks great Errichto! Keep up with the good work.

Can’t believe that at the problem “remove K digits” I knew it was a stack and errichto didn’t!

Even errichto gets TLE.

does making the input a const reference speed things up? Making it a reference obviously does but I thought const only told the compiler to do runtime checks (basically announcing intent that this is a read only parameter) Are there any optimizations that would speed up const x& vs x&?

Damn, I would like to see tourist vs william for easy problems, that would be interesting

could you please give a you workspace setup tour... that would be great!

Can somebody explain Errichto's solution (the algorithm) to the maximum sum circular subarray at 1:12:49? I am aware of the kadane's algorithm (find max and min) solution. But here he used a stack. Thanks.

Yeah, it wasss fun to watch man :)

Nice video. For perfect square problem, sqrt was not allowed.

I like your background, what theme name is that?

how to use your imie(debugger) function for arrays

Most people like us run our code first. This guy only clicks submit!!!. Man, I need that level of confidence

Can you do also for Python?

superb man!!

You Killed it bro 👍👍

Took me 4 days to complete what errichto did in 1-2 hours :P

Hey Erichto, would you like to make a video on how you think when you get a new problem. How do you think that which algorithm will be used in order to solve that problem. As a college student that video will be of great help. Thank you.

@darthmath1071

4 жыл бұрын

practice

Great video 👍

Nice work bro

43:05 what about using the bitwise exclusive or operator (^) on num and another integer that has all bits 1. The result is the complement of num? So for a signed int, the value -1 has all bits set to 1. So you'd return num ^ -1; edit: I guess they want you to trim all the leading 0 bits from num. You could find the lowest power of 2 that is higher or equal num, then subtract num from that and you have the complement.

@imshafay

4 жыл бұрын

in python you can just simple use string then use replacment with 0 to 1 and 1 to 0 (using hashmap replacement)

Hi Errichto. I just finished the c++ tutorial on youtube. But my doubt is should I learn the stl library now or start with competitive programming on hackerrank? Do reply🙂

@jas4768

4 жыл бұрын

Do both

At 53:23 (Valid Perfect Square problem) aren't you supposed not to use sqrt function at all (The notice in the problem denies use of built-in function sqrt()) ?

@vaibhav.polska

2 жыл бұрын

He did it for speedrun.

make tut for june challenge atleast those are medium & hard

These kinds of challenges are entertaining and fun, but do not understand me wrong I think most of us are here to learn. If I don't understand your code, why am I here right? For example, I didn't understand your code for the Maximum sum circular subarray and someone else in comments as well. I think it would be better problems with explanations. Anyway, you are doing a great job thanks.

@cliffcrosland

3 жыл бұрын

I think I understand the Maximum Sum Circular Subarray solution a bit. Not easy to explain in a KZread comment, but I'll give it a try. I believe it actually might be better to think of the data structure used in the solution as a queue instead of a stack. When the "first" variable is incremented, it's like the bottom of the stack is being removed, which is like popping the front of a queue. I'll call it a stack though to stay consistent with the solution. The stack contains prefix sums that are generated as we walk along the doubled array. The stack represents a sliding window of prefix sums. The window size can be at most "n". We remove the bottom of the stack (i.e. pop the front of the queue) to avoid exceeding that window size. Why do we run the "while" loop to pop prefix sums from the top of the stack? This happens when "a[i]" is negative or zero, causing "curr_prefix" to become less than or equal to one or more prefix sums at the top of the stack. When we pop a pair "(i, prefix_sum[i])" from the top of the stack, we are basically saying that we never want to use "i" as the left boundary of our window. When we are choosing the left boundary of our window, we will skip over those values of "i" because those will lead to strictly smaller answers. For example, if "prefix_sum[i] >= curr_prefix", then "curr_prefix - prefix_sum[i]" is going to be zero or negative. We want the largest possible answer, so it's better to skip that candidate. I did not explain that last part well, but hopefully this helps somewhat.

@sokhibsaid

3 жыл бұрын

@@cliffcrosland thanks

Can you please suggest which language is best for data structure and algorithm please suggest me..!!

@almuhimen8023

4 жыл бұрын

The language you know the most or most comfortable with

@dragon_warrior_

4 жыл бұрын

@@almuhimen8023 bhai koi bhi ek chalu to kar pehle

@almuhimen8023

4 жыл бұрын

@@dragon_warrior_ keya matlab apka?

Please make video on the problems of codechef may long challenge of Div 1.

@sourabhkhandelwal1568

4 жыл бұрын

He doesn't compete on Codechef.

And people like me take one day to solve one problem.

Alter hat der einen Dachschaden

Man i cannot even watch and type at the same speed

@Anonymous____________A721

7 ай бұрын

😂😂😂😂😂😂

wow

@Errichto One SMALL suggestion would be to give the PROBLEM LINK for leetcode along with the TIMESTAMP to quickly navigate to the problem. This will allow a more easy way to find which problems are being discussed in the video as it is longer video , people may find it difficult to check which problems are being discused and at what timestamp...Thanks Hope to see those changes in the UPCOMING VIDEOS.

Finally got Alex's live stream : www.twitch.tv/videos/637967738

You are given ordered triples (a, b, c) you have to convert it to (x, y, z) using only addition and multiplication of any integer. Note that a, b,c, x, y, z can be any integers it can be argued that maximum number of steps would be 3 for converting as we can add an integer to each of them but you need to find the minimum number of steps. Sir I am your great fan please reply soon. I an stuck here for a long time.

@amey7064

4 жыл бұрын

This is from the June Long Challenge. It is live right now. None shall tell you the solution. Find it yourself or read editorials after the contest.

@prahalad4651

4 жыл бұрын

@@amey7064 kudos, I solved it. I asked it in shear frustration but later I got an idea.

Didn't understood how firstUniqueChar() worked!

@cliffcrosland

3 жыл бұрын

He goes back and fixes it at 46:06

@cliffcrosland

3 жыл бұрын

btw, this is so fun to watch! thank you Errichto!

At Errichto - you are coding soo fast Please slow it down

kzread.info/dash/bejne/Yq2Zz7iRdKXIqco.html leetcode.com/explore/challenge/card/may-leetcoding-challenge/534/week-1-may-1st-may-7th/3320/ how that code for Day 5 (First Unique Character in a String) was Accepted? You just add each string char to set and then check if the set does not contain each char from same string. They all should be there and method should always return -1. I have submitted same program and it was not accepted. int firstUniqChar(string s) { set ss; for(char ch : s) { ss.insert(ch); } for(int i = 0; i if(!ss.count(s[i])) { return i; } } return -1; }

@yashkhatwani3198

2 жыл бұрын

same doubt

.think()

你们这是在干嘛？写的啥？

But the thing is being a programmer will not make you rich

love you =)))) i am gay =))) do you like that??? =))))

william better than you bro