- 77
- 135 583
aryanc403
India
Registrace 6. 03. 2019
I'm Aryan. I started doing CP ~6 years ago (I did a JEE grind ~2 years before that). I have participated in a lot of contests in these 6 years. I had an opportunity to participate in ICPC World Finals (as a last-minute replacement for someone else) and CodeChef Snackdown World Finals.
In the ICPC World Finals, my team became the first Indian team to be crowned Asia West Champion by virtue of the best rank among Asia West teams. In Snackdown World Finals, I was 3rd in the Indian ranklist among ~35 Indian finalists. These are some of my achievements I'm proud of.
Apart from doing CP, I have been on the other side of the panel as well, preparing and testing problems for ICPC regionals, Indian IOITC, CodeChef, CodeForces contests, etc.
On the professional side, I graduated in 2021 and currently work as a Software Engineer in one of the MNCs. I don't have any experience in teaching people, but I'm working on developing it, too.
In the ICPC World Finals, my team became the first Indian team to be crowned Asia West Champion by virtue of the best rank among Asia West teams. In Snackdown World Finals, I was 3rd in the Indian ranklist among ~35 Indian finalists. These are some of my achievements I'm proud of.
Apart from doing CP, I have been on the other side of the panel as well, preparing and testing problems for ICPC regionals, Indian IOITC, CodeChef, CodeForces contests, etc.
On the professional side, I graduated in 2021 and currently work as a Software Engineer in one of the MNCs. I don't have any experience in teaching people, but I'm working on developing it, too.
Video
#Atcoder #ABC 345 "E - Colorful Subsequence" Editorial (By #AIR #1)
zhlédnutí 858Před 3 měsíci
#Atcoder #ABC 345 "E - Colorful Subsequence" Editorial (By #AIR #1)
#Codeforces round 930 "Bitwise Operation Wizard" Editorial
zhlédnutí 1,1KPřed 4 měsíci
#Codeforces round 930 "Bitwise Operation Wizard" Editorial
#Codeforces round 930 "Shuffle Party" Editorial
zhlédnutí 1,1KPřed 4 měsíci
#Codeforces round 930 "Shuffle Party" Editorial
#Codeforces round 930 "Pokémon Arena" Editorial
zhlédnutí 526Před 4 měsíci
#Codeforces round 930 "Pokémon Arena" Editorial
#Codeforces think-cell round 1 C. "Lexicographically Largest" editorial
zhlédnutí 2,3KPřed 4 měsíci
#Codeforces think-cell round 1 C. "Lexicographically Largest" editorial
#Codeforces think-cell round 1 A. "Maximise The Score" editorial
zhlédnutí 312Před 4 měsíci
#Codeforces think-cell round 1 A. "Maximise The Score" editorial
#Codeforces think-cell round 1 B. "Permutation Printing" editorial
zhlédnutí 982Před 4 měsíci
#Codeforces think-cell round 1 B. "Permutation Printing" editorial
#StopPostContestHacking How to play cat and mouse game ft leetcode contests (and a shadow ban)
zhlédnutí 635Před 4 měsíci
#StopPostContestHacking How to play cat and mouse game ft leetcode contests (and a shadow ban)
bro do you have any list of question for a beginner to practice that will be very helpful especially for dp
I did not understand how finding minimum xor in a contiguous range L to R, is done by taking (arr[i] & ~msks[j]) ? I watched the video you referred, but unable to extend it here. There we were taking xor of continuous elements. Could you explain the inner for loop in more detail, what each line achieves?
great logic for all problems, all intuitive. though the video has sound issue and also the drawing board issue where you are writing.
Thank you sir<3
Poor explanation
Great Explanation bro 🔥❤️
Aryan can you please help me with this problem : Find the number of triplets of substrings of string s, such that : 1.the 3 substrings must be non overlapping 2. the 3 substrings must be palindrome individually.
You can use DP for this, where dp[i][k] will be the number of ways you can divide the string up to index i into k non overlapping substrings which are palindrome individually. Now the TC for this would be O(3*n^2). If your constraints satisfy this TC then it's well and good otherwise we might have to think of a better approach.
Lund explanation
Won't there be (N+1) places where we can have 2 consecutive Dots.
Yes, we will have N+1 places.
super explanation❤🔥❤🔥🔥🔥🔥
You have reached your peak with this video
A - 5:40
As usual, very good explanation😘😘
I was able to solve ABCE . Any tips for solving problems with lower constraints? I am only able to solve O(n) and O(nlogn) ish solutions and just can't think when the constraints are lower