Year 2024

 

Year 2024 

 

 

Leetcode

In 2023 I reached a contest rating of 2,351 and my best contest was a ranking of 121.  I do have to get myself out of a slump currently though.

For 2024 I hope to beat that and achieve a contest rating above 2,400, and improve on my best rank in a contest.

Codeforces

In 2023 I reached a contest rating of 1508, and not sure what is my best performance, I think it may be between the 1,337 in a division 2 round and 364 in a division 3 round.

For 2024 I hope to become an unofficial participant for division 3 rounds and get a rating above 1,600 and become an expert.


 

AtCoder

In 2023 I reached a contest ranking of 1059.  I have a bit of difficulty attending these consistently because they are at 6 or 7 am in my time zone.  My best rank was 850 in an ABC round.

In 2024 I hope to reach a contest ranking above 1,200

 

CodeChef

I just started using codechef in 2023.  I'm testing around and seeing if I enjoy the platform. I was able to get into division 3 in one division 4 round.

But I would say my goal for 2024 would be to get into division 2, which means a rating above 1,600



Adventofcode

In 2023 I feel like I learned a lot from advent of code, did not perform that well.  I was able to get all 50 stars though.  I did have to look up some hints when I was stuck on a few problems.

For year 2024, I hope to get all 50 stars and solve all the problems faster and without need to look up hints online as often. 


 

Noah's Rug

I want to complete this challenge in 2024

https://hanukkah.bluebird.sh/5784/

 

CSES

In 2023 I ended up with 62 solved tasks

For 2024 I want to solve 100 more cses tasks

 

Meta Hacker Cup

In 2023 I had some luck with the contest, and was 173 places from qualifying for round 3.

In 2024 I hope to make it to round 3.




Project Euler
 
I want to get started on project euler, maybe aim to solve 30 semi-difficult problems this year.  I'm not going to try to solve ones that are really easy, but go for ones that are a little challenging for me.








 

 

Comments

Post a Comment

Popular posts from this blog

Codeforces Round 918 div4

Image
  Codeforces Round 918 (div 4)   Problem A Use the frequency to determine the element that appears once.   Problem B Have a set for each row and column with "ABC" and remove characters in specific (r, c) pairs. And there will remain a single set with just one character.     Problem C Determine if the sum is a squared integer.   Can use math.sqrt to determine this.   Problem D Create string of C and V for identifying the consonants and vowels. create a deque to store the locations of dots. Iterate over the CV string, and anytime you find CC, that means it must be CVC was the prior syllable.   Cause you found a CVCCXXX,   The other pattern that can appear is if XCVCVX,   if you see VCV, that means there must be a CVCVX,   You know there was a CV pattern before the CV of most recent.   Which the most recent could be a CVC, you don't know what X is yet.   But you know for the CV of prior.
Read more

Codeforces Round 920 div3

Image
  Codeforces Round 920 (div 3)     Problem F Square root trick, You can use the square root trick to calculate prefix sums in n * sqrt(n).  Where you compute the prefix sums for each step size from 1 to sqrt(n).  Now anytime you have a query where d <= sqrt(n) it can be solved in O(1) with the precomputed prefix sum.  Else it will have sqrt(n) iterations in brute force looping through to get the value.   You do need two prefix sums because you have to create the ones that will give the answer for this specific problem.  Which is a little bit tricky to derive.  Problem G   My approach was very bad for this problem.   You want to use a diagonal prefix sum and column-wise prefix sum.   But the thing is that implementation is very important.   If you try to pad by K to avoid where the diagonal is out of bounds you will end up with 10^5 by 10^5 matrix which is too large.   And if you pad by 1 for the diagonal prefix sum it is a difficult to deal with off by 1 situations.   The
Read more