My website

I found a problem at Beecrowd called Impossible Followers that made me come up with a new idea: what if I build a Segment Tree with nodes that are data structures that solve the problem of a Convex Hull Trick. Then I could solve this problem, because I built a... [Read More]

After using the Prüfer code in my Scientific Initiation project to find all non-isomorphic trees of a given size, I came up with an idea to improve this algorithm, since it was slow and I could not generate the trees-or even count them for larger values of n. Therefore, I... [Read More]

I started my journey in Competitive Programming when I was in high school, where I learned C and C++ and began solving problems on Brazilian platforms. At that time, I was only aware of basic programming competitions and had little exposure to more advanced topics in Competitive Programming. After starting... [Read More]

The Closest String Problem has many applications in bioinformatics and your target is to find a string t, given a set S with strings of same length, such that maximum Hamming Distance between t and all $S_i$, $1 \le i \le |S|$, be minimum. Since it belongs the np-hard class... [Read More]