Baekjoon: https://acmicpc.net/user/jysim - https://solved.ac/profile/jysim
LeetCode: https://leetcode.com/junyoung-sim/
The following are some of my favorite problems so far.
| Source | ID | Description |
|---|---|---|
| BJ | 1067 | Find the maximum convolution of two circulating arrays via Fast Fourier Transform (FFT) |
| BJ | 1725 | Find the maximum rectangle area of a histogram via a segment tree for range minimum query. |
| BJ | 11066 | Find the optimal cost of combining a set of files via dynamic programming and prefix summations. |
| BJ | 1520 | Find the number of strictly descending paths via dynamic programming and DFS. |
| BJ | 9252 | Find the longest common sequence of two strings via dynamic programming. |
| BJ | 7576 | Find the minimum number of days it takes for a box of tomatoes to ripe via BFS |
| BJ | 14500 | Find the maximum sum of values that can be obtained by placing a tetromino on a given board via DFS. |
| BJ | 17404 | Find the optimal cost of painting an array of houses given a set of conditions via dynamic programming. |
| BJ | 14888 | Find the maximum and minimum value of a equation given the number and type of operators can be added. |
| BJ | 25682 | Find the least number of cells that need editing on a K x K chess board within a larger N x M chess board via prefix summation. |
| BJ | 2580 | Find the solution to a sudoku puzle via brute force. |
| BJ | 11444 | Find fibonacci numbers via matrix exponentiation. |