https://yxlow07.github.io/tags/algorithms/Recent content in Algorithms on Yu Xuan's PortfolioHugoen-usSun, 28 Dec 2025 12:00:00 +0800https://yxlow07.github.io/blog/aicc-2nd/Mon, 29 Dec 2025 17:00:00 +0800https://yxlow07.github.io/blog/aicc-2nd/Intro My first competition in quite a few months! I’m quite new to the scene so don’t slam me for the suboptimal solutions here. The theme for this competition is NLP, Audio and CV. After spending ~10 minutes reading the problem statements, I think the difficulty rank is Essay Gap < Face Matching < Audio Demixing. Task 1: Essay Gap Problem statement (simplified): Given a cloze task with missing sentence, train/fine-tune a model to choose the best choice from 4 options that maximizes the coherence of the text.https://yxlow07.github.io/blog/cses-editorials/Sun, 11 May 2025 12:00:00 +0800https://yxlow07.github.io/blog/cses-editorials/Introduction CSES Problemset is a collection of competitive programming problems that are frequently used in contests. This blog post contains a collection of editorials for the problems in CSES Problemset. The solutions are written in C++ and are intended to be teach you the concept of the problem. Problems may be accessed at CSES Problemset. Template I will be using 1#include <bits/stdc++.h> 2using namespace std; 3 4#define ff(i, a, b) for (int i = a; i <= b; i++) 5#define fb(i, b, a) for (int i = b; i >= a; i--) 6#define loop(a, b) for (auto &a : b) 7#define nl '\n' 8#define sp ' ' 9#define ll long long 10 11void solve() { 12 // code here 13} 14 15signed main() 16{ 17 ios::sync_with_stdio(false); cin.https://yxlow07.github.io/blog/double-pendulum-balancer/Sun, 11 May 2025 12:00:00 +0800https://yxlow07.github.io/blog/double-pendulum-balancer/https://yxlow07.github.io/blog/dynamic_programming/Sat, 10 May 2025 12:00:00 +0800https://yxlow07.github.io/blog/dynamic_programming/Introduction to Dynamic Programming Dynamic programming is a powerful technique for solving complex problems by breaking them down into simpler subproblems. It’s particularly useful when the problem has overlapping subproblems and an optimal substructure. Key Principles Optimal Substructure: The optimal solution to a problem contains optimal solutions to its subproblems. Overlapping Subproblems: The same subproblems are solved multiple times when finding the solution. Implementation Example: Fibonacci Sequence The Fibonacci sequence is a classic example of a problem that can be efficiently solved using dynamic programming: