YoungForest's blog

This round was the second-to-last round of the year, and also a relatively easy one. I solved the third problem and the small data sets for problems 1 and 2. My algorithm for the second problem was correct in itself, but I did not correctly estimate the maximum number of bits in k or prevent overfl

1221. Split a String in Balanced Strings Understand the definition of balanced, and you will find that we only need to find positions where the counts of L and R are equal. Time complexity: O(N), Space complexity: O(1). 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 impl Solution { pub fn bala

Solved the problems after the contest. 1207. Unique Number of Occurrences Record the number of occurrences of each value by unordered_map. Check the unique using unordered_set. Time complexity: O(N), Space complexity: O(N). 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 class Solution { public:

Last Friday happened to be September 27, the holiday for the French-speaking region of Belgium. The school was closed, and with the weekend we had exactly three days off. On the train back from Amsterdam the previous week, we decided on this trip to Paris. The members of this trip were: me, zfn, lsd

In the first week after arriving in Europe and settling down, we went to beautiful Amsterdam in the Netherlands and two surrounding villages. Because it was our first trip out, many parts of the itinerary were poorly arranged, and the cost was relatively high. It was about 450 euros per person. By c

Last weekend I was in Belgium, and the contest time was from 4:30 a.m. to 6:00 a.m. The timing was unsuitable, so I did not participate. I found that only the biweekly contest time, Saturday from 4:30 p.m. to 6:00 p.m., is somewhat suitable. My goal of ranking 2000 this year is probably going to be

In the second half of this year, I was fortunate to have the opportunity to come to Belgium for an exchange semester, about five months. This is my first time going abroad for such a long period. Previously I also participated in a school program and went to the United Kingdom for a half-month study

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (7)392 / 6212YoungForest120:41:420:06:46 10:16:110:36:42nullThis was my last contest while still in China. Because of the time difference in Belgium, the weekly contest there is from 4:30 a.m. to 6:00 a.m. every Sunday. So I do not really have the conditi

Overall, the experience was very happy and I gained a lot. I was very lucky to attend this year’s Byte Camp. I think this one-week event was the most meaningful activity I attended this year. This year’s summer camp was divided into three tracks: Engineering, Algorithm, and Product. I participated

Problem description This problem was one I encountered in my Google intern phone interview in February. At that time I solved it in a very messy way and failed the first round directly. Today, after seeing a classmate’s explanation, I decided to try this problem again. After all, in the past half y