Weekly contest 139

June 1, 2019

Introduction

It is my favorite weekly contest. I played the contest, but I could not solve any algorithm in the contest. I spent a few minutes to read last algorithm hard level, I decided not to work on. Even though I thought about time complexity, preprocessing can shorten the time; I moved to the first easy level, I found out that it was not easy for me.

My performance

I spent time to work on negative 2 base addition; I decided to try my luck if I can pass online judge. I came out the idea to solve it, but there is a bug in my code. I could not fix it.

I just could not believe the result. I spent one hour 30 minutes, but I could not solve any algorithm.

Actionable Items

I have to think about how to lower the risk, focus on the easy level algorithm first, and then try to solve the one at least.

If I focus on the hard level algorithm, I should be able to solve the algorithm.

You can`t promise to win every time, but you can make sure you give it all when you step on court. - latishajchan

June 3, 2019

I just wrote the two algorithms in the contest, and also I like to write my thoughts here as well.

To be an algorithm problem solver, I have to learn how to go through those learning tough moments. I certainly have to be humble, and work on getting ideas correctly.

The easy one I should try brute force solution, do not make it too tough to write. Once I have the brute force solution, I do not have any problem to write the code.

The medium level algorithm - add two binary number, I should carefully think about carry and all possible values. Be careful not to get into tough problem because of misunderstanding the problem.

Also it is a good idea to try to solve at least 10 algorithms a week. So I can continue to maintain curiousity and also mental toughness to deal with up and downs in the process.

1073. Adding Two Negabinary Numbers C# so many trial and error in my first practice
1073. Adding Two Negabinary Numbers Use stack to remove leading zero 
1073. Adding Two Negabinary Numbers learn to use next two bit to carry
1071. Greatest Common Divisor of Strings brute force solution missed in weekly contest
1074. Number of Submatrices That Sum to Target write code first and then figure out what is the idea